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"

    36

#include "../../date_func.h"

    37

#include "../ai.h"

    38

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

    39

    40

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

    41

static void AiNew_State_FirstTime(Player *p)

    42

{

    43

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

    44

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

    45

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

    46

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

    47

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

    48

	// We first have to init some things

    49

    50

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

    51

    52

	// The PathFinder (AyStar)

    53

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

    54

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

    55

	p->ainew.path_info.start_tile_tl = 0;

    56

	p->ainew.path_info.start_tile_br = 0;

    57

	p->ainew.path_info.end_tile_tl = 0;

    58

	p->ainew.path_info.end_tile_br = 0;

    59

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

    60

    61

	p->ainew.idle = 0;

    62

	p->ainew.last_vehiclecheck_date = _date;

    63

    64

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

    65

	p->ainew.action = AI_ACTION_BUS_ROUTE;

    66

    67

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

    68

	p->ainew.state = AI_STATE_WAKE_UP;

    69

}

    70

    71

    72

// This function just waste some time

    73

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

    74

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

    75

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

    76

//

    77

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

    78

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

    79

static void AiNew_State_Nothing(Player *p)

    80

{

    81

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

    82

	// If we are done idling, start over again

    83

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

    84

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

    85

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

    86

		// I mean.. the next tick ;)

    87

		p->ainew.state = AI_STATE_WAKE_UP;

    88

	}

    89

}

    90

    91

    92

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

    93

//  Currently supported:

    94

//    - Make new route

    95

//    - Check route

    96

//    - Build HQ

    97

static void AiNew_State_WakeUp(Player *p)

    98

{

    99

	int c;

   100

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

   101

	// First, check if we have a HQ

   102

	if (p->location_of_house == 0) {

   103

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

   104

		// Random till we found a place for it!

   105

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

   106

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

   107

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

   108

		//  so we do not change any status

   109

		return;

   110

	}

   111

   112

	Money money = p->player_money - AI_MINIMUM_MONEY;

   113

   114

	// Let's pick an action!

   115

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

   116

		c = AI_Random() & 0xFF;

   117

		if (p->current_loan > 0 &&

   118

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

   119

				c < 10) {

   120

			p->ainew.action = AI_ACTION_REPAY_LOAN;

   121

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

   122

			// Check all vehicles once in a while

   123

			p->ainew.action = AI_ACTION_CHECK_ALL_VEHICLES;

   124

			p->ainew.last_vehiclecheck_date = _date;

   125

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

   126

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

   127

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

   128

				if (c < 85) {

   129

					p->ainew.action = AI_ACTION_TRUCK_ROUTE;

   130

				} else {

   131

					p->ainew.action = AI_ACTION_BUS_ROUTE;

   132

				}

   133

			}

   134

#if 0

   135

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

   136

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

   137

				p->ainew.action = AI_ACTION_TRAIN_ROUTE;

   138

			}

   139

#endif

   140

		}

   141

   142

		p->ainew.counter = 0;

   143

	}

   144

   145

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

   146

		p->ainew.action = AI_ACTION_NONE;

   147

		return;

   148

	}

   149

   150

	if (_patches.ai_disable_veh_roadveh && (

   151

				p->ainew.action == AI_ACTION_BUS_ROUTE ||

   152

				p->ainew.action == AI_ACTION_TRUCK_ROUTE

   153

			)) {

   154

		p->ainew.action = AI_ACTION_NONE;

   155

		return;

   156

	}

   157

   158

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

   159

			money > AI_MINIMUM_LOAN_REPAY_MONEY) {

   160

		// We start repaying some money..

   161

		p->ainew.state = AI_STATE_REPAY_MONEY;

   162

		return;

   163

	}

   164

   165

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

   166

		p->ainew.state = AI_STATE_CHECK_ALL_VEHICLES;

   167

		return;

   168

	}

   169

   170

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

   171

	//  to build the route anyway..

   172

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

   173

			money > AI_MINIMUM_BUS_ROUTE_MONEY) {

   174

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

   175

			p->ainew.action = AI_ACTION_NONE;

   176

			return;

   177

		}

   178

		p->ainew.cargo = AI_NEED_CARGO;

   179

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   180

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

   181

		return;

   182

	}

   183

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

   184

			money > AI_MINIMUM_TRUCK_ROUTE_MONEY) {

   185

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

   186

			p->ainew.action = AI_ACTION_NONE;

   187

			return;

   188

		}

   189

		p->ainew.cargo = AI_NEED_CARGO;

   190

		p->ainew.last_id = 0;

   191

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   192

		p->ainew.tbt = AI_TRUCK;

   193

		return;

   194

	}

   195

   196

	p->ainew.state = AI_STATE_NOTHING;

   197

}

   198

   199

   200

