1

/* $Id$ */

     2

     3

/*

     4

 * This AI was created as a direct reaction to the big demand for some good AIs

     5

 * in OTTD. Too bad it never left alpha-stage, and it is considered dead in its

     6

 * current form.

     7

 * By the time of writing this, we, the creator of this AI and a good friend of

     8

 * mine, are designing a whole new AI-system that allows us to create AIs

     9

 * easier and without all the fuzz we encountered while I was working on this

    10

 * AI. By the time that system is finished, you can expect that this AI will

    11

 * dissapear, because it is pretty obselete and bad programmed.

    12

 *

    13

 * Meanwhile I wish you all much fun with this AI; if you are interested as

    14

 * AI-developer in this AI, I advise you not stare too long to some code, some

    15

 * things in here really are... strange ;) But in either way: enjoy :)

    16

 *

    17

 *  -- TrueLight :: 2005-09-01

    18

 */

    19

    20

#include "../../stdafx.h"

    21

#include "../../openttd.h"

    22

#include "../../debug.h"

    23

#include "../../road_map.h"

    24

#include "../../station_map.h"

    25

#include "table/strings.h"

    26

#include "../../command_func.h"

    27

#include "trolly.h"

    28

#include "../../town.h"

    29

#include "../../industry.h"

    30

#include "../../station.h"

    31

#include "../../engine.h"

    32

#include "../../gui.h"

    33

#include "../../depot.h"

    34

#include "../../vehicle.h"

    36

#include "../ai.h"

    37

#include "../../order.h"

    38

    39

// This function is called after StartUp. It is the init of an AI

    40

static void AiNew_State_FirstTime(Player *p)

    41

{

    42

	// This assert is used to protect those function from misuse

    43

	//   You have quickly a small mistake in the state-array

    44

	//   With that, everything would go wrong. Finding that, is almost impossible

    45

	//   With this assert, that problem can never happen.

    46

	assert(p->ainew.state == AI_STATE_FIRST_TIME);

    47

	// We first have to init some things

    48

    49

	if (_current_player == 1) ShowErrorMessage(INVALID_STRING_ID, TEMP_AI_IN_PROGRESS, 0, 0);

    50

    51

	// The PathFinder (AyStar)

    52

	// TODO: Maybe when an AI goes bankrupt, this is de-init

    53

	//  or when coming from a savegame.. should be checked out!

    54

	p->ainew.path_info.start_tile_tl = 0;

    55

	p->ainew.path_info.start_tile_br = 0;

    56

	p->ainew.path_info.end_tile_tl = 0;

    57

	p->ainew.path_info.end_tile_br = 0;

    58

	p->ainew.pathfinder = new_AyStar_AiPathFinder(12, &p->ainew.path_info);

    59

    60

	p->ainew.idle = 0;

    61

	p->ainew.last_vehiclecheck_date = _date;

    62

    63

	// We ALWAYS start with a bus route.. just some basic money ;)

    64

	p->ainew.action = AI_ACTION_BUS_ROUTE;

    65

    66

	// Let's popup the news, and after that, start building..

    67

	p->ainew.state = AI_STATE_WAKE_UP;

    68

}

    69

    70

    71

// This function just waste some time

    72

//  It keeps it more real. The AI can build on such tempo no normal user

    73

//  can ever keep up with that. The competitor_speed already delays a bit

    74

//  but after the AI finished a track it really needs to go to sleep.

    75

//

    76

// Let's say, we sleep between one and three days if the AI is put on Very Fast.

    77

//  This means that on Very Slow it will be between 16 and 48 days.. slow enough?

    78

static void AiNew_State_Nothing(Player *p)

    79

{

    80

	assert(p->ainew.state == AI_STATE_NOTHING);

    81

	// If we are done idling, start over again

    82

	if (p->ainew.idle == 0) p->ainew.idle = AI_RandomRange(DAY_TICKS * 2) + DAY_TICKS;

    83

	if (--p->ainew.idle == 0) {

    84

		// We are done idling.. what you say? Let's do something!

    85

		// I mean.. the next tick ;)

    86

		p->ainew.state = AI_STATE_WAKE_UP;

    87

	}

    88

}

    89

    90

    91

