1

/*

     2

 * Next part is in Dutch, and only here for me, TrueLight, the maker of this new AI

     3

 */

     4

     5

// TODO: als iemand een vehicle stil zet op een weg waar de AI wil bouwen

     6

//         doet de AI helemaal niets meer

     7

// TODO: depot rondjes rijden stom iets dingus

     8

// TODO: jezelf afvragen of competitor_intelligence op niveau 2 wel meer geld moet opleverne...

     9

// TODO: als er iets in path komt, bouwt AI gewoon verder :(

    10

// TODO: mail routes

    11

    12

// FIXME: This code is horrible. Indisputably from the style POV, at least. --pasky

    13

    14

/*

    15

 * End of Dutch part

    16

 */

    17

    18

#include "stdafx.h"

    19

#include "openttd.h"

    20

#include "debug.h"

    21

#include "table/strings.h"

    22

#include "map.h"

    23

#include "tile.h"

    24

#include "command.h"

    26

#include "town.h"

    27

#include "industry.h"

    28

#include "station.h"

    29

#include "engine.h"

    30

#include "gui.h"

    31

#include "depot.h"

    32

    33

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

    34

static void AiNew_State_FirstTime(Player *p) {

    35

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

    36

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

    37

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

    38

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

    39

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

    40

	// We first have to init some things

    41

    42

	if (_current_player == 1) {

    43

		ShowErrorMessage(-1, TEMP_AI_IN_PROGRESS, 0, 0);

    44

	}

    45

    46

	// The PathFinder (AyStar)

    47

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

    48

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

    49

    p->ainew.path_info.start_tile_tl = 0;

    50

    p->ainew.path_info.start_tile_br = 0;

    51

    p->ainew.path_info.end_tile_tl = 0;

    52

    p->ainew.path_info.end_tile_br = 0;

    53

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

    54

    55

	p->ainew.idle = 0;

    56

	p->ainew.last_vehiclecheck_date = _date;

    57

    58

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

    59

	p->ainew.action = AI_ACTION_BUS_ROUTE;

    60

    61

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

    62

	p->ainew.state = AI_STATE_WAKE_UP;

    63

}

    64

    65

// This function just waste some time

    66

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

    67

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

    68

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

    69

//

    70

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

    71

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

    72

static void AiNew_State_Nothing(Player *p) {

    73

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

    74

    // If we are done idling, start over again

    75

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

    76

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

    77

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

    78

		// I mean.. the next tick ;)

    79

		p->ainew.state = AI_STATE_WAKE_UP;

    80

	}

    81

}

    82

    83

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

    84

//  Currently supported:

    85

//    - Make new route

    86

//    - Check route

    87

//    - Build HQ

    88

static void AiNew_State_WakeUp(Player *p) {

    89

	int32 money;

    90

	int c;

    91

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

    92

	// First, check if we have a HQ

    93

	if (p->location_of_house == 0) {

    94

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

    95

		// Random till we found a place for it!

    96

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

    97

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

    98

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

    99

		//  so we do not change any status

   100

		return;

   101

	}

   102

   103

	money = p->player_money - AI_MINIMUM_MONEY;

   104

   105

	// Let's pick an action!

   106

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

   107

		c = Random() & 0xFF;

   108

		if (p->current_loan > 0 && p->old_economy[1].income > AI_MINIMUM_INCOME_FOR_LOAN &&

   109

  			c < 10) {

   110

  			p->ainew.action = AI_ACTION_REPAY_LOAN;

   111

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

   112

			// Check all vehicles once in a while

   113

			p->ainew.action = AI_ACTION_CHECK_ALL_VEHICLES;

   114

			p->ainew.last_vehiclecheck_date = _date;

   115

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

   116

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

   117

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

   118

				if (c < 85) p->ainew.action = AI_ACTION_TRUCK_ROUTE;

   119

				else p->ainew.action = AI_ACTION_BUS_ROUTE;

   120

			}

   121

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

   122

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

   123

				p->ainew.action = AI_ACTION_TRAIN_ROUTE;

   124

			}

   125

		}*/

   126

   127

		p->ainew.counter = 0;

   128

	}

   129

   130

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

   131

		p->ainew.action = AI_ACTION_NONE;

   132

		return;

   133

	}

   134

   135

	if (_patches.ai_disable_veh_roadveh && (

   136

		p->ainew.action == AI_ACTION_BUS_ROUTE || p->ainew.action == AI_ACTION_TRUCK_ROUTE)) {

   137

		p->ainew.action = AI_ACTION_NONE;

   138

		return;

   139

	}

   140

   141

	if (_patches.ai_disable_veh_roadveh && (

   142

		p->ainew.action == AI_ACTION_BUS_ROUTE || p->ainew.action == AI_ACTION_TRUCK_ROUTE)) {

   143

		p->ainew.action = AI_ACTION_NONE;

   144

		return;

   145

	}

   146

   147

	if (p->ainew.action == AI_ACTION_REPAY_LOAN && money > AI_MINIMUM_LOAN_REPAY_MONEY) {

   148

		// We start repaying some money..

   149

		p->ainew.state = AI_STATE_REPAY_MONEY;

   150

		return;

   151

	}

   152

   153

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

   154

		p->ainew.state = AI_STATE_CHECK_ALL_VEHICLES;

   155

		return;

   156

	}

   157

   158

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

   159

	//  to build the route anyway..

   160

	if (p->ainew.action == AI_ACTION_BUS_ROUTE && money > AI_MINIMUM_BUS_ROUTE_MONEY) {

   161

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

   162

			p->ainew.action = AI_ACTION_NONE;

   163

			return;

   164

		}

   165

		p->ainew.cargo = AI_NEED_CARGO;

   166

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   167

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

   168

		return;

   169

	}

   170

	if (p->ainew.action == AI_ACTION_TRUCK_ROUTE && money > AI_MINIMUM_TRUCK_ROUTE_MONEY) {

   171

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

   172

			p->ainew.action = AI_ACTION_NONE;

   173

			return;

   174

		}

   175

		p->ainew.cargo = AI_NEED_CARGO;

   176

		p->ainew.last_id = 0;

   177

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   178

		p->ainew.tbt = AI_TRUCK;

   179

		return;

   180

	}

   181

   182

	p->ainew.state = AI_STATE_NOTHING;

   183

}

   184

   185