static void AiNew_State_ActionDone(Player *p)

   201

{

   202

	p->ainew.action = AI_ACTION_NONE;

   203

	p->ainew.state = AI_STATE_NOTHING;

   204

}

   205

   206

   207

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

   208

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

   209

{

   210

	if (type == AI_CITY) {

   211

		const Town* t = GetTown(ic);

   212

		const Station* st;

   213

		uint count = 0;

   214

		int j = 0;

   215

   216

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

   217

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

   218

   219

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

   220

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

   221

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

   222

   223

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

   224

   225

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

   226

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

   227

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

   228

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

   229

		FOR_ALL_STATIONS(st) {

   230

			// Do we own it?

   231

			if (st->owner == _current_player) {

   232

				// Are we talking busses?

   233

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

   234

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

   235

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

   236

				// When was this station build?

   237

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

   238

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

   239

				count++;

   240

			} else {

   241

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

   242

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

   243

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

   244

				//  to build there

   245

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

   246

				// Is it around our city

   247

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

   248

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

   249

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

   250

				j++;

   251

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

   252

				if (j == 1) continue;

   253

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

   254

				//  a little chance that we still continue

   255

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

   256

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

   257

				// We don't like this station :(

   258

				return false;

   259

			}

   260

		}

   261

   262

		// We are about to add one...

   263

		count++;

   264

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

   265

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

   266

   267

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

   268

		return true;

   269

	}

   270

	if (type == AI_INDUSTRY) {

   271

		const Industry* i = GetIndustry(ic);

   272

		const Station* st;

   273

		int count = 0;

   274

		int j = 0;

   275

   276

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

   277

   278

		// No limits on delevering stations!

   279

		//  Or for industry that does not give anything yet

   280

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

   281

   282

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

   283

   284

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

   285

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

   286

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

   287

		FOR_ALL_STATIONS(st) {

   288

			// Do we own it?

   289

			if (st->owner == _current_player) {

   290

				// Are we talking trucks?

   291

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

   292

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

   293

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

   294

				// When was this station build?

   295

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

   296

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

   297

				count++;

   298

			} else {

   299

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

   300

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

   301

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

   302

				//  to build there

   303

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

   304

				// It does not take this cargo

   305

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

   306

				// Is it around our industry

   307

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

   308

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

   309

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

   310

				j++;

   311

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

   312

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

   313

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

   314

				// We don't like this station :(

   315

				return false;

   316

			}

   317

		}

   318

   319

		// We are about to add one...

   320

		count++;

   321

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

   322

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

   323

   324

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

   325

		return true;

   326

	}

   327

   328

	return true;

   329

}

   330

   331

   332

// This functions tries to locate a good route

   333

static void AiNew_State_LocateRoute(Player *p)

   334

