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

    26

#include "trolly.h"

    27

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

    28

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

    29

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

    30

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

    31

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

    32

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

    33

#include "../../vehicle_base.h"

    34

#include "../../vehicle_func.h"

    35

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

    36

#include "../ai.h"

    37

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

    38

#include "../../player_base.h"

    39

#include "../../player_func.h"

    40

    43

PlayerAiNew _players_ainew[MAX_PLAYERS];

    44

    45

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

    46

static void AiNew_State_FirstTime(Player *p)

    47

{

    48

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

    49

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

    50

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

    51

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

    52

	assert(_players_ainew[p->index].state == AI_STATE_FIRST_TIME);

    53

	// We first have to init some things

    54

    55

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

    56

    57

	// The PathFinder (AyStar)

    58

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

    59

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

    60

	_players_ainew[p->index].path_info.start_tile_tl = 0;

    61

	_players_ainew[p->index].path_info.start_tile_br = 0;

    62

	_players_ainew[p->index].path_info.end_tile_tl = 0;

    63

	_players_ainew[p->index].path_info.end_tile_br = 0;

    64

	_players_ainew[p->index].pathfinder = new_AyStar_AiPathFinder(12, &_players_ainew[p->index].path_info);

    65

    66

	_players_ainew[p->index].idle = 0;

    67

	_players_ainew[p->index].last_vehiclecheck_date = _date;

    68

    69

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

    70

	_players_ainew[p->index].action = AI_ACTION_BUS_ROUTE;

    71

    72

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

    73

	_players_ainew[p->index].state = AI_STATE_WAKE_UP;

    74

}

    75

    76

    77

// This function just waste some time

    78

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

    79

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

    80

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

    81

//

    82

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

    83

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

    84

static void AiNew_State_Nothing(Player *p)

    85

{

    86

	assert(_players_ainew[p->index].state == AI_STATE_NOTHING);

    87

	// If we are done idling, start over again

    88

	if (_players_ainew[p->index].idle == 0) _players_ainew[p->index].idle = AI_RandomRange(DAY_TICKS * 2) + DAY_TICKS;

    89

	if (--_players_ainew[p->index].idle == 0) {

    90

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

    91

		// I mean.. the next tick ;)

    92

		_players_ainew[p->index].state = AI_STATE_WAKE_UP;

    93

	}

    94

}

    95

    96

    97

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

    98

//  Currently supported:

    99

//    - Make new route

   100

//    - Check route

   101

//    - Build HQ

   102

static void AiNew_State_WakeUp(Player *p)

   103