static void AiNew_State_ActionDone(Player *p) {

   186

	p->ainew.action = AI_ACTION_NONE;

   187

	p->ainew.state = AI_STATE_NOTHING;

   188

}

   189

   190

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

   191

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

   192

	if (type == AI_CITY) {

   193

		Town *t = GetTown(ic);

   194

		Station *st;

   195

		uint count = 0;

   196

		int j = 0;

   197

   198

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

   199

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

   200

   201

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

   202

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

   203

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

   204

   205

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

   206

   207

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

   208

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

   209

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

   210

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

   211

		FOR_ALL_STATIONS(st) {

   212

			// Is it an active station

   213

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

   214

			// Do we own it?

   215

			if (st->owner == _current_player) {

   216

				// Are we talking busses?

   217

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

   218

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

   219

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

   220

				// When was this station build?

   221

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

   222

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

   223

				count++;

   224

			} else {

   225

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

   226

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

   227

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

   228

				//  to build there

   229

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

   230

				// Is it around our city

   231

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

   232

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

   233

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

   234

				j++;

   235

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

   236

				if (j == 1) continue;

   237

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

   238

				//  a little chance that we still continue

   239

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

   240

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

   241

				// We don't like this station :(

   242

				return false;

   243

			}

   244

		}

   245

   246

		// We are about to add one...

   247

		count++;

   248

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

   249

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

   250

   251

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

   252

		return true;

   253

	}

   254

	if (type == AI_INDUSTRY) {

   255

		Industry *i = GetIndustry(ic);

   256

		Station *st;

   257

		int count = 0;

   258

		int j = 0;

   259

   260

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

   261

   262

		// No limits on delevering stations!

   263

		//  Or for industry that does not give anything yet

   264

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

   265

   266

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

   267

   268

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

   269

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

   270

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

   271

		FOR_ALL_STATIONS(st) {

   272

			// Is it an active station

   273

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

   274

   275

			// Do we own it?

   276

			if (st->owner == _current_player) {

   277

				// Are we talking trucks?

   278

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

   279

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

   280

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

   281

				// When was this station build?

   282

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

   283

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

   284

				count++;

   285

			} else {

   286

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

   287

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

   288

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

   289

				//  to build there

   290

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

   291

				// It does not take this cargo

   292

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

   293

				// Is it around our industry

   294

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

   295

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

   296

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

   297

				j++;

   298

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

   299

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

   300

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

   301

				// We don't like this station :(

   302

				return false;

   303

			}

   304

		}

   305

   306

		// We are about to add one...

   307

		count++;

   308

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

   309

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

   310

   311

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

   312

		return true;

   313

	}

   314

   315

	return true;

   316

}

   317

   318

// This functions tries to locate a good route

   319

