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 "../../functions.h"

    24

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

    25

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

    26

#include "table/strings.h"

    27

#include "../../map.h"

    28

#include "../../tile.h"

    29

#include "../../command.h"

    30

#include "trolly.h"

    31

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

    32

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

    33

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

    34

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

    35

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

    36

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

    37

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

    38

#include "../../date.h"

    39

#include "../ai.h"

    40

    41

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

    42

static void AiNew_State_FirstTime(Player *p)

    43

{

    44

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

    45

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

    46

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

    47

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

    48

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

    49

	// We first have to init some things

    50

    51

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

    52

    53

	// The PathFinder (AyStar)

    54

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

    55

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

    56

	p->ainew.path_info.start_tile_tl = 0;

    57

	p->ainew.path_info.start_tile_br = 0;

    58

	p->ainew.path_info.end_tile_tl = 0;

    59

	p->ainew.path_info.end_tile_br = 0;

    60

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

    61

    62

	p->ainew.idle = 0;

    63

	p->ainew.last_vehiclecheck_date = _date;

    64

    65

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

    66

	p->ainew.action = AI_ACTION_BUS_ROUTE;

    67

    68

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

    69

	p->ainew.state = AI_STATE_WAKE_UP;

    70

}

    71

    72

    73

// This function just waste some time

    74

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

    75

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

    76

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

    77

//

    78

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

    79

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

    80

static void AiNew_State_Nothing(Player *p)

    81

{

    82

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

    83

	// If we are done idling, start over again

    84

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

    85

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

    86

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

    87

		// I mean.. the next tick ;)

    88

		p->ainew.state = AI_STATE_WAKE_UP;

    89

	}

    90

}

    91

    92

    93

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

    94

//  Currently supported:

    95

//    - Make new route

    96

//    - Check route

    97

//    - Build HQ

    98

static void AiNew_State_WakeUp(Player *p)

    99

{

   100

	int c;

   101

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

   102

	// First, check if we have a HQ

   103

	if (p->location_of_house == 0) {

   104

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

   105

		// Random till we found a place for it!

   106

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

   107

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

   108

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

   109

		//  so we do not change any status

   110

		return;

   111

	}

   112

   113

	Money money = p->player_money - AI_MINIMUM_MONEY;

   114

   115

	// Let's pick an action!

   116

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

   117

		c = AI_Random() & 0xFF;

   118

		if (p->current_loan > 0 &&

   119

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

   120

				c < 10) {

   121

			p->ainew.action = AI_ACTION_REPAY_LOAN;

   122

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

   123

			// Check all vehicles once in a while

   124

			p->ainew.action = AI_ACTION_CHECK_ALL_VEHICLES;

   125

			p->ainew.last_vehiclecheck_date = _date;

   126

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

   127

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

   128

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

   129

				if (c < 85) {

   130

					p->ainew.action = AI_ACTION_TRUCK_ROUTE;

   131

				} else {

   132

					p->ainew.action = AI_ACTION_BUS_ROUTE;

   133

				}

   134

			}

   135

#if 0

   136

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

   137

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

   138

				p->ainew.action = AI_ACTION_TRAIN_ROUTE;

   139

			}

   140