{

   104

	int c;

   105

	assert(_players_ainew[p->index].state == AI_STATE_WAKE_UP);

   106

	// First, check if we have a HQ

   107

	if (p->location_of_house == 0) {

   108

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

   109

		// Random till we found a place for it!

   110

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

   111

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

   112

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

   113

		//  so we do not change any status

   114

		return;

   115

	}

   116

   117

	Money money = p->player_money - AI_MINIMUM_MONEY;

   118

   119

	// Let's pick an action!

   120

	if (_players_ainew[p->index].action == AI_ACTION_NONE) {

   121

		c = AI_Random() & 0xFF;

   122

		if (p->current_loan > 0 &&

   123

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

   124

				c < 10) {

   125

			_players_ainew[p->index].action = AI_ACTION_REPAY_LOAN;

   126

		} else if (_players_ainew[p->index].last_vehiclecheck_date + AI_DAYS_BETWEEN_VEHICLE_CHECKS < _date) {

   127

			// Check all vehicles once in a while

   128

			_players_ainew[p->index].action = AI_ACTION_CHECK_ALL_VEHICLES;

   129

			_players_ainew[p->index].last_vehiclecheck_date = _date;

   130

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

   131

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

   132

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

   133

				if (c < 85) {

   134

					_players_ainew[p->index].action = AI_ACTION_TRUCK_ROUTE;

   135

				} else {

   136

					_players_ainew[p->index].action = AI_ACTION_BUS_ROUTE;

   137

				}

   138

			}

   139

#if 0

   140

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

   141

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

   142

				_players_ainew[p->index].action = AI_ACTION_TRAIN_ROUTE;

   143

			}

   144

#endif

   145

		}

   146

   147

		_players_ainew[p->index].counter = 0;

   148

	}

   149

   150

	if (_players_ainew[p->index].counter++ > AI_MAX_TRIES_FOR_SAME_ROUTE) {

   151

		_players_ainew[p->index].action = AI_ACTION_NONE;

   152

		return;

   153

	}

   154

   155

	if (_patches.ai_disable_veh_roadveh && (

   156

				_players_ainew[p->index].action == AI_ACTION_BUS_ROUTE ||

   157

				_players_ainew[p->index].action == AI_ACTION_TRUCK_ROUTE

   158

			)) {

   159

		_players_ainew[p->index].action = AI_ACTION_NONE;

   160

		return;

   161

	}

   162

   163

	if (_players_ainew[p->index].action == AI_ACTION_REPAY_LOAN &&

   164

			money > AI_MINIMUM_LOAN_REPAY_MONEY) {

   165

		// We start repaying some money..

   166

		_players_ainew[p->index].state = AI_STATE_REPAY_MONEY;

   167

		return;

   168

	}

   169

   170

	if (_players_ainew[p->index].action == AI_ACTION_CHECK_ALL_VEHICLES) {

   171

		_players_ainew[p->index].state = AI_STATE_CHECK_ALL_VEHICLES;

   172

		return;

   173

	}

   174

   175

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

   176

	//  to build the route anyway..

   177

	if (_players_ainew[p->index].action == AI_ACTION_BUS_ROUTE &&

   178

			money > AI_MINIMUM_BUS_ROUTE_MONEY) {

   179

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

   180

			_players_ainew[p->index].action = AI_ACTION_NONE;

   181

			return;

   182

		}

   183

		_players_ainew[p->index].cargo = AI_NEED_CARGO;

   184

		_players_ainew[p->index].state = AI_STATE_LOCATE_ROUTE;

   185

		_players_ainew[p->index].tbt = AI_BUS; // Bus-route

   186

		return;

   187

	}

   188

	if (_players_ainew[p->index].action == AI_ACTION_TRUCK_ROUTE &&

   189

			money > AI_MINIMUM_TRUCK_ROUTE_MONEY) {

   190

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

   191

			_players_ainew[p->index].action = AI_ACTION_NONE;

   192

			return;

   193

		}

   194

		_players_ainew[p->index].cargo = AI_NEED_CARGO;

   195

		_players_ainew[p->index].last_id = 0;

   196

		_players_ainew[p->index].state = AI_STATE_LOCATE_ROUTE;

   197

		_players_ainew[p->index].tbt = AI_TRUCK;

   198

		return;

   199

	}

   200

   201

	_players_ainew[p->index].state = AI_STATE_NOTHING;

   202

}

   203

   204

   205

static void AiNew_State_ActionDone(Player *p)

   206

{

   207

	_players_ainew[p->index].action = AI_ACTION_NONE;

   208

	_players_ainew[p->index].state = AI_STATE_NOTHING;

   209

}

   210

   211

   212

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

   213

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

   214