// This function picks out a task we are going to do.

    92

//  Currently supported:

    93

//    - Make new route

    94

//    - Check route

    95

//    - Build HQ

    96

static void AiNew_State_WakeUp(Player *p)

    97

{

    98

	int c;

    99

	assert(p->ainew.state == AI_STATE_WAKE_UP);

   100

	// First, check if we have a HQ

   101

	if (p->location_of_house == 0) {

   102

		// We have no HQ yet, build one on a random place

   103

		// Random till we found a place for it!

   104

		// TODO: this should not be on a random place..

   105

		AiNew_Build_CompanyHQ(p, AI_Random() % MapSize());

   106

		// Enough for now, but we want to come back here the next time

   107

		//  so we do not change any status

   108

		return;

   109

	}

   110

   111

	Money money = p->player_money - AI_MINIMUM_MONEY;

   112

   113

	// Let's pick an action!

   114

	if (p->ainew.action == AI_ACTION_NONE) {

   115

		c = AI_Random() & 0xFF;

   116

		if (p->current_loan > 0 &&

   117

				p->old_economy[1].income > AI_MINIMUM_INCOME_FOR_LOAN &&

   118

				c < 10) {

   119

			p->ainew.action = AI_ACTION_REPAY_LOAN;

   120

		} else if (p->ainew.last_vehiclecheck_date + AI_DAYS_BETWEEN_VEHICLE_CHECKS < _date) {

   121

			// Check all vehicles once in a while

   122

			p->ainew.action = AI_ACTION_CHECK_ALL_VEHICLES;

   123

			p->ainew.last_vehiclecheck_date = _date;

   124

		} else if (c < 100 && !_patches.ai_disable_veh_roadveh) {

   125

			// Do we have any spots for road-vehicles left open?

   126

			if (GetFreeUnitNumber(VEH_ROAD) <= _patches.max_roadveh) {

   127

				if (c < 85) {

   128

					p->ainew.action = AI_ACTION_TRUCK_ROUTE;

   129

				} else {

   130

					p->ainew.action = AI_ACTION_BUS_ROUTE;

   131

				}

   132

			}

   133

#if 0

   134

		} else if (c < 200 && !_patches.ai_disable_veh_train) {

   135

			if (GetFreeUnitNumber(VEH_TRAIN) <= _patches.max_trains) {

   136

				p->ainew.action = AI_ACTION_TRAIN_ROUTE;

   137

			}

   138

#endif

   139

		}

   140

   141

		p->ainew.counter = 0;

   142

	}

   143

   144

	if (p->ainew.counter++ > AI_MAX_TRIES_FOR_SAME_ROUTE) {

   145

		p->ainew.action = AI_ACTION_NONE;

   146

		return;

   147

	}

   148

   149

	if (_patches.ai_disable_veh_roadveh && (

   150

				p->ainew.action == AI_ACTION_BUS_ROUTE ||

   151

				p->ainew.action == AI_ACTION_TRUCK_ROUTE

   152

			)) {

   153

		p->ainew.action = AI_ACTION_NONE;

   154

		return;

   155

	}

   156

   157

	if (p->ainew.action == AI_ACTION_REPAY_LOAN &&

   158

			money > AI_MINIMUM_LOAN_REPAY_MONEY) {

   159

		// We start repaying some money..

   160

		p->ainew.state = AI_STATE_REPAY_MONEY;

   161

		return;

   162

	}

   163

   164

	if (p->ainew.action == AI_ACTION_CHECK_ALL_VEHICLES) {

   165

		p->ainew.state = AI_STATE_CHECK_ALL_VEHICLES;

   166

		return;

   167

	}

   168

   169

	// It is useless to start finding a route if we don't have enough money

   170

	//  to build the route anyway..

   171

	if (p->ainew.action == AI_ACTION_BUS_ROUTE &&

   172

			money > AI_MINIMUM_BUS_ROUTE_MONEY) {

   173

		if (GetFreeUnitNumber(VEH_ROAD) > _patches.max_roadveh) {

   174

			p->ainew.action = AI_ACTION_NONE;

   175

			return;

   176

		}

   177

		p->ainew.cargo = AI_NEED_CARGO;

   178

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   179

		p->ainew.tbt = AI_BUS; // Bus-route

   180

		return;

   181

	}

   182

	if (p->ainew.action == AI_ACTION_TRUCK_ROUTE &&

   183

			money > AI_MINIMUM_TRUCK_ROUTE_MONEY) {

   184

		if (GetFreeUnitNumber(VEH_ROAD) > _patches.max_roadveh) {

   185

			p->ainew.action = AI_ACTION_NONE;

   186

			return;

   187

		}

   188

		p->ainew.cargo = AI_NEED_CARGO;

   189

		p->ainew.last_id = 0;

   190

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   191

		p->ainew.tbt = AI_TRUCK;

   192

		return;

   193

	}

   194

   195

	p->ainew.state = AI_STATE_NOTHING;

   196

}

   197

   198

   199

