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

	int32 money;

   101

	int c;

   102

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

   103

	// First, check if we have a HQ

   104

	if (p->location_of_house == 0) {

   105

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

   106

		// Random till we found a place for it!

   107

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

   108

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

   109

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

   110

		//  so we do not change any status

   111

		return;

   112

	}

   113

   114

	money = p->player_money - AI_MINIMUM_MONEY;

   115

   116

	// Let's pick an action!

   117

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

   118

		c = AI_Random() & 0xFF;

   119

		if (p->current_loan > 0 &&

   120

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

   121

				c < 10) {

   122

			p->ainew.action = AI_ACTION_REPAY_LOAN;

   123

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

   124

			// Check all vehicles once in a while

   125

			p->ainew.action = AI_ACTION_CHECK_ALL_VEHICLES;

   126

			p->ainew.last_vehiclecheck_date = _date;

   127

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

   128

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

   129

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

   130

				if (c < 85) {

   131

					p->ainew.action = AI_ACTION_TRUCK_ROUTE;

   132

				} else {

   133

					p->ainew.action = AI_ACTION_BUS_ROUTE;

   134

				}

   135

			}

   136

#if 0

   137

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

   138

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

   139

				p->ainew.action = AI_ACTION_TRAIN_ROUTE;

   140

			}

   141

#endif

   142

		}

   143

   144

		p->ainew.counter = 0;

   145

	}

   146

   147

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

   148

		p->ainew.action = AI_ACTION_NONE;

   149

		return;

   150

	}

   151

   152

	if (_patches.ai_disable_veh_roadveh && (

   153

				p->ainew.action == AI_ACTION_BUS_ROUTE ||

   154

				p->ainew.action == AI_ACTION_TRUCK_ROUTE

   155

			)) {

   156

		p->ainew.action = AI_ACTION_NONE;

   157

		return;

   158

	}

   159

   160

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

   161

			money > AI_MINIMUM_LOAN_REPAY_MONEY) {

   162

		// We start repaying some money..

   163

		p->ainew.state = AI_STATE_REPAY_MONEY;

   164

		return;

   165

	}

   166

   167

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

   168

		p->ainew.state = AI_STATE_CHECK_ALL_VEHICLES;

   169

		return;

   170

	}

   171

   172

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

   173

	//  to build the route anyway..

   174

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

   175

			money > AI_MINIMUM_BUS_ROUTE_MONEY) {

   176

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

   177

			p->ainew.action = AI_ACTION_NONE;

   178

			return;

   179

		}

   180

		p->ainew.cargo = AI_NEED_CARGO;

   181

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   182

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

   183

		return;

   184

	}

   185

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

   186

			money > AI_MINIMUM_TRUCK_ROUTE_MONEY) {

   187

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

   188

			p->ainew.action = AI_ACTION_NONE;

   189

			return;

   190

		}

   191

		p->ainew.cargo = AI_NEED_CARGO;

   192

		p->ainew.last_id = 0;

   193

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   194

		p->ainew.tbt = AI_TRUCK;

   195

		return;

   196

	}

   197

   198

	p->ainew.state = AI_STATE_NOTHING;

   199

}

   200

   201

   202

static void AiNew_State_ActionDone(Player *p)

   203

{

   204

	p->ainew.action = AI_ACTION_NONE;

   205

	p->ainew.state = AI_STATE_NOTHING;

   206

}

   207

   208

   209

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

   210

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

   211

