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

    26

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

    27

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

    28

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

    29

#include "trolly.h"

    30

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

    31

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

    32

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

    33

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

    34

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

    35

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

    36

#include "../ai.h"

    37

    38

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

    39

static void AiNew_State_FirstTime(Player *p)

    40

{

    41

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

    42

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

    43

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

    44

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

    45

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

    46

	// We first have to init some things

    47

    48

	if (_current_player == 1 || _ai.network_client) {

    49

		ShowErrorMessage(INVALID_STRING_ID, TEMP_AI_IN_PROGRESS, 0, 0);

    50

	}

    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

	int32 money;

   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 = 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

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

   135

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

   136

				p->ainew.action = AI_ACTION_TRAIN_ROUTE;

   137

			}

   138

		}*/

   139

   140

		p->ainew.counter = 0;

   141

	}

   142

   143

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

   144

		p->ainew.action = AI_ACTION_NONE;

   145

		return;

   146

	}

   147

   148

	if (_patches.ai_disable_veh_roadveh && (

   149

				p->ainew.action == AI_ACTION_BUS_ROUTE ||

   150

				p->ainew.action == AI_ACTION_TRUCK_ROUTE

   151

			)) {

   152

		p->ainew.action = AI_ACTION_NONE;

   153

		return;

   154

	}

   155

   156

	if (_patches.ai_disable_veh_roadveh && (

   157

				p->ainew.action == AI_ACTION_BUS_ROUTE ||

   158

				p->ainew.action == AI_ACTION_TRUCK_ROUTE

   159

			)) {

   160

		p->ainew.action = AI_ACTION_NONE;

   161

		return;

   162

	}

   163

   164

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

   165

			money > AI_MINIMUM_LOAN_REPAY_MONEY) {

   166

		// We start repaying some money..

   167

		p->ainew.state = AI_STATE_REPAY_MONEY;

   168

		return;

   169

	}

   170

   171

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

   172

		p->ainew.state = AI_STATE_CHECK_ALL_VEHICLES;

   173

		return;

   174

	}

   175

   176

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

   177

	//  to build the route anyway..

   178

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

   179

			money > AI_MINIMUM_BUS_ROUTE_MONEY) {

   180

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

   181

			p->ainew.action = AI_ACTION_NONE;

   182

			return;

   183

		}

   184

		p->ainew.cargo = AI_NEED_CARGO;

   185

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   186

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

   187

		return;

   188

	}

   189

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

   190

			money > AI_MINIMUM_TRUCK_ROUTE_MONEY) {

   191

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

   192

			p->ainew.action = AI_ACTION_NONE;

   193

			return;

   194

		}

   195

		p->ainew.cargo = AI_NEED_CARGO;

   196

		p->ainew.last_id = 0;

   197

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   198

		p->ainew.tbt = AI_TRUCK;

   199

		return;

   200

	}

   201

   202

	p->ainew.state = AI_STATE_NOTHING;

   203

}

   204

   205

   206

static void AiNew_State_ActionDone(Player *p)

   207

{

   208

	p->ainew.action = AI_ACTION_NONE;

   209

	p->ainew.state = AI_STATE_NOTHING;

   210

}

   211

   212

   213

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

   214

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

   215

{

   216

	if (type == AI_CITY) {

   217

		Town *t = GetTown(ic);

   218

		Station *st;

   219

		uint count = 0;

   220

		int j = 0;

   221

   222

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

   223

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

   224

   225

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

   226

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

   227

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

   228

   229

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

   230

   231

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

   232

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

   233

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

   234

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

   235

		FOR_ALL_STATIONS(st) {

   236

			// Is it an active station

   237

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

   238

			// Do we own it?

   239

			if (st->owner == _current_player) {

   240

				// Are we talking busses?

   241

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

   242

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

   243

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

   244

				// When was this station build?

   245

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

   246

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

   247

				count++;

   248

			} else {

   249

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

   250

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

   251

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

   252

				//  to build there

   253

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

   254

				// Is it around our city

   255

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

   256

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

   257

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

   258

				j++;

   259

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

   260

				if (j == 1) continue;

   261

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

   262

				//  a little chance that we still continue

   263

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

   264

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

   265

				// We don't like this station :(

   266

				return false;

   267

			}

   268

		}

   269

   270

		// We are about to add one...

   271

		count++;

   272

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

   273

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

   274

   275

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

   276

		return true;

   277

	}

   278

	if (type == AI_INDUSTRY) {

   279

		Industry *i = GetIndustry(ic);

   280

		Station *st;

   281

		int count = 0;

   282

		int j = 0;

   283

   284

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

   285

   286

		// No limits on delevering stations!

   287

		//  Or for industry that does not give anything yet

   288

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

   289

   290

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

   291

   292

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

   293

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

   294

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

   295

		FOR_ALL_STATIONS(st) {

   296

			// Is it an active station

   297

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

   298

   299

			// Do we own it?

   300

			if (st->owner == _current_player) {

   301

				// Are we talking trucks?

   302

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

   303

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

   304

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

   305

				// When was this station build?

   306

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

   307

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

   308

				count++;

   309

			} else {

   310

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

   311

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

   312

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

   313

				//  to build there

   314

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

   315

				// It does not take this cargo

   316

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

   317

				// Is it around our industry

   318

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

   319

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

   320

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

   321

				j++;

   322

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

   323

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

   324

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

   325

				// We don't like this station :(

   326

				return false;

   327

			}

   328

		}

   329

   330

		// We are about to add one...

   331

		count++;

   332

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

   333

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

   334

   335

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

   336

		return true;

   337

	}

   338

   339

	return true;

   340

}

   341

   342

   343