{

   215

	if (type == AI_CITY) {

   216

		const Town* t = GetTown(ic);

   217

		const Station* st;

   218

		uint count = 0;

   219

		int j = 0;

   220

   221

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

   222

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

   223

   224

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

   225

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

   226

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

   227

   228

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

   229

   230

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

   231

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

   232

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

   233

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

   234

		FOR_ALL_STATIONS(st) {

   235

			// Do we own it?

   236

			if (st->owner == _current_player) {

   237

				// Are we talking busses?

   238

				if (_players_ainew[p->index].tbt == AI_BUS && (FACIL_BUS_STOP & st->facilities) != FACIL_BUS_STOP) continue;

   239

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

   240

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

   241

				// When was this station build?

   242

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

   243

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

   244

				count++;

   245

			} else {

   246

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

   247

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

   248

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

   249

				//  to build there

   250

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

   251

				// Is it around our city

   252

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

   253

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

   254

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

   255

				j++;

   256

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

   257

				if (j == 1) continue;

   258

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

   259

				//  a little chance that we still continue

   260

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

   261

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

   262

				// We don't like this station :(

   263

				return false;

   264

			}

   265

		}

   266

   267

		// We are about to add one...

   268

		count++;

   269

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

   270

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

   271

   272

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

   273

		return true;

   274

	}

   275

	if (type == AI_INDUSTRY) {

   276

		const Industry* i = GetIndustry(ic);

   277

		const Station* st;

   278

		int count = 0;

   279

		int j = 0;

   280

   281

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

   282

   283

		// No limits on delevering stations!

   284

		//  Or for industry that does not give anything yet

   285

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

   286

   287

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

   288

   289

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

   290

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

   291

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

   292

		FOR_ALL_STATIONS(st) {

   293

			// Do we own it?

   294

			if (st->owner == _current_player) {

   295

				// Are we talking trucks?

   296

				if (_players_ainew[p->index].tbt == AI_TRUCK && (FACIL_TRUCK_STOP & st->facilities) != FACIL_TRUCK_STOP) continue;

   297

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

   298

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

   299

				// When was this station build?

   300

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

   301

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

   302

				count++;

   303

			} else {

   304

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

   305

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

   306

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

   307

				//  to build there

   308

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

   309

				// It does not take this cargo

   310

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

   311

				// Is it around our industry

   312

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

   313

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

   314

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

   315

				j++;

   316

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

   317

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

   318

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

   319

				// We don't like this station :(

   320

				return false;

   321

			}

   322

		}

   323

   324

		// We are about to add one...

   325

		count++;

   326

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

   327

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

   328

   329

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

   330

		return true;

   331

	}

   332

   333

	return true;

   334

}

   335

   336

   337

// This functions tries to locate a good route

   338

static void AiNew_State_LocateRoute(Player *p)

   339