{

   212

	if (type == AI_CITY) {

   213

		const Town* t = GetTown(ic);

   214

		const Station* st;

   215

		uint count = 0;

   216

		int j = 0;

   217

   218

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

   219

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

   220

   221

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

   222

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

   223

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

   224

   225

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

   226

   227

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

   228

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

   229

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

   230

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

   231

		FOR_ALL_STATIONS(st) {

   232

			// Do we own it?

   233

			if (st->owner == _current_player) {

   234

				// Are we talking busses?

   235

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

   236

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

   237

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

   238

				// When was this station build?

   239

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

   240

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

   241

				count++;

   242

			} else {

   243

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

   244

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

   245

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

   246

				//  to build there

   247

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

   248

				// Is it around our city

   249

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

   250

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

   251

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

   252

				j++;

   253

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

   254

				if (j == 1) continue;

   255

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

   256

				//  a little chance that we still continue

   257

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

   258

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

   259

				// We don't like this station :(

   260

				return false;

   261

			}

   262

		}

   263

   264

		// We are about to add one...

   265

		count++;

   266

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

   267

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

   268

   269

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

   270

		return true;

   271

	}

   272

	if (type == AI_INDUSTRY) {

   273

		const Industry* i = GetIndustry(ic);

   274

		const Station* st;

   275

		int count = 0;

   276

		int j = 0;

   277

   278

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

   279

   280

		// No limits on delevering stations!

   281

		//  Or for industry that does not give anything yet

   282

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

   283

   284

		if (i->total_production[0] - i->total_transported[0] < AI_CHECKCITY_NEEDED_CARGO) return false;

   285

   286

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

   287

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

   288

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

   289

		FOR_ALL_STATIONS(st) {

   290

			// Do we own it?

   291

			if (st->owner == _current_player) {

   292

				// Are we talking trucks?

   293

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

   294

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

   295

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

   296

				// When was this station build?

   297

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

   298

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

   299

				count++;

   300

			} else {

   301

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

   302

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

   303

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

   304

				//  to build there

   305

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

   306

				// It does not take this cargo

   307

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

   308

				// Is it around our industry

   309

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

   310

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

   311

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

   312

				j++;

   313

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

   314

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

   315

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

   316

				// We don't like this station :(

   317

				return false;

   318

			}

   319

		}

   320

   321

		// We are about to add one...

   322

		count++;

   323

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

   324

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

   325

   326

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

   327

		return true;

   328

	}

   329

   330

	return true;

   331

}

   332

   333

   334

// This functions tries to locate a good route

   335

static void AiNew_State_LocateRoute(Player *p)

   336

{

   337

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

   338

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

   339

   340

	// We don't have a route yet

   341

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

   342

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

   343

		p->ainew.temp = -1;

   344

		// Reset the counter

   345

		p->ainew.counter = 0;

   346

   347

		p->ainew.from_ic = -1;

   348

		p->ainew.to_ic = -1;

   349

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

   350

			// For now we only have a passenger route

   351

			p->ainew.cargo = CT_PASSENGERS;

   352

   353

			// Find a route to cities

   354

			p->ainew.from_type = AI_CITY;

   355

			p->ainew.to_type = AI_CITY;

   356

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

   357

			p->ainew.cargo = AI_NO_CARGO;

   358

   359

			p->ainew.from_type = AI_INDUSTRY;

   360

			p->ainew.to_type = AI_INDUSTRY;

   361

		}

   362

   363

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

   364

		return;

   365

	}

   366

   367

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

   368

	p->ainew.counter++;

   369

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

   370

		// Switch back to doing nothing!

   371

		p->ainew.state = AI_STATE_NOTHING;

   372

		return;

   373

	}

   374

   375

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

   376

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

   377

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

   378

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

   379

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

   380

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

   381

			} else {

   382

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

   383

			}

   384

		}

   385

   386

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

   387

			// It was not a valid city

   388

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

   389

			//  to try again

   390

			p->ainew.temp++;

   391

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

   392

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

   393

			} else {

   394

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

   395

			}

   396

   397

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

   398

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

   399

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

   400

   401

			return;

   402

		}

   403

   404

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

   405

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

   406

   407

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

   408

		p->ainew.temp = -1;

   409

		return;

   410

	}

   411

   412

	// Find a to-city

   413

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

   414

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

   415

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

   416

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

   417

		} else {

   418

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

   419

		}

   420

	}

   421

   422

	// The same city is not allowed

   423

	// Also check if the city is valid

   424

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

   425

		// Maybe it is valid..

   426

   427

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

   428

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

   429

		 * route is.

   430

		 */

   431

   432

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

   433

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

   434

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

   435

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

   436

			int max_cargo;

   437

   438

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

   439

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

   440

   441

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

   442

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

   443

			if (distance <= max_cargo * AI_LOCATEROUTE_BUS_CARGO_DISTANCE) {

   444

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

   445

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

   446

				p->ainew.state = AI_STATE_FIND_STATION;

   447

   448

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

   449

					distance,

   450

					p->ainew.from_ic,

   451

					p->ainew.temp

   452

				);

   453

   454

				p->ainew.from_tile = 0;

   455

				p->ainew.to_tile = 0;

   456

   457

				return;

   458

			}

   459

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

   460

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

   461

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

   462

			bool found = false;

   463

			int max_cargo = 0;

   464

			uint i;

   465

   466

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

   467

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

   468

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

   469

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

   470

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

   471

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

   472

						// Found a compatible industry

   473

						max_cargo = ind_from->total_production[0] - ind_from->total_transported[0];

   474

						found = true;

   475

						p->ainew.from_deliver = true;

   476

						p->ainew.to_deliver = false;

   477

						break;

   478

					}

   479

				}

   480

			}

   481

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

   482

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

   483

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

   484

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

   485

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