static void AiNew_State_ActionDone(Player *p)

   200

{

   201

	p->ainew.action = AI_ACTION_NONE;

   202

	p->ainew.state = AI_STATE_NOTHING;

   203

}

   204

   205

   206

// Check if a city or industry is good enough to start a route there

   207

static bool AiNew_Check_City_or_Industry(Player *p, int ic, byte type)

   208

{

   209

	if (type == AI_CITY) {

   210

		const Town* t = GetTown(ic);

   211

		const Station* st;

   212

		uint count = 0;

   213

		int j = 0;

   214

   215

		// We don't like roadconstructions, don't even true such a city

   216

		if (t->road_build_months != 0) return false;

   217

   218

		// Check if the rating in a city is high enough

   219

		//  If not, take a chance if we want to continue

   220

		if (t->ratings[_current_player] < 0 && AI_CHANCE16(1, 4)) return false;

   221

   222

		if (t->max_pass - t->act_pass < AI_CHECKCITY_NEEDED_CARGO && !AI_CHANCE16(1, AI_CHECKCITY_CITY_CHANCE)) return false;

   223

   224

		// Check if we have build a station in this town the last 6 months

   225

		//  else we don't do it. This is done, because stat updates can be slow

   226

		//  and sometimes it takes up to 4 months before the stats are corectly.

   227

		//  This way we don't get 12 busstations in one city of 100 population ;)

   228

		FOR_ALL_STATIONS(st) {

   229

			// Do we own it?

   230

			if (st->owner == _current_player) {

   231

				// Are we talking busses?

   232

				if (p->ainew.tbt == AI_BUS && (FACIL_BUS_STOP & st->facilities) != FACIL_BUS_STOP) continue;

   233

				// Is it the same city as we are in now?

   234

				if (st->town != t) continue;

   235

				// When was this station build?

   236

				if (_date - st->build_date < AI_CHECKCITY_DATE_BETWEEN) return false;

   237

				// Cound the amount of stations in this city that we own

   238

				count++;

   239

			} else {

   240

				// We do not own it, request some info about the station

   241

				//  we want to know if this station gets the same good. If so,

   242

				//  we want to know its rating. If it is too high, we are not going

   243

				//  to build there

   244

				if (!st->goods[CT_PASSENGERS].last_speed) continue;

   245

				// Is it around our city

   246

				if (DistanceManhattan(st->xy, t->xy) > 10) continue;

   247

				// It does take this cargo.. what is his rating?

   248

				if (st->goods[CT_PASSENGERS].rating < AI_CHECKCITY_CARGO_RATING) continue;

   249

				j++;

   250

				// When this is the first station, we build a second with no problem ;)

   251

				if (j == 1) continue;

   252

				// The rating is high.. second station...

   253

				//  a little chance that we still continue

   254

				//  But if there are 3 stations of this size, we never go on...

   255

				if (j == 2 && AI_CHANCE16(1, AI_CHECKCITY_CARGO_RATING_CHANCE)) continue;

   256

				// We don't like this station :(

   257

				return false;

   258

			}

   259

		}

   260

   261

		// We are about to add one...

   262

		count++;

   263

		// Check if we the city can provide enough cargo for this amount of stations..

   264

		if (count * AI_CHECKCITY_CARGO_PER_STATION > t->max_pass) return false;

   265

   266

		// All check are okay, so we can build here!

   267

		return true;

   268

	}

   269

	if (type == AI_INDUSTRY) {

   270

		const Industry* i = GetIndustry(ic);

   271

		const Station* st;

   272

		int count = 0;

   273

		int j = 0;

   274

   275

		if (i->town != NULL && i->town->ratings[_current_player] < 0 && AI_CHANCE16(1, 4)) return false;

   276

   277

		// No limits on delevering stations!

   278

		//  Or for industry that does not give anything yet

   279

		if (i->produced_cargo[0] == CT_INVALID || i->last_month_production[0] == 0) return true;

   280

   281

		if (i->last_month_production[0] - i->last_month_transported[0] < AI_CHECKCITY_NEEDED_CARGO) return false;

   282

   283

		// Check if we have build a station in this town the last 6 months

   284

		//  else we don't do it. This is done, because stat updates can be slow

   285

		//  and sometimes it takes up to 4 months before the stats are corectly.

   286

		FOR_ALL_STATIONS(st) {

   287

			// Do we own it?

   288

			if (st->owner == _current_player) {

   289

				// Are we talking trucks?

   290

				if (p->ainew.tbt == AI_TRUCK && (FACIL_TRUCK_STOP & st->facilities) != FACIL_TRUCK_STOP) continue;

   291

				// Is it the same city as we are in now?

   292

				if (st->town != i->town) continue;

   293

				// When was this station build?

   294

				if (_date - st->build_date < AI_CHECKCITY_DATE_BETWEEN) return false;

   295

				// Cound the amount of stations in this city that we own

   296

				count++;

   297

			} else {

   298

				// We do not own it, request some info about the station

   299

				//  we want to know if this station gets the same good. If so,

   300

				//  we want to know its rating. If it is too high, we are not going

   301

				//  to build there

   302

				if (i->produced_cargo[0] == CT_INVALID) continue;

   303

				// It does not take this cargo

   304

				if (!st->goods[i->produced_cargo[0]].last_speed) continue;

   305

				// Is it around our industry

   306

				if (DistanceManhattan(st->xy, i->xy) > 5) continue;

   307

				// It does take this cargo.. what is his rating?

   308

				if (st->goods[i->produced_cargo[0]].rating < AI_CHECKCITY_CARGO_RATING) continue;

   309

				j++;

   310

				// The rating is high.. a little chance that we still continue

   311

				//  But if there are 2 stations of this size, we never go on...

   312

				if (j == 1 && AI_CHANCE16(1, AI_CHECKCITY_CARGO_RATING_CHANCE)) continue;

   313

				// We don't like this station :(

   314

				return false;

   315

			}

   316

		}

   317

   318

		// We are about to add one...

   319

		count++;

   320

		// Check if we the city can provide enough cargo for this amount of stations..

   321

		if (count * AI_CHECKCITY_CARGO_PER_STATION > i->last_month_production[0]) return false;

   322

   323

		// All check are okay, so we can build here!

   324

		return true;

   325

	}

   326

   327

	return true;

   328

}

   329

   330

   331

