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

    30

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

    31

static void AiNew_State_FirstTime(Player *p) {

    32

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

    33

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

    34

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

    35

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

    36

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

    37

	// We first have to init some things

    38

    39

	if (_current_player == 1) {

    40

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

    41

	}

    42

    43

	// The PathFinder (AyStar)

    44

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

    45

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

    46

    p->ainew.path_info.start_tile_tl = 0;

    47

    p->ainew.path_info.start_tile_br = 0;

    48

    p->ainew.path_info.end_tile_tl = 0;

    49

    p->ainew.path_info.end_tile_br = 0;

    50

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

    51

    52

	p->ainew.idle = 0;

    53

	p->ainew.last_vehiclecheck_date = _date;

    54

    55

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

    56

	p->ainew.action = AI_ACTION_BUS_ROUTE;

    57

    58

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

    59

	p->ainew.state = AI_STATE_WAKE_UP;

    60

}

    61

    62

// This function just waste some time

    63

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

    64

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

    65

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

    66

//

    67

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

    68

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

    69

static void AiNew_State_Nothing(Player *p) {

    70

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

    71

    // If we are done idling, start over again

    72

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

    73

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

    74

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

    75

		// I mean.. the next tick ;)

    76

		p->ainew.state = AI_STATE_WAKE_UP;

    77

	}

    78

}

    79

    80

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

    81

//  Currently supported:

    82

//    - Make new route

    83

//    - Check route

    84

//    - Build HQ

    85

static void AiNew_State_WakeUp(Player *p) {

    86

    int32 money;

    87

    int c;

    88

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

    89

	// First, check if we have a HQ

    90

	if (p->location_of_house == 0) {

    91

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

    92

		// Random till we found a place for it!

    93

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

    94

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

    95

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

    96

		//  so we do not change any status

    97

		return;

    98

	}

    99

   100

	money = p->player_money - AI_MINIMUM_MONEY;

   101

   102

	// Let's pick an action!

   103

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

   104

		c = Random() & 0xFF;

   105

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

   106

  			c < 10) {

   107

  			p->ainew.action = AI_ACTION_REPAY_LOAN;

   108

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

   109

			// Check all vehicles once in a while

   110

			p->ainew.action = AI_ACTION_CHECK_ALL_VEHICLES;

   111

			p->ainew.last_vehiclecheck_date = _date;

   112

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

   113

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

   114

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

   115

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

   116

				else p->ainew.action = AI_ACTION_BUS_ROUTE;

   117

			}

   118

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

   119

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

   120

				p->ainew.action = AI_ACTION_TRAIN_ROUTE;

   121

			}

   122

		}*/

   123

   124

		p->ainew.counter = 0;

   125

	}

   126

   127

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

   128

		p->ainew.action = AI_ACTION_NONE;

   129

		return;

   130

	}

   131

   132

	if (_patches.ai_disable_veh_roadveh && (

   133

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

   134

		p->ainew.action = AI_ACTION_NONE;

   135

		return;

   136

	}

   137

   138

	if (_patches.ai_disable_veh_roadveh && (

   139

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

   140

		p->ainew.action = AI_ACTION_NONE;

   141

		return;

   142

	}

   143

   144

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

   145

		// We start repaying some money..

   146

		p->ainew.state = AI_STATE_REPAY_MONEY;

   147

		return;

   148

	}

   149

   150

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

   151

		p->ainew.state = AI_STATE_CHECK_ALL_VEHICLES;

   152

		return;

   153

	}

   154

   155

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

   156

	//  to build the route anyway..

   157

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

   158

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

   159

			p->ainew.action = AI_ACTION_NONE;

   160

			return;

   161

		}

   162

		p->ainew.cargo = AI_NEED_CARGO;

   163

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   164

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

   165

		return;

   166

	}

   167

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

   168

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

   169

			p->ainew.action = AI_ACTION_NONE;

   170

			return;

   171

		}

   172

		p->ainew.cargo = AI_NEED_CARGO;

   173

		p->ainew.last_id = 0;

   174

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   175

		p->ainew.tbt = AI_TRUCK;

   176

		return;

   177

	}

   178

   179

	p->ainew.state = AI_STATE_NOTHING;

   180

}

   181

   182