static void AiNew_State_LocateRoute(Player *p) {

   320

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

   321

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

   322

   323

    // We don't have a route yet

   324

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

   325

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

   326

    	p->ainew.temp = -1;

   327

    	// Reset the counter

   328

    	p->ainew.counter = 0;

   329

   330

    	p->ainew.from_ic = -1;

   331

    	p->ainew.to_ic = -1;

   332

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

   333

   	    	// For now we only have a passenger route

   334

   	    	p->ainew.cargo = CT_PASSENGERS;

   335

   336

	    	// Find a route to cities

   337

	    	p->ainew.from_type = AI_CITY;

   338

	    	p->ainew.to_type = AI_CITY;

   339

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

   340

   	    	p->ainew.cargo = AI_NO_CARGO;

   341

   342

	    	p->ainew.from_type = AI_INDUSTRY;

   343

	    	p->ainew.to_type = AI_INDUSTRY;

   344

		}

   345

   346

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

   347

    	return;

   348

    }

   349

   350

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

   351

    p->ainew.counter++;

   352

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

   353

        // Switch back to doing nothing!

   354

    	p->ainew.state = AI_STATE_NOTHING;

   355

    	return;

   356

    }

   357

   358

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

   359

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

   360

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

   361

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

   362

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

   363

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

   364

       		else

   365

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

   366

        }

   367

   368

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

   369

    		// It was not a valid city

   370

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

   371

    		//  to try again

   372

    		p->ainew.temp++;

   373

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

   374

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

   375

				} else {

   376

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

   377

				}

   378

   379

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

   380

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

   381

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

   382

   383

    		return;

   384

    	}

   385

   386

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

   387

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

   388

   389

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

   390

    	p->ainew.temp = -1;

   391

    	return;

   392

    }

   393

   394

    // Find a to-city

   395

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

   396

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

   397

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

   398

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

   399

       	else

   400

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

   401

	}

   402

   403

	// The same city is not allowed

   404

	// Also check if the city is valid

   405

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

   406

   		// Maybe it is valid..

   407

   408

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

   409

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

   410

   		//   is.

   411

   412

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

   413

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

   414

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

   415

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

   416

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

   417

   			if (DistanceManhattan(GetTown(p->ainew.from_ic)->xy, GetTown(p->ainew.temp)->xy) <= max_cargo * AI_LOCATEROUTE_BUS_CARGO_DISTANCE) {

   418

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

   419

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

   420

   				p->ainew.state = AI_STATE_FIND_STATION;

   421

   422

   				DEBUG(ai,1)(

   423

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

   424

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

   425

						p->ainew.from_ic,

   426

						p->ainew.temp

   427

					);

   428

   429

   				p->ainew.from_tile = 0;

   430

   				p->ainew.to_tile = 0;

   431

   432

   				return;

   433

   			}

   434

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

   435

         	bool found = false;

   436

         	int max_cargo = 0;

   437

         	int i;

   438

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

   439

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

   440

         	if (GetIndustry(p->ainew.from_ic)->produced_cargo[0] != 0xFF && GetIndustry(p->ainew.from_ic)->total_production[0] != 0) {

   441

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

   442

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

   443

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

   444

						// Found a compatbiel industry

   445

						max_cargo = GetIndustry(p->ainew.from_ic)->total_production[0] - GetIndustry(p->ainew.from_ic)->total_transported[0];

   446

						found = true;

   447

	   					p->ainew.from_deliver = true;

   448

	   					p->ainew.to_deliver = false;

   449

	       				break;

   450

	       			}

   451

	       		}

   452

   			}

   453

   			if (!found && GetIndustry(p->ainew.temp)->produced_cargo[0] != 0xFF && GetIndustry(p->ainew.temp)->total_production[0] != 0) {

   454

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

   455

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

   456

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

   457

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

   458

						// Found a compatbiel industry

   459

						found = true;

   460

						max_cargo = GetIndustry(p->ainew.temp)->total_production[0] - GetIndustry(p->ainew.from_ic)->total_transported[0];

   461

	   					p->ainew.from_deliver = false;

   462

	   					p->ainew.to_deliver = true;

   463

	       				break;

   464

	       			}

   465

	   			}

   466

   			}

   467

   			if (found) {

   468

   				// Yeah, they are compatible!!!

   469

   				// Check the length against the amount of goods

   470

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

   471

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

   472

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

   473

	   				if (p->ainew.from_deliver) {

   474

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

   475

	   				} else {

   476

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

   477

   					}

   478

	   				p->ainew.state = AI_STATE_FIND_STATION;

   479

   480

	   				DEBUG(ai,1)(

   481

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

   482

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

   483

							p->ainew.from_ic,

   484

							p->ainew.temp

   485

						);

   486

   487

	   				p->ainew.from_tile = 0;

   488

	   				p->ainew.to_tile = 0;