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 "../ai.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 || _ai.network_client) {

    51

		ShowErrorMessage(INVALID_STRING_ID, TEMP_AI_IN_PROGRESS, 0, 0);

    52

	}

    53

    54

	// The PathFinder (AyStar)

    55

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

    56

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

    57

	p->ainew.path_info.start_tile_tl = 0;

    58

	p->ainew.path_info.start_tile_br = 0;

    59

	p->ainew.path_info.end_tile_tl = 0;

    60

	p->ainew.path_info.end_tile_br = 0;

    61

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

    62

    63

	p->ainew.idle = 0;

    64

	p->ainew.last_vehiclecheck_date = _date;

    65

    66

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

    67

	p->ainew.action = AI_ACTION_BUS_ROUTE;

    68

    69

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

    70

	p->ainew.state = AI_STATE_WAKE_UP;

    71

}

    72

    73

    74

// This function just waste some time

    75

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

    76

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

    77

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

    78

//

    79

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

    80

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

    81

static void AiNew_State_Nothing(Player *p)

    82

{

    83

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

    84

	// If we are done idling, start over again

    85

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

    86

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

    87

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

    88

		// I mean.. the next tick ;)

    89

		p->ainew.state = AI_STATE_WAKE_UP;

    90

	}

    91

}

    92

    93

    94

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

    95

//  Currently supported:

    96

//    - Make new route

    97

//    - Check route

    98

//    - Build HQ

    99

static void AiNew_State_WakeUp(Player *p)

   100

{

   101

	int32 money;

   102

	int c;

   103

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

   104

	// First, check if we have a HQ

   105

	if (p->location_of_house == 0) {

   106

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

   107

		// Random till we found a place for it!

   108

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

   109

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

   110

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

   111

		//  so we do not change any status

   112

		return;

   113

	}

   114

   115

	money = p->player_money - AI_MINIMUM_MONEY;

   116

   117

	// Let's pick an action!

   118

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

   119

		c = AI_Random() & 0xFF;

   120

		if (p->current_loan > 0 &&

   121

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

   122

				c < 10) {

   123

			p->ainew.action = AI_ACTION_REPAY_LOAN;

   124

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

   125

			// Check all vehicles once in a while

   126

			p->ainew.action = AI_ACTION_CHECK_ALL_VEHICLES;

   127

			p->ainew.last_vehiclecheck_date = _date;

   128

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

   129

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

   130

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

   131

				if (c < 85)

   132

					p->ainew.action = AI_ACTION_TRUCK_ROUTE;

   133

				else

   134

					p->ainew.action = AI_ACTION_BUS_ROUTE;

   135

			}

   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

		}*/

   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

		Town *t = GetTown(ic);

   212

		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

			// Is it an active station

   231

			if (st->xy == 0) continue;

   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

		Industry *i = GetIndustry(ic);

   274

		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

			// Is it an active station

   291

			if (st->xy == 0) continue;

   292

   293

			// Do we own it?

   294

			if (st->owner == _current_player) {

   295

				// Are we talking trucks?

   296

				if (p->ainew.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->total_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(p->ainew.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 (p->ainew.cargo == AI_NEED_CARGO) {

   345

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

   346

		p->ainew.temp = -1;

   347

		// Reset the counter

   348

		p->ainew.counter = 0;

   349

   350

		p->ainew.from_ic = -1;

   351

		p->ainew.to_ic = -1;

   352

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

   353

			// For now we only have a passenger route

   354

			p->ainew.cargo = CT_PASSENGERS;

   355

   356

			// Find a route to cities

   357

			p->ainew.from_type = AI_CITY;

   358

			p->ainew.to_type = AI_CITY;

   359

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

   360

			p->ainew.cargo = AI_NO_CARGO;

   361

   362

			p->ainew.from_type = AI_INDUSTRY;

   363

			p->ainew.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

	p->ainew.counter++;

   372

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

   373

		// Switch back to doing nothing!

   374

		p->ainew.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 (p->ainew.from_ic == -1) {

   380

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

   381

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

   382

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

   383

				p->ainew.temp = AI_RandomRange(_total_towns);

   384

			else

   385

				p->ainew.temp = AI_RandomRange(_total_industries);

   386

		}

   387

   388

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

   389

			// It was not a valid city

   390

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

   391

			//  to try again

   392

			p->ainew.temp++;

   393

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

   394

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

   395

			} else {

   396

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

   397

			}

   398

   399

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

   400

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

   401

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

   402

   403

			return;

   404

		}

   405

   406

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

   407

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

   408

   409

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

   410

		p->ainew.temp = -1;

   411

		return;

   412

	}

   413

   414

	// Find a to-city

   415

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

   416

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

   417

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

   418

			p->ainew.temp = AI_RandomRange(_total_towns);

   419

		else

   420

			p->ainew.temp = AI_RandomRange(_total_industries);

   421

	}

   422

   423

	// The same city is not allowed

   424

	// Also check if the city is valid

   425

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

   426

		// Maybe it is valid..

   427

   428

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

   429

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

   430

		//   is.

   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)(

   449

					"[AiNew - LocateRoute] Found bus-route of %d tiles long (from %d to %d)",

   450

					distance,

   451

					p->ainew.from_ic,

   452

					p->ainew.temp

   453

				);

   454

   455

				p->ainew.from_tile = 0;

   456

				p->ainew.to_tile = 0;

   457

   458

				return;

   459

			}

   460

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

   461

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

   462

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

   463

			bool found = false;

   464

			int max_cargo = 0;

   465

			uint i;

   466

   467

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

   468

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

   469

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

   470

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

   471

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

   472

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

   473

						// Found a compatbiel industry

   474

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

   475

						found = true;

   476

						p->ainew.from_deliver = true;

   477

						p->ainew.to_deliver = false;

   478

						break;

   479

					}

   480

				}

   481

			}

   482

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

   483

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

   484

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

   485

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

   486

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

   487

						// Found a compatbiel industry

   488

						found = true;

   489

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

   490

						p->ainew.from_deliver = false;

   491

						p->ainew.to_deliver = true;

   492

						break;

   493

					}

   494

				}

   495

			}

   496

			if (found) {

   497

				// Yeah, they are compatible!!!

   498

				// Check the length against the amount of goods

   499

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

   500

   501

				if (distance > AI_LOCATEROUTE_TRUCK_MIN_DISTANCE &&

   502

						distance <= max_cargo * AI_LOCATEROUTE_TRUCK_CARGO_DISTANCE) {

   503

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

   504

					if (p->ainew.from_deliver) {

   505

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

   506

					} else {

   507

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

   508

					}

   509

					p->ainew.state = AI_STATE_FIND_STATION;

   510

   511

					DEBUG(ai,1)(

   512

						"[AiNew - LocateRoute] Found truck-route of %d tiles long (from %d to %d)",

   513

						distance,

   514

						p->ainew.from_ic,

   515

						p->ainew.temp

   516

					);

   517

   518

					p->ainew.from_tile = 0;

   519

					p->ainew.to_tile = 0;

   520

   521