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

/*

    13

 * End of Dutch part

    14

 */

    15

    16

#include "stdafx.h"

    17

#include "ttd.h"

    18

#include "debug.h"

    19

#include "table/strings.h"

    20

#include "map.h"

    21

#include "tile.h"

    22

#include "command.h"

    23

#include "ai.h"

    24

#include "town.h"

    25

#include "industry.h"

    26

#include "station.h"

    27

#include "engine.h"

    28

#include "gui.h"

    29

#include "depot.h"

    30

    31

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

    32

static void AiNew_State_FirstTime(Player *p) {

    33

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

    34

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

    35

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

    36

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

    37

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

    38

	// We first have to init some things

    39

    40

	if (_current_player == 1) {

    41

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

    42

	}

    43

    44

	// The PathFinder (AyStar)

    45

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

    46

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

    47

    p->ainew.path_info.start_tile_tl = 0;

    48

    p->ainew.path_info.start_tile_br = 0;

    49

    p->ainew.path_info.end_tile_tl = 0;

    50

    p->ainew.path_info.end_tile_br = 0;

    51

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

    52

    53

	p->ainew.idle = 0;

    54

	p->ainew.last_vehiclecheck_date = _date;

    55

    56

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

    57

	p->ainew.action = AI_ACTION_BUS_ROUTE;

    58

    59

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

    60

	p->ainew.state = AI_STATE_WAKE_UP;

    61

}

    62

    63

// This function just waste some time

    64

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

    65

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

    66

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

    67

//

    68

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

    69

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

    70

static void AiNew_State_Nothing(Player *p) {

    71

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

    72

    // If we are done idling, start over again

    73

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

    74

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

    75

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

    76

		// I mean.. the next tick ;)

    77

		p->ainew.state = AI_STATE_WAKE_UP;

    78

	}

    79

}

    80

    81

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

    82

//  Currently supported:

    83

//    - Make new route

    84

//    - Check route

    85

//    - Build HQ

    86

static void AiNew_State_WakeUp(Player *p) {

    87

    int32 money;

    88

    int c;

    89

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

    90

	// First, check if we have a HQ

    91

	if (p->location_of_house == 0) {

    92

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

    93

		// Random till we found a place for it!

    94

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

    95

		while (!AiNew_Build_CompanyHQ(p, Random() % MapSize())) { }

    96

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

    97

		//  so we do not change any status

    98

		return;

    99

	}

   100

   101

	money = p->player_money - AI_MINIMUM_MONEY;

   102

   103

	// Let's pick an action!

   104

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

   105

		c = Random() & 0xFF;

   106

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

   107

  			c < 10) {

   108

  			p->ainew.action = AI_ACTION_REPAY_LOAN;

   109

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

   110

			// Check all vehicles once in a while

   111

			p->ainew.action = AI_ACTION_CHECK_ALL_VEHICLES;

   112

			p->ainew.last_vehiclecheck_date = _date;

   113

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

   114

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

   115

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

   116

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

   117

				else p->ainew.action = AI_ACTION_BUS_ROUTE;

   118

			}

   119

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

   120

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

   121

				p->ainew.action = AI_ACTION_TRAIN_ROUTE;

   122

			}

   123

		}*/

   124

   125

		p->ainew.counter = 0;

   126

	}

   127

   128

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

   129

		p->ainew.action = AI_ACTION_NONE;

   130

		return;

   131

	}

   132

   133

	if (_patches.ai_disable_veh_roadveh && (

   134

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

   135

		p->ainew.action = AI_ACTION_NONE;

   136

		return;

   137

	}

   138

   139

	if (_patches.ai_disable_veh_roadveh && (

   140

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

   141

		p->ainew.action = AI_ACTION_NONE;

   142

		return;

   143

	}

   144

   145

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

   146

		// We start repaying some money..

   147

		p->ainew.state = AI_STATE_REPAY_MONEY;

   148

		return;

   149

	}

   150

   151

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

   152

		p->ainew.state = AI_STATE_CHECK_ALL_VEHICLES;

   153

		return;

   154

	}

   155

   156

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

   157

	//  to build the route anyway..

   158

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

   159

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

   160

			p->ainew.action = AI_ACTION_NONE;

   161

			return;

   162

		}

   163

		p->ainew.cargo = AI_NEED_CARGO;

   164

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   165

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

   166

		return;

   167

	}

   168

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

   169

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

   170

			p->ainew.action = AI_ACTION_NONE;

   171

			return;

   172

		}

   173

		p->ainew.cargo = AI_NEED_CARGO;

   174

		p->ainew.last_id = 0;

   175

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   176

		p->ainew.tbt = AI_TRUCK;

   177

		return;

   178

	}

   179

   180

	p->ainew.state = AI_STATE_NOTHING;

   181

}

   182

   183