#endif

   141

		}

   142

   143

		p->ainew.counter = 0;

   144

	}

   145

   146

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

   147

		p->ainew.action = AI_ACTION_NONE;

   148

		return;

   149

	}

   150

   151

	if (_patches.ai_disable_veh_roadveh && (

   152

				p->ainew.action == AI_ACTION_BUS_ROUTE ||

   153

				p->ainew.action == AI_ACTION_TRUCK_ROUTE

   154

			)) {

   155

		p->ainew.action = AI_ACTION_NONE;

   156

		return;

   157

	}

   158

   159

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

   160

			money > AI_MINIMUM_LOAN_REPAY_MONEY) {

   161

		// We start repaying some money..

   162

		p->ainew.state = AI_STATE_REPAY_MONEY;

   163

		return;

   164

	}

   165

   166

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

   167

		p->ainew.state = AI_STATE_CHECK_ALL_VEHICLES;

   168

		return;

   169

	}

   170

   171

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

   172

	//  to build the route anyway..

   173

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

   174

			money > AI_MINIMUM_BUS_ROUTE_MONEY) {

   175

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

   176

			p->ainew.action = AI_ACTION_NONE;

   177

			return;

   178

		}

   179

		p->ainew.cargo = AI_NEED_CARGO;

   180

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   181

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

   182

		return;

   183

	}

   184

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

   185

			money > AI_MINIMUM_TRUCK_ROUTE_MONEY) {

   186

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

   187

			p->ainew.action = AI_ACTION_NONE;

   188

			return;

   189

		}

   190

		p->ainew.cargo = AI_NEED_CARGO;

   191

		p->ainew.last_id = 0;

   192

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   193

		p->ainew.tbt = AI_TRUCK;

   194

		return;

   195

	}

   196

   197

	p->ainew.state = AI_STATE_NOTHING;

   198

}

   199

   200

   201

static void AiNew_State_ActionDone(Player *p)

   202

{

   203

	p->ainew.action = AI_ACTION_NONE;

   204

	p->ainew.state = AI_STATE_NOTHING;

   205

}

   206

   207

   208

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

   209

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

   210

{

   211

	if (type == AI_CITY) {

   212

		const Town* t = GetTown(ic);

   213

		const Station* st;

   214

		uint count = 0;

   215

		int j = 0;

   216

   217

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

   218

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

   219

   220

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

   221

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

   222

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

   223

   224

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

   225

   226

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

   227

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

   228

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

   229

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

   230

		FOR_ALL_STATIONS(st) {

   231

			// Do we own it?

   232

			if (st->owner == _current_player) {

   233

				// Are we talking busses?

   234

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

   235

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

   236

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

   237

				// When was this station build?

   238

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

   239

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

   240

				count++;

   241

			} else {

   242

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

   243

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

   244

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

   245

				//  to build there

   246

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

   247

				// Is it around our city

   248

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

   249

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

   250

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

   251

				j++;

   252

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

   253

				if (j == 1) continue;

   254

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

   255

				//  a little chance that we still continue

   256

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

   257

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

   258

				// We don't like this station :(

   259

				return false;

   260

			}

   261

		}

   262

   263

		// We are about to add one...

   264

		count++;

   265

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

   266

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

   267

   268

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

   269

		return true;

   270

	}

   271

	if (type == AI_INDUSTRY) {

   272

		const Industry* i = GetIndustry(ic);

   273

		const Station* st;

   274

		int count = 0;

   275

		int j = 0;

   276

   277

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

   278

   279

		// No limits on delevering stations!

   280

		//  Or for industry that does not give anything yet

   281

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

   282

   283

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

   284

   285

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

   286

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

   287

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

   288

		FOR_ALL_STATIONS(st) {

   289

			// Do we own it?

   290

			if (st->owner == _current_player) {

   291

				// Are we talking trucks?

   292

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

   293

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

   294

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

   295

				// When was this station build?

   296

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

   297

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

   298

				count++;

   299

			} else {

   300

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

   301

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

   302

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

   303

				//  to build there

   304

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

   305

				// It does not take this cargo

   306

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

   307

				// Is it around our industry

   308

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

   309

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

   310

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

   311

				j++;

   312

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

   313

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

   314

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

   315

				// We don't like this station :(

   316

				return false;

   317

			}

   318

		}

   319

   320

		// We are about to add one...

   321

		count++;

   322

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

   323

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

   324

   325

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

   326

		return true;

   327

	}

   328

   329

	return true;

   330

}

   331

   332

   333

// This functions tries to locate a good route

   334

static void AiNew_State_LocateRoute(Player *p)

   335