{

   335

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

   336

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

   337

   338

	// We don't have a route yet

   339

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

   340

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

   341

		p->ainew.temp = -1;

   342

		// Reset the counter

   343

		p->ainew.counter = 0;

   344

   345

		p->ainew.from_ic = -1;

   346

		p->ainew.to_ic = -1;

   347

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

   348

			// For now we only have a passenger route

   349

			p->ainew.cargo = CT_PASSENGERS;

   350

   351

			// Find a route to cities

   352

			p->ainew.from_type = AI_CITY;

   353

			p->ainew.to_type = AI_CITY;

   354

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

   355

			p->ainew.cargo = AI_NO_CARGO;

   356

   357

			p->ainew.from_type = AI_INDUSTRY;

   358

			p->ainew.to_type = AI_INDUSTRY;

   359

		}

   360

   361

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

   362

		return;

   363

	}

   364

   365

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

   366

	p->ainew.counter++;

   367

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

   368

		// Switch back to doing nothing!

   369

		p->ainew.state = AI_STATE_NOTHING;

   370

		return;

   371

	}

   372

   373

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

   374

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

   375

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

   376

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

   377

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

   378

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

   379

			} else {

   380

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

   381

			}

   382

		}

   383

   384

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

   385

			// It was not a valid city

   386

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

   387

			//  to try again

   388

			p->ainew.temp++;

   389

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

   390

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

   391

			} else {

   392

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

   393

			}

   394

   395

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

   396

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

   397

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

   398

   399

			return;

   400

		}

   401

   402

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

   403

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

   404

   405

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

   406

		p->ainew.temp = -1;

   407

		return;

   408

	}

   409

   410

	// Find a to-city

   411

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

   412

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

   413

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

   414

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

   415

		} else {

   416

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

   417

		}

   418

	}

   419

   420

	// The same city is not allowed

   421

	// Also check if the city is valid

   422

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

   423

		// Maybe it is valid..

   424

   425

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

   426

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

   427

		 * route is.

   428

		 */

   429

   430

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

   431

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

   432

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

   433

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

   434

			int max_cargo;

   435

   436

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

   437

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

   438

   439

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

   440

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

   441

			if (distance <= max_cargo * AI_LOCATEROUTE_BUS_CARGO_DISTANCE) {

   442

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

   443

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

   444

				p->ainew.state = AI_STATE_FIND_STATION;

   445

   446

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

   447

					distance,

   448

					p->ainew.from_ic,

   449

					p->ainew.temp

   450

				);

   451

   452

				p->ainew.from_tile = 0;

   453

				p->ainew.to_tile = 0;

   454

   455

				return;

   456

			}

   457

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

   458

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

   459

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

   460

			bool found = false;

   461

			int max_cargo = 0;

   462

			uint i;

   463

   464

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

   465

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

   466

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

   467

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

   468

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

   469

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

   470

						// Found a compatible industry

   471

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

   472

						found = true;

   473

						p->ainew.from_deliver = true;

   474

						p->ainew.to_deliver = false;

   475

						break;

   476

					}

   477

				}

   478

			}

   479

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

   480

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

   481

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

   482

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

   483

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

   484

						// Found a compatbiel industry

   485

						found = true;

   486

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

   487

						p->ainew.from_deliver = false;

   488

						p->ainew.to_deliver = true;

   489

						break;

   490

					}

   491

				}

   492

			}

   493

			if (found) {

   494

				// Yeah, they are compatible!!!

   495

				// Check the length against the amount of goods

   496

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

   497

   498

				if (distance > AI_LOCATEROUTE_TRUCK_MIN_DISTANCE &&

   499

						distance <= max_cargo * AI_LOCATEROUTE_TRUCK_CARGO_DISTANCE) {

   500

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

   501

					if (p->ainew.from_deliver) {

   502

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

   503

					} else {

   504

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

   505

					}

   506

					p->ainew.state = AI_STATE_FIND_STATION;

   507

   508

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

   509

						distance,

   510

						p->ainew.from_ic,

   511

						p->ainew.temp

   512

					);

   513

   514

					p->ainew.from_tile = 0;

   515

					p->ainew.to_tile = 0;