static void AiNew_State_ActionDone(Player *p) {

   184

    p->ainew.action = AI_ACTION_NONE;

   185

    p->ainew.state = AI_STATE_NOTHING;

   186

}

   187

   188

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

   189

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

   190

	if (type == AI_CITY) {

   191

		Town *t = GetTown(ic);

   192

		Station *st;

   193

		int count = 0;

   194

		int j = 0;

   195

   196

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

   197

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

   198

   199

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

   200

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

   201

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

   202

   203

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

   204

   205

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

   206

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

   207

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

   208

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

   209

		FOR_ALL_STATIONS(st) {

   210

			// Is it an active station

   211

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

   212

			// Do we own it?

   213

			if (st->owner == _current_player) {

   214

				// Are we talking busses?

   215

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

   216

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

   217

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

   218

				// When was this station build?

   219

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

   220

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

   221

				count++;

   222

			} else {

   223

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

   224

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

   225

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

   226

				//  to build there

   227

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

   228

				// Is it around our city

   229

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

   230

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

   231

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

   232

				j++;

   233

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

   234

				if (j == 1) continue;

   235

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

   236

				//  a little chance that we still continue

   237

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

   238

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

   239

				// We don't like this station :(

   240

				return false;

   241

			}

   242

		}

   243

   244

		// We are about to add one...

   245

		count++;

   246

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

   247

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

   248

   249

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

   250

		return true;

   251

	}

   252

	if (type == AI_INDUSTRY) {

   253

		Industry *i = GetIndustry(ic);

   254

		Station *st;

   255

		int count = 0;

   256

		int j = 0;

   257

   258

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

   259

   260

		// No limits on delevering stations!

   261

		//  Or for industry that does not give anything yet

   262

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

   263

   264

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

   265

   266

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

   267

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

   268

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

   269

		FOR_ALL_STATIONS(st) {

   270

			// Is it an active station

   271

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

   272

   273

			// Do we own it?

   274

			if (st->owner == _current_player) {

   275

				// Are we talking trucks?

   276

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

   277

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

   278

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

   279

				// When was this station build?

   280

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

   281

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

   282

				count++;

   283

			} else {

   284

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

   285

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

   286

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

   287

				//  to build there

   288

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

   289

				// It does not take this cargo

   290

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

   291

				// Is it around our industry

   292

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

   293

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

   294

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

   295

				j++;

   296

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

   297

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

   298

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

   299

				// We don't like this station :(

   300

				return false;

   301

			}

   302

		}

   303

   304

		// We are about to add one...

   305

		count++;

   306

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

   307

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

   308

   309

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

   310

		return true;

   311

	}

   312

   313

	return true;

   314

}

   315

   316

// This functions tries to locate a good route

   317

static void AiNew_State_LocateRoute(Player *p) {

   318

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

   319

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

   320

   321

    // We don't have a route yet

   322

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

   323

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

   324

    	p->ainew.temp = -1;

   325

    	// Reset the counter

   326

    	p->ainew.counter = 0;

   327

   328

    	p->ainew.from_ic = -1;

   329

    	p->ainew.to_ic = -1;

   330

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

   331

   	    	// For now we only have a passenger route

   332

   	    	p->ainew.cargo = CT_PASSENGERS;

   333

   334

	    	// Find a route to cities

   335

	    	p->ainew.from_type = AI_CITY;

   336

	    	p->ainew.to_type = AI_CITY;

   337

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

   338

   	    	p->ainew.cargo = AI_NO_CARGO;

   339

   340

	    	p->ainew.from_type = AI_INDUSTRY;

   341

	    	p->ainew.to_type = AI_INDUSTRY;

   342

		}

   343

   344

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

   345

    	return;

   346

    }

   347

   348

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

   349

    p->ainew.counter++;

   350

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

   351

        // Switch back to doing nothing!

   352

    	p->ainew.state = AI_STATE_NOTHING;

   353

    	return;

   354

    }

   355

   356

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

   357

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

   358

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

   359

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

   360

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

   361

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

   362

       		else

   363

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

   364

        }

   365

   366

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

   367

    		// It was not a valid city

   368

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

   369

    		//  to try again

   370

    		p->ainew.temp++;

   371

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

   372

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

   373

				} else {

   374

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

   375

				}

   376

   377

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

   378

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

   379

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

   380

   381

    		return;

   382

    	}

   383

   384

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

   385

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

   386

   387

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

   388

    	p->ainew.temp = -1;

   389

    	return;

   390

    }

   391

   392

    // Find a to-city

   393

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

   394

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

   395

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

   396

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

   397

       	else

   398

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

   399

	}

   400

   401

	// The same city is not allowed

   402

	// Also check if the city is valid

   403

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

   404

   		// Maybe it is valid..

   405

   406

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

   407

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

   408

   		//   is.

   409

   410

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

   411

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

   412

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

   413

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

   414

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

   415

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

   416

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

   417

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

   418

   				p->ainew.state = AI_STATE_FIND_STATION;

   419

   420

   				DEBUG(ai,1)(

   421

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

   422

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

   423

						p->ainew.from_ic,

   424

						p->ainew.temp

   425

					);

   426

   427

   				p->ainew.from_tile = 0;

   428

   				p->ainew.to_tile = 0;

   429

   430

   				return;

   431

   			}

   432

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

   433

         	bool found = false;

   434

         	int max_cargo = 0;

   435

         	int i;

   436

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

   437

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

   438

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

   439

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

   440

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

   441

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

   442

						// Found a compatbiel industry

   443

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

   444

						found = true;

   445

	   					p->ainew.from_deliver = true;

   446

	   					p->ainew.to_deliver = false;

   447

	       				break;

   448

	       			}

   449

	       		}

   450

   			}

   451

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

   452

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

   453

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

   454

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

   455

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

   456

						// Found a compatbiel industry

   457

						found = true;

   458

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

   459

	   					p->ainew.from_deliver = false;

   460

	   					p->ainew.to_deliver = true;

   461

	       				break;

   462

	       			}

   463

	   			}

   464

   			}

   465

   			if (found) {

   466

   				// Yeah, they are compatible!!!

   467

   				// Check the length against the amount of goods

   468

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

   469

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

   470

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

   471

	   				if (p->ainew.from_deliver) {

   472

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

   473

	   				} else {

   474

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

   475

   					}

   476

	   				p->ainew.state = AI_STATE_FIND_STATION;

   477

   478

	   				DEBUG(ai,1)(

   479

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

   480

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

   481

							p->ainew.from_ic,

   482

							p->ainew.temp

   483

						);

   484

   485

	   				p->ainew.from_tile = 0;

   486

	   				p->ainew.to_tile = 0;

   487

   488

	   				return;

   489

	   			}