{

   336

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

   337

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

   338

   339

	// We don't have a route yet

   340

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

   341

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

   342

		p->ainew.temp = -1;

   343

		// Reset the counter

   344

		p->ainew.counter = 0;

   345

   346

		p->ainew.from_ic = -1;

   347

		p->ainew.to_ic = -1;

   348

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

   349

			// For now we only have a passenger route

   350

			p->ainew.cargo = CT_PASSENGERS;

   351

   352

			// Find a route to cities

   353

			p->ainew.from_type = AI_CITY;

   354

			p->ainew.to_type = AI_CITY;

   355

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

   356

			p->ainew.cargo = AI_NO_CARGO;

   357

   358

			p->ainew.from_type = AI_INDUSTRY;

   359

			p->ainew.to_type = AI_INDUSTRY;

   360

		}

   361

   362

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

   363

		return;

   364

	}

   365

   366

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

   367

	p->ainew.counter++;

   368

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

   369

		// Switch back to doing nothing!

   370

		p->ainew.state = AI_STATE_NOTHING;

   371

		return;

   372

	}

   373

   374

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

   375

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

   376

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

   377

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

   378

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

   379

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

   380

			} else {

   381

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

   382

			}

   383

		}

   384

   385

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

   386

			// It was not a valid city

   387

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

   388

			//  to try again

   389

			p->ainew.temp++;

   390

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

   391

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

   392

			} else {

   393

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

   394

			}

   395

   396

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

   397

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

   398

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

   399

   400

			return;

   401

		}

   402

   403

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

   404

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

   405

   406

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

   407

		p->ainew.temp = -1;

   408

		return;

   409

	}

   410

   411

	// Find a to-city

   412

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

   413

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

   414

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

   415

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

   416

		} else {

   417

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

   418

		}

   419

	}

   420

   421

	// The same city is not allowed

   422

	// Also check if the city is valid

   423

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

   424

		// Maybe it is valid..

   425

   426

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

   427

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

   428

		 * route is.

   429

		 */

   430

   431

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

   432

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

   433

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

   434

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

   435

			int max_cargo;

   436

   437

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

   438

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

   439

   440

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

   441

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

   442

			if (distance <= max_cargo * AI_LOCATEROUTE_BUS_CARGO_DISTANCE) {

   443

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

   444

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

   445

				p->ainew.state = AI_STATE_FIND_STATION;

   446

   447

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

   448

					distance,

   449

					p->ainew.from_ic,

   450

					p->ainew.temp

   451

				);

   452

   453

				p->ainew.from_tile = 0;

   454

				p->ainew.to_tile = 0;

   455

   456

				return;

   457

			}

   458

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

   459

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

   460

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

   461

			bool found = false;

   462

			int max_cargo = 0;

   463

			uint i;

   464

   465

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

   466

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

   467

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

   468

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

   469

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

   470

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

   471

						// Found a compatible industry

   472

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

   473

						found = true;

   474

						p->ainew.from_deliver = true;

   475

						p->ainew.to_deliver = false;

   476

						break;

   477

					}

   478

				}

   479

			}

   480

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

   481

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

   482

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

   483

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

   484

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

   485

						// Found a compatbiel industry

   486

						found = true;

   487

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

   488

						p->ainew.from_deliver = false;

   489

						p->ainew.to_deliver = true;

   490

						break;

   491

					}

   492

				}

   493

			}

   494

			if (found) {

   495

				// Yeah, they are compatible!!!

   496

				// Check the length against the amount of goods

   497

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

   498

   499

				if (distance > AI_LOCATEROUTE_TRUCK_MIN_DISTANCE &&

   500

						distance <= max_cargo * AI_LOCATEROUTE_TRUCK_CARGO_DISTANCE) {

   501

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

   502

					if (p->ainew.from_deliver) {

   503

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

   504

					} else {

   505

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

   506

					}

   507

					p->ainew.state = AI_STATE_FIND_STATION;

   508

   509

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

   510

						distance,

   511

						p->ainew.from_ic,

   512

						p->ainew.temp

   513

					);

   514

   515

					p->ainew.from_tile = 0;