static void AiNew_State_ActionDone(Player *p) {

   183

    p->ainew.action = AI_ACTION_NONE;

   184

    p->ainew.state = AI_STATE_NOTHING;

   185

}

   186

   187

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

   188

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

   189

	if (type == AI_CITY) {

   190

		Town *t = GetTown(ic);

   191

		Station *st;

   192

		int count = 0;

   193

		int j = 0;

   194

   195

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

   196

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

   197

   198

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

   199

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

   200

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

   201

   202

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

   203

   204

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

   205

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

   206

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

   207

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

   208

		FOR_ALL_STATIONS(st) {

   209

			// Is it an active station

   210

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

   211

			// Do we own it?

   212

			if (st->owner == _current_player) {

   213

				// Are we talking busses?

   214

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

   215

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

   216

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

   217

				// When was this station build?

   218

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

   219

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

   220

				count++;

   221

			} else {

   222

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

   223

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

   224

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

   225

				//  to build there

   226

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

   227

				// Is it around our city

   228

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

   229

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

   230

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

   231

				j++;

   232

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

   233

				if (j == 1) continue;

   234

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

   235

				//  a little chance that we still continue

   236

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

   237

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

   238

				// We don't like this station :(

   239

				return false;

   240

			}

   241

		}

   242

   243

		// We are about to add one...

   244

		count++;

   245

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

   246

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

   247

   248

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

   249

		return true;

   250

	}

   251

	if (type == AI_INDUSTRY) {

   252

		Industry *i = GetIndustry(ic);

   253

		Station *st;

   254

		int count = 0;

   255

		int j = 0;

   256

   257

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

   258

   259

		// No limits on delevering stations!

   260

		//  Or for industry that does not give anything yet

   261

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

   262

   263

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

   264

   265

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

   266

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

   267

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

   268

		FOR_ALL_STATIONS(st) {

   269

			// Is it an active station

   270

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

   271

   272

			// Do we own it?

   273

			if (st->owner == _current_player) {

   274

				// Are we talking trucks?

   275

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

   276

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

   277

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

   278

				// When was this station build?

   279

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

   280

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

   281

				count++;

   282

			} else {

   283

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

   284

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

   285

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

   286

				//  to build there

   287

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

   288

				// It does not take this cargo

   289

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

   290

				// Is it around our industry

   291

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

   292

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

   293

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

   294

				j++;

   295

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

   296

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

   297

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

   298

				// We don't like this station :(

   299

				return false;

   300

			}

   301

		}

   302

   303

		// We are about to add one...

   304

		count++;

   305

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

   306

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

   307

   308

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

   309

		return true;

   310

	}

   311

   312

	return true;

   313

}

   314

   315

// This functions tries to locate a good route

   316

static void AiNew_State_LocateRoute(Player *p) {

   317

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

   318

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

   319

   320

    // We don't have a route yet

   321

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

   322

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

   323

    	p->ainew.temp = -1;

   324

    	// Reset the counter

   325

    	p->ainew.counter = 0;

   326

   327

    	p->ainew.from_ic = -1;

   328

    	p->ainew.to_ic = -1;

   329

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

   330

   	    	// For now we only have a passenger route

   331

   	    	p->ainew.cargo = CT_PASSENGERS;

   332

   333

	    	// Find a route to cities

   334

	    	p->ainew.from_type = AI_CITY;

   335

	    	p->ainew.to_type = AI_CITY;

   336

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

   337

   	    	p->ainew.cargo = AI_NO_CARGO;

   338

   339

	    	p->ainew.from_type = AI_INDUSTRY;

   340

	    	p->ainew.to_type = AI_INDUSTRY;

   341

		}

   342

   343

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

   344

    	return;

   345

    }

   346

   347

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

   348

    p->ainew.counter++;

   349

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

   350

        // Switch back to doing nothing!

   351

    	p->ainew.state = AI_STATE_NOTHING;

   352

    	return;

   353

    }

   354

   355

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

   356

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

   357

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

   358

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

   359

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

   360

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

   361

       		else

   362

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

   363

        }

   364

   365

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

   366

    		// It was not a valid city

   367

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

   368

    		//  to try again

   369

    		p->ainew.temp++;

   370

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

   371

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

   372

				} else {

   373

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

   374

				}

   375

   376

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

   377

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

   378

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

   379

   380

    		return;

   381

    	}

   382

   383

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

   384

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

   385

   386

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

   387

    	p->ainew.temp = -1;

   388

    	return;

   389

    }

   390

   391

    // Find a to-city

   392

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

   393

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

   394

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

   395

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

   396

       	else

   397

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

   398

	}

   399

   400

	// The same city is not allowed

   401

	// Also check if the city is valid

   402

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

   403

   		// Maybe it is valid..

   404

   405

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

   406

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

   407

   		//   is.

   408

   409

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

   410

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

   411

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

   412

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

   413

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

   414

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

   415

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

   416

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

   417

   				p->ainew.state = AI_STATE_FIND_STATION;

   418

   419

   				DEBUG(ai,1)(

   420

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

   421

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

   422

						p->ainew.from_ic,

   423

						p->ainew.temp

   424

					);

   425

   426

   				p->ainew.from_tile = 0;

   427

   				p->ainew.to_tile = 0;

   428

   429

   				return;

   430

   			}

   431

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

   432

         	bool found = false;

   433

         	int max_cargo = 0;

   434

         	int i;

   435

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

   436

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

   437

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

   438

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

   439

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

   440

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

   441

						// Found a compatbiel industry

   442

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

   443

						found = true;

   444

	   					p->ainew.from_deliver = true;

   445

	   					p->ainew.to_deliver = false;

   446

	       				break;

   447

	       			}

   448

	       		}

   449

   			}

   450

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

   451

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

   452

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

   453

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

   454

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

   455

						// Found a compatbiel industry

   456

						found = true;

   457

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

   458

	   					p->ainew.from_deliver = false;

   459

	   					p->ainew.to_deliver = true;

   460

	       				break;

   461

	       			}

   462

	   			}

   463

   			}

   464

   			if (found) {

   465

   				// Yeah, they are compatible!!!

   466

   				// Check the length against the amount of goods

   467

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

   468

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

   469

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

   470

	   				if (p->ainew.from_deliver) {

   471

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

   472

	   				} else {

   473

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

   474

   					}

   475

	   				p->ainew.state = AI_STATE_FIND_STATION;

   476

   477

	   				DEBUG(ai,1)(

   478

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

   479

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

   480

							p->ainew.from_ic,

   481

							p->ainew.temp

   482

						);

   483

   484

	   				p->ainew.from_tile = 0;

   485

	   				p->ainew.to_tile = 0;

   486

   487

	   				return;

   488

	   			}

   489

   			}