{

   340

	assert(_players_ainew[p->index].state == AI_STATE_LOCATE_ROUTE);

   341

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

   342

   343

	// We don't have a route yet

   344

	if (_players_ainew[p->index].cargo == AI_NEED_CARGO) {

   345

		_players_ainew[p->index].new_cost = 0; // No cost yet

   346

		_players_ainew[p->index].temp = -1;

   347

		// Reset the counter

   348

		_players_ainew[p->index].counter = 0;

   349

   350

		_players_ainew[p->index].from_ic = -1;

   351

		_players_ainew[p->index].to_ic = -1;

   352

		if (_players_ainew[p->index].tbt == AI_BUS) {

   353

			// For now we only have a passenger route

   354

			_players_ainew[p->index].cargo = CT_PASSENGERS;

   355

   356

			// Find a route to cities

   357

			_players_ainew[p->index].from_type = AI_CITY;

   358

			_players_ainew[p->index].to_type = AI_CITY;

   359

		} else if (_players_ainew[p->index].tbt == AI_TRUCK) {

   360

			_players_ainew[p->index].cargo = AI_NO_CARGO;

   361

   362

			_players_ainew[p->index].from_type = AI_INDUSTRY;

   363

			_players_ainew[p->index].to_type = AI_INDUSTRY;

   364

		}

   365

   366

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

   367

		return;

   368

	}

   369

   370

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

   371

	_players_ainew[p->index].counter++;

   372

	if (_players_ainew[p->index].counter > AI_LOCATE_ROUTE_MAX_COUNTER) {

   373

		// Switch back to doing nothing!

   374

		_players_ainew[p->index].state = AI_STATE_NOTHING;

   375

		return;

   376

	}

   377

   378

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

   379

	if (_players_ainew[p->index].from_ic == -1) {

   380

		if (_players_ainew[p->index].temp == -1) {

   381

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

   382

			if (_players_ainew[p->index].from_type == AI_CITY) {

   383

				_players_ainew[p->index].temp = AI_RandomRange(GetMaxTownIndex() + 1);

   384

			} else {

   385

				_players_ainew[p->index].temp = AI_RandomRange(GetMaxIndustryIndex() + 1);

   386

			}

   387

		}

   388

   389

		if (!AiNew_Check_City_or_Industry(p, _players_ainew[p->index].temp, _players_ainew[p->index].from_type)) {

   390

			// It was not a valid city

   391

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

   392

			//  to try again

   393

			_players_ainew[p->index].temp++;

   394

			if (_players_ainew[p->index].from_type == AI_CITY) {

   395

				if (_players_ainew[p->index].temp > GetMaxTownIndex()) _players_ainew[p->index].temp = 0;

   396

			} else {

   397

				if (_players_ainew[p->index].temp > GetMaxIndustryIndex()) _players_ainew[p->index].temp = 0;

   398

			}

   399

   400

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

   401

			if (_players_ainew[p->index].last_id == _players_ainew[p->index].temp) return;

   402

			_players_ainew[p->index].last_id = _players_ainew[p->index].temp;

   403

   404

			return;

   405

		}

   406

   407

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

   408

		_players_ainew[p->index].from_ic = _players_ainew[p->index].temp;

   409

   410

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

   411

		_players_ainew[p->index].temp = -1;

   412

		return;

   413

	}

   414

   415

	// Find a to-city

   416

	if (_players_ainew[p->index].temp == -1) {

   417

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

   418

		if (_players_ainew[p->index].to_type == AI_CITY) {

   419

			_players_ainew[p->index].temp = AI_RandomRange(GetMaxTownIndex() + 1);

   420

		} else {

   421

			_players_ainew[p->index].temp = AI_RandomRange(GetMaxIndustryIndex() + 1);

   422

		}

   423

	}

   424

   425

	// The same city is not allowed

   426

	// Also check if the city is valid

   427

	if (_players_ainew[p->index].temp != _players_ainew[p->index].from_ic && AiNew_Check_City_or_Industry(p, _players_ainew[p->index].temp, _players_ainew[p->index].to_type)) {

   428

		// Maybe it is valid..

   429

   430

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

   431

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

   432

		 * route is.

   433

		 */

   434

   435

		if (_players_ainew[p->index].from_type == AI_CITY && _players_ainew[p->index].tbt == AI_BUS) {

   436

			const Town* town_from = GetTown(_players_ainew[p->index].from_ic);

   437

			const Town* town_temp = GetTown(_players_ainew[p->index].temp);

   438

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

   439

			int max_cargo;

   440

   441

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

   442

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

   443

   444

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

   445

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

   446

			if (distance <= max_cargo * AI_LOCATEROUTE_BUS_CARGO_DISTANCE) {

   447

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

   448

				_players_ainew[p->index].to_ic = _players_ainew[p->index].temp;

   449

				_players_ainew[p->index].state = AI_STATE_FIND_STATION;

   450

   451

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

   452

					distance,

   453

					_players_ainew[p->index].from_ic,

   454

					_players_ainew[p->index].temp

   455

				);

   456

   457

				_players_ainew[p->index].from_tile = 0;

   458

				_players_ainew[p->index].to_tile = 0;

   459

   460

				return;

   461

			}

   462

		} else if (_players_ainew[p->index].tbt == AI_TRUCK) {

   463

			const Industry* ind_from = GetIndustry(_players_ainew[p->index].from_ic);

   464

			const Industry* ind_temp = GetIndustry(_players_ainew[p->index].temp);

   465

			bool found = false;

   466

			int max_cargo = 0;

   467

			uint i;

   468

   469

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

   470

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

   471

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

   472

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

   473

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

   474

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

   475

						// Found a compatible industry

   476

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

   477

						found = true;

   478

						_players_ainew[p->index].from_deliver = true;

   479

						_players_ainew[p->index].to_deliver = false;

   480

						break;