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

    19

#include "map.h"

    20

#include "tile.h"

    21

#include "command.h"

    22

#include "ai.h"

    23

#include "town.h"

    24

#include "industry.h"

    25

#include "station.h"

    26

#include "engine.h"

    27

#include "gui.h"

    28

    29

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

    30

static void AiNew_State_FirstTime(Player *p) {

    31

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

    32

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

    33

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

    34

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

    35

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

    36

	// We first have to init some things

    37

    38

	if (_current_player == 1) {

    39

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

    40

	}

    41

    42

	// The PathFinder (AyStar)

    43

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

    44

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

    45

    p->ainew.path_info.start_tile_tl = 0;

    46

    p->ainew.path_info.start_tile_br = 0;

    47

    p->ainew.path_info.end_tile_tl = 0;

    48

    p->ainew.path_info.end_tile_br = 0;

    49

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

    50

    51

	p->ainew.idle = 0;

    52

	p->ainew.last_vehiclecheck_date = _date;

    53

    54

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

    55

	p->ainew.action = AI_ACTION_BUS_ROUTE;

    56

    57

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

    58

	p->ainew.state = AI_STATE_WAKE_UP;

    59

}

    60

    61

// This function just waste some time

    62

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

    63

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

    64

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

    65

//

    66

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

    67

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

    68

static void AiNew_State_Nothing(Player *p) {

    69

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

    70

    // If we are done idling, start over again

    71

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

    72

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

    73

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

    74

		// I mean.. the next tick ;)

    75

		p->ainew.state = AI_STATE_WAKE_UP;

    76

	}

    77

}

    78

    79

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

    80

//  Currently supported:

    81

//    - Make new route

    82

//    - Check route

    83

//    - Build HQ

    84

static void AiNew_State_WakeUp(Player *p) {

    85

    int32 money;

    86

    int c;

    87

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

    88

	// First, check if we have a HQ

    89

	if (p->location_of_house == 0) {

    90

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

    91

		// Random till we found a place for it!

    92

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

    93

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

    94

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

    95

		//  so we do not change any status

    96

		return;

    97

	}

    98

    99

	money = p->player_money - AI_MINIMUM_MONEY;

   100

   101

	// Let's pick an action!

   102

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

   103

		c = Random() & 0xFF;

   104

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

   105

  			c < 10) {

   106

  			p->ainew.action = AI_ACTION_REPAY_LOAN;

   107

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

   108

			// Check all vehicles once in a while

   109

			p->ainew.action = AI_ACTION_CHECK_ALL_VEHICLES;

   110

			p->ainew.last_vehiclecheck_date = _date;

   111

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

   112

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

   113

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

   114

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

   115

				else p->ainew.action = AI_ACTION_BUS_ROUTE;

   116

			}

   117

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

   118

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

   119

				p->ainew.action = AI_ACTION_TRAIN_ROUTE;

   120

			}

   121

		}*/

   122

   123

		p->ainew.counter = 0;

   124

	}

   125

   126

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

   127

		p->ainew.action = AI_ACTION_NONE;

   128

		return;

   129

	}

   130

   131

	if (_patches.ai_disable_veh_roadveh && (

   132

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

   133

		p->ainew.action = AI_ACTION_NONE;

   134

		return;

   135

	}

   136

   137

	if (_patches.ai_disable_veh_roadveh && (

   138

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

   139

		p->ainew.action = AI_ACTION_NONE;

   140

		return;

   141

	}

   142

   143

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

   144

		// We start repaying some money..

   145

		p->ainew.state = AI_STATE_REPAY_MONEY;

   146

		return;

   147

	}

   148

   149

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

   150

		p->ainew.state = AI_STATE_CHECK_ALL_VEHICLES;

   151

		return;

   152

	}

   153

   154

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

   155

	//  to build the route anyway..

   156

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

   157

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

   158

			p->ainew.action = AI_ACTION_NONE;

   159

			return;

   160

		}

   161

		p->ainew.cargo = AI_NEED_CARGO;

   162

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   163

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

   164

		return;

   165

	}

   166

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

   167

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

   168

			p->ainew.action = AI_ACTION_NONE;

   169

			return;

   170

		}

   171

		p->ainew.cargo = AI_NEED_CARGO;

   172

		p->ainew.last_id = 0;

   173

		p->ainew.state = AI_STATE_LOCATE_ROUTE;

   174

		p->ainew.tbt = AI_TRUCK;

   175

		return;

   176

	}

   177

   178

	p->ainew.state = AI_STATE_NOTHING;

   179

}

   180

   181