// This functions tries to locate a good route

   332

static void AiNew_State_LocateRoute(Player *p)

   333

{

   334

	assert(p->ainew.state == AI_STATE_LOCATE_ROUTE);

   335

	// For now, we only support PASSENGERS, CITY and BUSSES

   336

   337

	// We don't have a route yet

   338

	if (p->ainew.cargo == AI_NEED_CARGO) {

   339

		p->ainew.new_cost = 0; // No cost yet

   340

		p->ainew.temp = -1;

   341

		// Reset the counter

   342

		p->ainew.counter = 0;

   343

   344

		p->ainew.from_ic = -1;

   345

		p->ainew.to_ic = -1;

   346

		if (p->ainew.tbt == AI_BUS) {

   347

			// For now we only have a passenger route

   348

			p->ainew.cargo = CT_PASSENGERS;

   349

   350

			// Find a route to cities

   351

			p->ainew.from_type = AI_CITY;

   352

			p->ainew.to_type = AI_CITY;

   353

		} else if (p->ainew.tbt == AI_TRUCK) {

   354

			p->ainew.cargo = AI_NO_CARGO;

   355

   356

			p->ainew.from_type = AI_INDUSTRY;

   357

			p->ainew.to_type = AI_INDUSTRY;

   358

		}

   359

   360

		// Now we are doing initing, we wait one tick

   361

		return;

   362

	}

   363

   364

	// Increase the counter and abort if it is taking too long!

   365

	p->ainew.counter++;

   366

	if (p->ainew.counter > AI_LOCATE_ROUTE_MAX_COUNTER) {

   367

		// Switch back to doing nothing!

   368

		p->ainew.state = AI_STATE_NOTHING;

   369

		return;

   370

	}

   371

   372

	// We are going to locate a city from where we are going to connect

   373

	if (p->ainew.from_ic == -1) {

   374

		if (p->ainew.temp == -1) {

   375

			// First, we pick a random spot to search from

   376

			if (p->ainew.from_type == AI_CITY) {

   377

				p->ainew.temp = AI_RandomRange(GetMaxTownIndex() + 1);

   378

			} else {

   379

				p->ainew.temp = AI_RandomRange(GetMaxIndustryIndex() + 1);

   380

			}

   381

		}

   382

   383

		if (!AiNew_Check_City_or_Industry(p, p->ainew.temp, p->ainew.from_type)) {

   384

			// It was not a valid city

   385

			//  increase the temp with one, and return. We will come back later here

   386

			//  to try again

   387

			p->ainew.temp++;

   388

			if (p->ainew.from_type == AI_CITY) {

   389

				if (p->ainew.temp > GetMaxTownIndex()) p->ainew.temp = 0;

   390

			} else {

   391

				if (p->ainew.temp > GetMaxIndustryIndex()) p->ainew.temp = 0;

   392

			}

   393

   394

			// Don't do an attempt if we are trying the same id as the last time...

   395

			if (p->ainew.last_id == p->ainew.temp) return;

   396

			p->ainew.last_id = p->ainew.temp;

   397

   398

			return;

   399

		}

   400

   401

		// We found a good city/industry, save the data of it

   402

		p->ainew.from_ic = p->ainew.temp;

   403

   404

		// Start the next tick with finding a to-city

   405

		p->ainew.temp = -1;

   406

		return;

   407

	}

   408

   409

	// Find a to-city

   410

	if (p->ainew.temp == -1) {

   411

		// First, we pick a random spot to search to

   412

		if (p->ainew.to_type == AI_CITY) {

   413

			p->ainew.temp = AI_RandomRange(GetMaxTownIndex() + 1);

   414

		} else {

   415

			p->ainew.temp = AI_RandomRange(GetMaxIndustryIndex() + 1);

   416

		}

   417

	}

   418

   419

	// The same city is not allowed

   420

	// Also check if the city is valid

   421

	if (p->ainew.temp != p->ainew.from_ic && AiNew_Check_City_or_Industry(p, p->ainew.temp, p->ainew.to_type)) {

   422

		// Maybe it is valid..

   423

   424

		/* We need to know if they are not to far apart from eachother..

   425

		 * We do that by checking how much cargo we have to move and how long the

   426

		 * route is.

   427

		 */

   428

   429

		if (p->ainew.from_type == AI_CITY && p->ainew.tbt == AI_BUS) {

   430

			const Town* town_from = GetTown(p->ainew.from_ic);

   431

			const Town* town_temp = GetTown(p->ainew.temp);

   432

			uint distance = DistanceManhattan(town_from->xy, town_temp->xy);

   433

			int max_cargo;

   434

   435

			max_cargo  = town_from->max_pass + town_temp->max_pass;

   436

			max_cargo -= town_from->act_pass + town_temp->act_pass;

   437

   438

			// max_cargo is now the amount of cargo we can move between the two cities

   439

			// If it is more than the distance, we allow it

   440

			if (distance <= max_cargo * AI_LOCATEROUTE_BUS_CARGO_DISTANCE) {

   441

				// We found a good city/industry, save the data of it

   442

				p->ainew.to_ic = p->ainew.temp;

   443

				p->ainew.state = AI_STATE_FIND_STATION;

   444

   445

				DEBUG(ai, 1, "[LocateRoute] found bus-route of %d tiles long (from %d to %d)",

   446

					distance,

   447

					p->ainew.from_ic,

   448

					p->ainew.temp

   449

				);

   450

   451

				p->ainew.from_tile = 0;

   452

				p->ainew.to_tile = 0;

   453

   454

				return;

   455

			}

   456

		} else if (p->ainew.tbt == AI_TRUCK) {

   457

			const Industry* ind_from = GetIndustry(p->ainew.from_ic);

   458

			const Industry* ind_temp = GetIndustry(p->ainew.temp);

   459

			bool found = false;

   460

			int max_cargo = 0;

   461

			uint i;

   462

   463

			// TODO: in max_cargo, also check other cargo (beside [0])

   464

			// First we check if the from_ic produces cargo that this ic accepts

   465

			if (ind_from->produced_cargo[0] != CT_INVALID && ind_from->last_month_production[0] != 0) {

   466

				for (i = 0; i < lengthof(ind_temp->accepts_cargo); i++) {

   467

					if (ind_temp->accepts_cargo[i] == CT_INVALID) break;

   468

					if (ind_from->produced_cargo[0] == ind_temp->accepts_cargo[i]) {

   469

						// Found a compatible industry

   470

						max_cargo = ind_from->last_month_production[0] - ind_from->last_month_transported[0];

   471

						found = true;

   472

						p->ainew.from_deliver = true;

   473

						p->ainew.to_deliver = false;

   474

						break;

   475

					}

   476

				}

   477

			}

   478

			if (!found && ind_temp->produced_cargo[0] != CT_INVALID && ind_temp->last_month_production[0] != 0) {

   479

				// If not check if the current ic produces cargo that the from_ic accepts

   480

				for (i = 0; i < lengthof(ind_from->accepts_cargo); i++) {

   481

					if (ind_from->accepts_cargo[i] == CT_INVALID) break;

   482

					if (ind_from->produced_cargo[0] == ind_from->accepts_cargo[i]) {

   483

						// Found a compatbiel industry

   484

						found = true;

   485

						max_cargo = ind_temp->last_month_production[0] - ind_temp->last_month_transported[0];

   486

						p->ainew.from_deliver = false;

   487

						p->ainew.to_deliver = true;

   488

						break;

   489

					}

   490

				}

   491

			}

   492

			if (found) {

   493

				// Yeah, they are compatible!!!

   494

				// Check the length against the amount of goods

   495

				uint distance = DistanceManhattan(ind_from->xy, ind_temp->xy);

   496

   497

				if (distance > AI_LOCATEROUTE_TRUCK_MIN_DISTANCE &&

   498

						distance <= max_cargo * AI_LOCATEROUTE_TRUCK_CARGO_DISTANCE) {

   499

					p->ainew.to_ic = p->ainew.temp;

   500

					if (p->ainew.from_deliver) {

   501

						p->ainew.cargo = ind_from->produced_cargo[0];

   502

					} else {

   503

						p->ainew.cargo = ind_temp->produced_cargo[0];

   504

					}

   505

					p->ainew.state = AI_STATE_FIND_STATION;

   506

   507

					DEBUG(ai, 1, "[LocateRoute] found truck-route of %d tiles long (from %d to %d)",

   508

						distance,

   509

						p->ainew.from_ic,

   510

						p->ainew.temp

   511

					);

   512

   513

					p->ainew.from_tile = 0;

   514

					p->ainew.to_tile = 0;

   515