// This functions tries to locate a good route

   344

static void AiNew_State_LocateRoute(Player *p)

   345

{

   346

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

   347

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

   348

   349

	// We don't have a route yet

   350

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

   351

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

   352

		p->ainew.temp = -1;

   353

		// Reset the counter

   354

		p->ainew.counter = 0;

   355

   356

		p->ainew.from_ic = -1;

   357

		p->ainew.to_ic = -1;

   358

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

   359

			// For now we only have a passenger route

   360

			p->ainew.cargo = CT_PASSENGERS;

   361

   362

			// Find a route to cities

   363

			p->ainew.from_type = AI_CITY;

   364

			p->ainew.to_type = AI_CITY;

   365

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

   366

			p->ainew.cargo = AI_NO_CARGO;

   367

   368

			p->ainew.from_type = AI_INDUSTRY;

   369

			p->ainew.to_type = AI_INDUSTRY;

   370

		}

   371

   372

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

   373

		return;

   374

	}

   375

   376

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

   377

	p->ainew.counter++;

   378

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

   379

		// Switch back to doing nothing!

   380

		p->ainew.state = AI_STATE_NOTHING;

   381

		return;

   382

	}

   383

   384

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

   385

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

   386

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

   387

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

   388

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

   389

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

   390

			else

   391

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

   392

		}

   393

   394

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

   395

			// It was not a valid city

   396

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

   397

			//  to try again

   398

			p->ainew.temp++;

   399

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

   400

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

   401

			} else {

   402

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

   403

			}

   404

   405

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

   406

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

   407

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

   408

   409

			return;

   410

		}

   411

   412

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

   413

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

   414

   415

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

   416

		p->ainew.temp = -1;

   417

		return;

   418

	}

   419

   420

	// Find a to-city

   421

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

   422

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

   423

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

   424

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

   425

		else

   426

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

   427

	}

   428

   429

	// The same city is not allowed

   430

	// Also check if the city is valid

   431

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

   432

		// Maybe it is valid..

   433

   434

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

   435

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

   436

		//   is.

   437

   438

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

   439

			int max_cargo = GetTown(p->ainew.from_ic)->max_pass + GetTown(p->ainew.temp)->max_pass;

   440

			max_cargo -= GetTown(p->ainew.from_ic)->act_pass + GetTown(p->ainew.temp)->act_pass;

   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 (DistanceManhattan(GetTown(p->ainew.from_ic)->xy, GetTown(p->ainew.temp)->xy) <= 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

					DistanceManhattan(GetTown(p->ainew.from_ic)->xy, GetTown(p->ainew.temp)->xy),

   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

			bool found = false;

   462

			int max_cargo = 0;

   463

			int i;

   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 (GetIndustry(p->ainew.from_ic)->produced_cargo[0] != 0xFF && GetIndustry(p->ainew.from_ic)->total_production[0] != 0) {

   467

				for (i=0;i<3;i++) {

   468

					if (GetIndustry(p->ainew.temp)->accepts_cargo[i] == 0xFF) break;

   469

					if (GetIndustry(p->ainew.from_ic)->produced_cargo[0] == GetIndustry(p->ainew.temp)->accepts_cargo[i]) {

   470

						// Found a compatbiel industry

   471

						max_cargo = GetIndustry(p->ainew.from_ic)->total_production[0] - GetIndustry(p->ainew.from_ic)->total_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 && GetIndustry(p->ainew.temp)->produced_cargo[0] != 0xFF && GetIndustry(p->ainew.temp)->total_production[0] != 0) {

   480

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

   481

				for (i=0;i<3;i++) {

   482

					if (GetIndustry(p->ainew.from_ic)->accepts_cargo[i] == 0xFF) break;

   483

					if (GetIndustry(p->ainew.temp)->produced_cargo[0] == GetIndustry(p->ainew.from_ic)->accepts_cargo[i]) {

   484

						// Found a compatbiel industry

   485

						found = true;

   486

						max_cargo = GetIndustry(p->ainew.temp)->total_production[0] - GetIndustry(p->ainew.from_ic)->total_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

				if (DistanceManhattan(GetIndustry(p->ainew.from_ic)->xy, GetIndustry(p->ainew.temp)->xy) > AI_LOCATEROUTE_TRUCK_MIN_DISTANCE &&

   497

						DistanceManhattan(GetIndustry(p->ainew.from_ic)->xy, GetIndustry(p->ainew.temp)->xy) <= max_cargo * AI_LOCATEROUTE_TRUCK_CARGO_DISTANCE) {

   498

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

   499

					if (p->ainew.from_deliver) {

   500

						p->ainew.cargo = GetIndustry(p->ainew.from_ic)->produced_cargo[0];

   501

					} else {

   502

						p->ainew.cargo = GetIndustry(p->ainew.temp)->produced_cargo[0];

   503

					}

   504

					p->ainew.state = AI_STATE_FIND_STATION;

   505

   506

					DEBUG(ai,1)(

   507

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

   508

						DistanceManhattan(GetIndustry(p->ainew.from_ic)->xy, GetIndustry(p->ainew.temp)->xy),

   509

						p->ainew.from_ic,

   510

						p->ainew.temp

   511

					);

   512

   513

					p->ainew.from_tile = 0;

   514

					p->ainew.to_tile = 0;

   515

   516

					return;

   517

				}

   518

			}

   519

		}

   520

	}

   521

   522

	// It was not a valid city

   523

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

   524

	//  to try again

   525

	p->ainew.temp++;