static void AiNew_State_ActionDone(Player *p) {

   182

    p->ainew.action = AI_ACTION_NONE;

   183

    p->ainew.state = AI_STATE_NOTHING;

   184

}

   185

   186

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

   187

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

   188

	if (type == AI_CITY) {

   189

		Town *t = GetTown(ic);

   190

		Station *st;

   191

		int count = 0;

   192

		int j = 0;

   193

   194

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

   195

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

   196

   197

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

   198

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

   199

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

   200

   201

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

   202

   203

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

   204

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

   205

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

   206

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

   207

		FOR_ALL_STATIONS(st) {

   208

			// Is it an active station

   209

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

   210

			// Do we own it?

   211

			if (st->owner == _current_player) {

   212

				// Are we talking busses?

   213

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

   214

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

   215

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

   216

				// When was this station build?

   217

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

   218

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

   219

				count++;

   220

			} else {

   221

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

   222

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

   223

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

   224

				//  to build there

   225

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

   226

				// Is it around our city

   227

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

   228

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

   229

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

   230

				j++;

   231

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

   232

				if (j == 1) continue;

   233

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

   234

				//  a little chance that we still continue

   235

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

   236

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

   237

				// We don't like this station :(

   238

				return false;

   239

			}

   240

		}

   241

   242

		// We are about to add one...

   243

		count++;

   244

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

   245

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

   246

   247

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

   248

		return true;

   249

	}

   250

	if (type == AI_INDUSTRY) {

   251

		Industry *i = GetIndustry(ic);

   252

		Station *st;

   253

		int count = 0;

   254

		int j = 0;

   255

   256

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

   257

   258

		// No limits on delevering stations!

   259

		//  Or for industry that does not give anything yet

   260

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

   261

   262

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

   263

   264

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

   265

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

   266

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

   267

		FOR_ALL_STATIONS(st) {

   268

			// Is it an active station

   269

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

   270

   271

			// Do we own it?

   272

			if (st->owner == _current_player) {

   273

				// Are we talking trucks?

   274

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

   275

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

   276

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

   277

				// When was this station build?

   278

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

   279

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

   280

				count++;

   281

			} else {

   282

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

   283

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

   284

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

   285

				//  to build there

   286

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

   287

				// It does not take this cargo

   288

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

   289

				// Is it around our industry

   290

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

   291

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

   292

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

   293

				j++;

   294

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

   295

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

   296

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

   297

				// We don't like this station :(

   298

				return false;

   299

			}

   300

		}

   301

   302

		// We are about to add one...

   303

		count++;

   304

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

   305

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

   306

   307

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

   308

		return true;

   309

	}

   310

   311

	return true;

   312

}

   313

   314

// This functions tries to locate a good route

   315

static void AiNew_State_LocateRoute(Player *p) {

   316

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

   317

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

   318

   319

    // We don't have a route yet

   320

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

   321

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

   322

    	p->ainew.temp = -1;

   323

    	// Reset the counter

   324

    	p->ainew.counter = 0;

   325

   326

    	p->ainew.from_ic = -1;

   327

    	p->ainew.to_ic = -1;

   328

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

   329

   	    	// For now we only have a passenger route

   330

   	    	p->ainew.cargo = CT_PASSENGERS;

   331

   332

	    	// Find a route to cities

   333

	    	p->ainew.from_type = AI_CITY;

   334

	    	p->ainew.to_type = AI_CITY;

   335

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

   336

   	    	p->ainew.cargo = AI_NO_CARGO;

   337

   338

	    	p->ainew.from_type = AI_INDUSTRY;

   339

	    	p->ainew.to_type = AI_INDUSTRY;

   340

		}

   341

   342

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

   343

    	return;

   344

    }

   345

   346

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

   347

    p->ainew.counter++;

   348

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

   349

        // Switch back to doing nothing!

   350

    	p->ainew.state = AI_STATE_NOTHING;

   351

    	return;

   352

    }

   353

   354

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

   355

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

   356

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

   357

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

   358

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

   359

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

   360

       		else

   361

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

   362

        }

   363

   364

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

   365

    		// It was not a valid city

   366

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

   367

    		//  to try again

   368

    		p->ainew.temp++;

   369

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

   370

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

   371

				} else {

   372

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

   373

				}

   374

   375

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

   376

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

   377

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

   378

   379

    		return;

   380

    	}

   381

   382

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

   383

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

   384

   385

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

   386

    	p->ainew.temp = -1;

   387

    	return;

   388

    }

   389

   390

    // Find a to-city

   391

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

   392

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

   393

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

   394

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

   395

       	else

   396

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

   397

	}

   398

   399

	// The same city is not allowed

   400

	// Also check if the city is valid

   401

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

   402

   		// Maybe it is valid..

   403

   404

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

   405

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

   406

   		//   is.

   407

   408

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

   409

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

   410

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

   411

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

   412

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

   413

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

   414

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

   415

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

   416

   				p->ainew.state = AI_STATE_FIND_STATION;

   417

   418

   				DEBUG(ai,1)(

   419

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

   420

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

   421

						p->ainew.from_ic,

   422

						p->ainew.temp

   423

					);

   424

   425

   				p->ainew.from_tile = 0;

   426

   				p->ainew.to_tile = 0;

   427

   428

   				return;

   429

   			}

   430

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

   431

         	bool found = false;

   432

         	int max_cargo = 0;

   433

         	int i;

   434

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

   435

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

   436

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

   437

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

   438

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

   439

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

   440

						// Found a compatbiel industry

   441

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

   442

						found = true;

   443

	   					p->ainew.from_deliver = true;

   444

	   					p->ainew.to_deliver = false;

   445

	       				break;

   446

	       			}

   447

	       		}

   448

   			}

   449

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

   450

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

   451

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

   452

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

   453

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

   454

						// Found a compatbiel industry

   455

						found = true;

   456

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

   457

	   					p->ainew.from_deliver = false;

   458

	   					p->ainew.to_deliver = true;

   459

	       				break;

   460

	       			}

   461

	   			}

   462

   			}

   463

   			if (found) {

   464

   				// Yeah, they are compatible!!!

   465

   				// Check the length against the amount of goods

   466

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

   467

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

   468

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

   469

	   				if (p->ainew.from_deliver) {

   470

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

   471

	   				} else {

   472

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

   473

   					}

   474

	   				p->ainew.state = AI_STATE_FIND_STATION;

   475

   476

	   				DEBUG(ai,1)(

   477

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

   478

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

   479

							p->ainew.from_ic,

   480

							p->ainew.temp

   481

						);

   482

   483

	   				p->ainew.from_tile = 0;

   484

	   				p->ainew.to_tile = 0;

   485

   486

	   				return;

   487

	   			}

   488

   			}

   489

   		}