1

/* $Id$ */

     2

     3

#include "../../stdafx.h"

     4

#include "../../openttd.h"

     5

#include "../../debug.h"

     6

#include "../../functions.h"

     7

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

     8

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

     9

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

    10

#include "trolly.h"

    11

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

    12

#include "../../variables.h"

    13

#include "../ai.h"

    14

    15

#define TEST_STATION_NO_DIR 0xFF

    16

    17

// Tests if a station can be build on the given spot

    18

// TODO: make it train compatible

    19

static bool TestCanBuildStationHere(TileIndex tile, byte dir)

    20

{

    21

	Player *p = GetPlayer(_current_player);

    22

    23

	if (dir == TEST_STATION_NO_DIR) {

    24

		int32 ret;

    25

		// TODO: currently we only allow spots that can be access from al 4 directions...

    26

		//  should be fixed!!!

    27

		for (dir = 0; dir < 4; dir++) {

    28

			ret = AiNew_Build_Station(p, p->ainew.tbt, tile, 1, 1, dir, DC_QUERY_COST);

    29

			if (!CmdFailed(ret)) return true;

    30

		}

    31

		return false;

    32

	}

    33

    34

	// return true if command succeeded, so the inverse of CmdFailed()

    35

	return !CmdFailed(AiNew_Build_Station(p, p->ainew.tbt, tile, 1, 1, dir, DC_QUERY_COST));

    36

}

    37

    38

    39

static bool IsRoad(TileIndex tile)

    40

{

    41

	return

    42

		// MP_STREET, but not a road depot?

    43

		(IsTileType(tile, MP_STREET) && !IsTileDepotType(tile, TRANSPORT_ROAD)) ||

    44

		(IsTileType(tile, MP_TUNNELBRIDGE) && (

    45

			// road tunnel?

    46

			((_m[tile].m5 & 0x80) == 0 && (_m[tile].m5 & 0x4) == 0x4) ||

    47

			// road bridge?

    48

			((_m[tile].m5 & 0x80) != 0 && (_m[tile].m5 & 0x2) == 0x2)

    49

		));

    50

}

    51

    52

    53

// Checks if a tile 'a' is between the tiles 'b' and 'c'

    54

#define TILES_BETWEEN(a, b, c) (TileX(a) >= TileX(b) && TileX(a) <= TileX(c) && TileY(a) >= TileY(b) && TileY(a) <= TileY(c))

    55

    56

    57

// Check if the current tile is in our end-area

    58

static int32 AyStar_AiPathFinder_EndNodeCheck(AyStar *aystar, OpenListNode *current)

    59

{

    60

	Ai_PathFinderInfo *PathFinderInfo = (Ai_PathFinderInfo*)aystar->user_target;

    61

	// It is not allowed to have a station on the end of a bridge or tunnel ;)

    62

	if (current->path.node.user_data[0] != 0) return AYSTAR_DONE;

    63

	if (TILES_BETWEEN(current->path.node.tile, PathFinderInfo->end_tile_tl, PathFinderInfo->end_tile_br))

    64

		if (IsTileType(current->path.node.tile, MP_CLEAR) || IsTileType(current->path.node.tile, MP_TREES))

    65

			if (current->path.parent == NULL || TestCanBuildStationHere(current->path.node.tile, AiNew_GetDirection(current->path.parent->node.tile, current->path.node.tile)))

    66

				return AYSTAR_FOUND_END_NODE;

    67

    68

	return AYSTAR_DONE;

    69

}

    70

    71

    72

// Calculates the hash

    73

//   Currently it is a 10 bit hash, so the hash array has a max depth of 6 bits (so 64)

    74

static uint AiPathFinder_Hash(uint key1, uint key2)

    75

{

    76

	return (TileX(key1) & 0x1F) + ((TileY(key1) & 0x1F) << 5);

    77

}

    78

    79

    80

// Clear the memory of all the things

    81

static void AyStar_AiPathFinder_Free(AyStar *aystar)

    82

{

    83

	AyStarMain_Free(aystar);

    84

	free(aystar);

    85

}

    86

    87

    88

static int32 AyStar_AiPathFinder_CalculateG(AyStar *aystar, AyStarNode *current, OpenListNode *parent);

    89

static int32 AyStar_AiPathFinder_CalculateH(AyStar *aystar, AyStarNode *current, OpenListNode *parent);

    90

static void AyStar_AiPathFinder_FoundEndNode(AyStar *aystar, OpenListNode *current);

    91

static void AyStar_AiPathFinder_GetNeighbours(AyStar *aystar, OpenListNode *current);

    92

    93

    94

// This creates the AiPathFinder

    95

AyStar *new_AyStar_AiPathFinder(int max_tiles_around, Ai_PathFinderInfo *PathFinderInfo)

    96

{

    97

	PathNode start_node;

    98

	uint x;

    99

	uint y;

   100

	// Create AyStar

   101

	AyStar *result = malloc(sizeof(AyStar));

   102

	init_AyStar(result, AiPathFinder_Hash, 1 << 10);

   103

	// Set the function pointers

   104

	result->CalculateG = AyStar_AiPathFinder_CalculateG;

   105

	result->CalculateH = AyStar_AiPathFinder_CalculateH;

   106

	result->EndNodeCheck = AyStar_AiPathFinder_EndNodeCheck;

   107

	result->FoundEndNode = AyStar_AiPathFinder_FoundEndNode;

   108

	result->GetNeighbours = AyStar_AiPathFinder_GetNeighbours;

   109

   110

	result->free = AyStar_AiPathFinder_Free;

   111

   112

	// Set some information

   113

	result->loops_per_tick = AI_PATHFINDER_LOOPS_PER_TICK;

   114

	result->max_path_cost = 0;

   115

	result->max_search_nodes = AI_PATHFINDER_MAX_SEARCH_NODES;

   116

   117

	// Set the user_data to the PathFinderInfo

   118

	result->user_target = PathFinderInfo;

   119

   120

	// Set the start node

   121

	start_node.parent = NULL;

   122

	start_node.node.direction = 0;

   123

	start_node.node.user_data[0] = 0;

   124

   125

	// Now we add all the starting tiles

   126

	for (x = TileX(PathFinderInfo->start_tile_tl); x <= TileX(PathFinderInfo->start_tile_br); x++) {

   127

		for (y = TileY(PathFinderInfo->start_tile_tl); y <= TileY(PathFinderInfo->start_tile_br); y++) {

   128

			start_node.node.tile = TileXY(x, y);

   129

			result->addstart(result, &start_node.node, 0);

   130

		}

   131

	}

   132

   133

	return result;

   134

}

   135

   136

   137

// To reuse AyStar we sometimes have to clean all the memory

   138

void clean_AyStar_AiPathFinder(AyStar *aystar, Ai_PathFinderInfo *PathFinderInfo)

   139

{

   140

	PathNode start_node;

   141

	uint x;

   142

	uint y;

   143

   144

	aystar->clear(aystar);

   145

   146

	// Set the user_data to the PathFinderInfo

   147

	aystar->user_target = PathFinderInfo;

   148

   149

	// Set the start node

   150

	start_node.parent = NULL;

   151

	start_node.node.direction = 0;

   152

	start_node.node.user_data[0] = 0;

   153

	start_node.node.tile = PathFinderInfo->start_tile_tl;

   154

   155

	// Now we add all the starting tiles

   156

	for (x = TileX(PathFinderInfo->start_tile_tl); x <= TileX(PathFinderInfo->start_tile_br); x++) {

   157

		for (y = TileY(PathFinderInfo->start_tile_tl); y <= TileY(PathFinderInfo->start_tile_br); y++) {

   158

			if (!(IsTileType(TileXY(x, y), MP_CLEAR) || IsTileType(TileXY(x, y), MP_TREES))) continue;

   159

			if (!TestCanBuildStationHere(TileXY(x, y), TEST_STATION_NO_DIR)) continue;

   160

			start_node.node.tile = TileXY(x, y);

   161

			aystar->addstart(aystar, &start_node.node, 0);

   162

		}

   163

	}

   164

}

   165

   166

   167

// The h-value, simple calculation

   168

static int32 AyStar_AiPathFinder_CalculateH(AyStar *aystar, AyStarNode *current, OpenListNode *parent)

   169

{

   170

	Ai_PathFinderInfo *PathFinderInfo = (Ai_PathFinderInfo*)aystar->user_target;

   171

	int r, r2;

   172

	if (PathFinderInfo->end_direction != AI_PATHFINDER_NO_DIRECTION) {

   173

		// The station is pointing to a direction, add a tile towards that direction, so the H-value is more accurate

   174

		r = DistanceManhattan(current->tile, PathFinderInfo->end_tile_tl + TileOffsByDir(PathFinderInfo->end_direction));

   175

		r2 = DistanceManhattan(current->tile, PathFinderInfo->end_tile_br + TileOffsByDir(PathFinderInfo->end_direction));

   176

	} else {

   177

		// No direction, so just get the fastest route to the station

   178

		r = DistanceManhattan(current->tile, PathFinderInfo->end_tile_tl);

   179

		r2 = DistanceManhattan(current->tile, PathFinderInfo->end_tile_br);

   180

	}

   181

	// See if the bottomright is faster than the topleft..

   182

	if (r2 < r) r = r2;

   183

	return r * AI_PATHFINDER_H_MULTIPLER;

   184

}

   185

   186

   187

// We found the end.. let's get the route back and put it in an array

   188

static void AyStar_AiPathFinder_FoundEndNode(AyStar *aystar, OpenListNode *current)

   189

{

   190

	Ai_PathFinderInfo *PathFinderInfo = (Ai_PathFinderInfo*)aystar->user_target;

   191

	uint i = 0;

   192

	PathNode *parent = &current->path;

   193

   194

	do {

   195

		PathFinderInfo->route_extra[i] = parent->node.user_data[0];

   196

		PathFinderInfo->route[i++] = parent->node.tile;

   197

		if (i > lengthof(PathFinderInfo->route)) {

   198

			// We ran out of space for the PathFinder

   199

			DEBUG(ai, 0)("[AiPathFinder] Ran out of space in the route[] array!!!");

   200

			PathFinderInfo->route_length = -1; // -1 indicates out of space

   201

			return;

   202

		}

   203

		parent = parent->parent;

   204

	} while (parent != NULL);

   205

	PathFinderInfo->route_length = i;

   206

	DEBUG(ai, 1)("[Ai-PathFinding] Found route of %d nodes long in %d nodes of searching", i, Hash_Size(&aystar->ClosedListHash));

   207

}

   208

   209

   210

// What tiles are around us.

   211

static void AyStar_AiPathFinder_GetNeighbours(AyStar *aystar, OpenListNode *current)

   212

{

   213

	uint i;

   214

	int ret;

   215

	int dir;

   216

   217

	Ai_PathFinderInfo *PathFinderInfo = (Ai_PathFinderInfo*)aystar->user_target;

   218

   219

	aystar->num_neighbours = 0;

   220

   221

	// Go through all surrounding tiles and check if they are within the limits

   222

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

   223

		TileIndex ctile = current->path.node.tile; // Current tile

   224

		TileIndex atile = ctile + TileOffsByDir(i); // Adjacent tile

   225

   226

		if (TileX(atile) > 1 && TileX(atile) < MapMaxX() - 1 &&

   227

				TileY(atile) > 1 && TileY(atile) < MapMaxY() - 1) {

   228

			// We also directly test if the current tile can connect to this tile..

   229

			//  We do this simply by just building the tile!

   230

   231

			// If the next step is a bridge, we have to enter it the right way

   232

			if (!PathFinderInfo->rail_or_road && IsRoad(atile)) {

   233

				if (IsTileType(atile, MP_TUNNELBRIDGE)) {

   234

					// An existing bridge... let's test the direction ;)

   235

					if ((_m[atile].m5 & 1U) != (i & 1)) continue;

   236

					// This problem only is valid for tunnels:

   237

					// When the last tile was not yet a tunnel, check if we enter from the right side..

   238

					if ((_m[atile].m5 & 0x80) == 0) {

   239

						if (i != (_m[atile].m5 & 3U)) continue;

   240

					}

   241

				}

   242

			}

   243

			// But also if we are on a bridge, we can only move a certain direction

   244

			if (!PathFinderInfo->rail_or_road && IsRoad(ctile)) {

   245

				if (IsTileType(ctile, MP_TUNNELBRIDGE)) {

   246

					// An existing bridge/tunnel... let's test the direction ;)

   247

					if ((_m[ctile].m5 & 1U) != (i & 1)) continue;

   248

				}

   249

			}

   250

   251

			if ((AI_PATHFINDER_FLAG_BRIDGE & current->path.node.user_data[0]) != 0 ||

   252

					(AI_PATHFINDER_FLAG_TUNNEL & current->path.node.user_data[0]) != 0) {

   253

				// We are a bridge/tunnel, how cool!!

   254

				//  This means we can only point forward.. get the direction from the user_data

   255

				if (i != (current->path.node.user_data[0] >> 8)) continue;

   256

			}

   257

			dir = 0;

   258

   259

			// First, check if we have a parent

   260

			if (current->path.parent == NULL && current->path.node.user_data[0] == 0) {

   261

				// If not, this means we are at the starting station

   262

				if (PathFinderInfo->start_direction != AI_PATHFINDER_NO_DIRECTION) {

   263

					// We do need a direction?

   264

					if (AiNew_GetDirection(ctile, atile) != PathFinderInfo->start_direction) {

   265

						// We are not pointing the right way, invalid tile

   266

						continue;

   267

					}

   268

				}

   269

			} else if (current->path.node.user_data[0] == 0) {

   270

				if (PathFinderInfo->rail_or_road) {

   271

					// Rail check

   272

					dir = AiNew_GetRailDirection(current->path.parent->node.tile, ctile, atile);

   273

					ret = AI_DoCommand(ctile, 0, dir, DC_AUTO | DC_NO_WATER, CMD_BUILD_SINGLE_RAIL);

   274

					if (CmdFailed(ret)) continue;

   275

#ifdef AI_PATHFINDER_NO_90DEGREES_TURN

   276

					if (current->path.parent->parent != NULL) {

   277

						// Check if we don't make a 90degree curve

   278

						int dir1 = AiNew_GetRailDirection(current->path.parent->parent->node.tile, current->path.parent->node.tile, ctile);

   279

						if (_illegal_curves[dir1] == dir || _illegal_curves[dir] == dir1) {

   280

							continue;

   281

						}

   282

					}

   283

#endif

   284

				} else {

   285

					// Road check

   286

					dir = AiNew_GetRoadDirection(current->path.parent->node.tile, ctile, atile);

   287

					if (IsRoad(ctile)) {

   288

						if (IsTileType(ctile, MP_TUNNELBRIDGE)) {

   289

							// We have a bridge, how nicely! We should mark it...

   290

							dir = 0;

   291

						} else {

   292

							// It already has road.. check if we miss any bits!

   293

							if ((_m[ctile].m5 & dir) != dir) {

   294

								// We do miss some pieces :(

   295

								dir &= ~_m[ctile].m5;

   296

							} else {

   297

								dir = 0;

   298

							}

   299

						}

   300

					}

   301

					// Only destruct things if it is MP_CLEAR of MP_TREES

   302

					if (dir != 0) {

   303

						ret = AI_DoCommand(ctile, dir, 0, DC_AUTO | DC_NO_WATER, CMD_BUILD_ROAD);

   304

						if (CmdFailed(ret)) continue;

   305

					}

   306

				}

   307

			}

   308

   309

			// The tile can be connected

   310

			aystar->neighbours[aystar->num_neighbours].tile = atile;

   311

			aystar->neighbours[aystar->num_neighbours].user_data[0] = 0;

   312

			aystar->neighbours[aystar->num_neighbours++].direction = 0;

   313

		}

   314

	}

   315

   316

	// Next step, check for bridges and tunnels

   317

	if (current->path.parent != NULL && current->path.node.user_data[0] == 0) {

   318

		// First we get the dir from this tile and his parent

   319

		int dir = AiNew_GetDirection(current->path.parent->node.tile, current->path.node.tile);

   320

		// It means we can only walk with the track, so the bridge has to be in the same direction

   321

		TileIndex tile = current->path.node.tile;

   322

		TileIndex new_tile = tile;

   323

		uint tileh;

   324

   325

		tileh = GetTileSlope(tile, NULL);

   326

   327

		// Bridges can only be build on land that is not flat

   328

		//  And if there is a road or rail blocking

   329

		if (tileh != 0 ||

   330

				(PathFinderInfo->rail_or_road && IsTileType(tile + TileOffsByDir(dir), MP_STREET)) ||

   331

				(!PathFinderInfo->rail_or_road && IsTileType(tile + TileOffsByDir(dir), MP_RAILWAY))) {

   332

			for (;;) {

   333

				new_tile += TileOffsByDir(dir);

   334

   335

				// Precheck, is the length allowed?

   336

				if (!CheckBridge_Stuff(0, GetBridgeLength(tile, new_tile))) break;

   337

   338

				// Check if we hit the station-tile.. we don't like that!

   339

				if (TILES_BETWEEN(new_tile, PathFinderInfo->end_tile_tl, PathFinderInfo->end_tile_br)) break;

   340

   341

				// Try building the bridge..

   342

				ret = AI_DoCommand(tile, new_tile, (0 << 8) + (MAX_BRIDGES / 2), DC_AUTO, CMD_BUILD_BRIDGE);

   343

				if (CmdFailed(ret)) continue;

   344

				// We can build a bridge here.. add him to the neighbours

   345

				aystar->neighbours[aystar->num_neighbours].tile = new_tile;

   346

				aystar->neighbours[aystar->num_neighbours].user_data[0] = AI_PATHFINDER_FLAG_BRIDGE + (dir << 8);

   347

				aystar->neighbours[aystar->num_neighbours++].direction = 0;

   348

				// We can only have 12 neighbours, and we need 1 left for tunnels

   349

				if (aystar->num_neighbours == 11) break;

   350

			}

   351

		}

   352

   353

		// Next, check for tunnels!

   354

		// Tunnels can only be build with tileh of 3, 6, 9 or 12, depending on the direction

   355

		//  For now, we check both sides for this tile.. terraforming gives fuzzy result

   356

		if ((dir == 0 && tileh == 12) ||

   357

				(dir == 1 && tileh == 6) ||

   358

				(dir == 2 && tileh == 3) ||

   359

				(dir == 3 && tileh == 9)) {

   360

			// Now simply check if a tunnel can be build

   361

			ret = AI_DoCommand(tile, (PathFinderInfo->rail_or_road?0:0x200), 0, DC_AUTO, CMD_BUILD_TUNNEL);

   362

			tileh = GetTileSlope(_build_tunnel_endtile, NULL);

   363

			if (!CmdFailed(ret) && (tileh == 3 || tileh == 6 || tileh == 9 || tileh == 12)) {

   364

				aystar->neighbours[aystar->num_neighbours].tile = _build_tunnel_endtile;

   365

				aystar->neighbours[aystar->num_neighbours].user_data[0] = AI_PATHFINDER_FLAG_TUNNEL + (dir << 8);

   366

				aystar->neighbours[aystar->num_neighbours++].direction = 0;

   367

			}

   368

		}

   369

	}

   370

}

   371

   372

   373

extern uint GetRailFoundation(uint tileh, uint bits);

   374

extern uint GetRoadFoundation(uint tileh, uint bits);

   375

extern uint GetBridgeFoundation(uint tileh, Axis); // XXX function declaration in .c

   376

enum {

   377

	BRIDGE_NO_FOUNDATION = 1 << 0 | 1 << 3 | 1 << 6 | 1 << 9 | 1 << 12,

   378

};

   379

   380

// The most important function: it calculates the g-value

   381

static int32 AyStar_AiPathFinder_CalculateG(AyStar *aystar, AyStarNode *current, OpenListNode *parent)

   382

{

   383

	Ai_PathFinderInfo *PathFinderInfo = (Ai_PathFinderInfo*)aystar->user_target;

   384

	int r, res = 0;

   385

	uint tileh = GetTileSlope(current->tile, NULL);

   386

	uint parent_tileh = GetTileSlope(parent->path.node.tile, NULL);

   387

   388

	// Check if we hit the end-tile

   389

	if (TILES_BETWEEN(current->tile, PathFinderInfo->end_tile_tl, PathFinderInfo->end_tile_br)) {

   390

		// We are at the end-tile, check if we had a direction or something...

   391

		if (PathFinderInfo->end_direction != AI_PATHFINDER_NO_DIRECTION && AiNew_GetDirection(current->tile, parent->path.node.tile) != PathFinderInfo->end_direction) {

   392

			// We are not pointing the right way, invalid tile

   393

			return AYSTAR_INVALID_NODE;

   394

		}

   395

		// If it was valid, drop out.. we don't build on the endtile

   396

		return 0;

   397

	}

   398

   399

	// Give everything a small penalty

   400

	res += AI_PATHFINDER_PENALTY;

   401

   402

	if (!PathFinderInfo->rail_or_road) {

   403

		// Road has the lovely advantage it can use other road... check if

   404

		//  the current tile is road, and if so, give a good bonus

   405

		if (IsRoad(current->tile)) {

   406

			res -= AI_PATHFINDER_ROAD_ALREADY_EXISTS_BONUS;

   407

		}

   408

	}

   409

   410

	// We should give a penalty when the tile is going up or down.. this is one way to do so!

   411

	//  Too bad we have to count it from the parent.. but that is not so bad.

   412

	// We also dislike long routes on slopes, since they do not look too realistic

   413

	//  when there is a flat land all around, they are more expensive to build, and

   414

	//  especially they essentially block the ability to connect or cross the road

   415

	//  from one side.

   416

	if (parent_tileh != 0 && parent->path.parent != NULL) {

   417

		// Skip if the tile was from a bridge or tunnel

   418

		if (parent->path.node.user_data[0] == 0 && current->user_data[0] == 0) {

   419

			if (PathFinderInfo->rail_or_road) {

   420

				r = GetRailFoundation(parent_tileh, 1 << AiNew_GetRailDirection(parent->path.parent->node.tile, parent->path.node.tile, current->tile));

   421

				// Maybe is BRIDGE_NO_FOUNDATION a bit strange here, but it contains just the right information..

   422

				if (r >= 15 || (r == 0 && (BRIDGE_NO_FOUNDATION & (1 << tileh)))) {

   423

					res += AI_PATHFINDER_TILE_GOES_UP_PENALTY;

   424

				} else {

   425

					res += AI_PATHFINDER_FOUNDATION_PENALTY;

   426

				}

   427

			} else {

   428

				if (!(IsRoad(parent->path.node.tile) && IsTileType(parent->path.node.tile, MP_TUNNELBRIDGE))) {

   429

					r = GetRoadFoundation(parent_tileh, AiNew_GetRoadDirection(parent->path.parent->node.tile, parent->path.node.tile, current->tile));

   430

					if (r >= 15 || r == 0)

   431

						res += AI_PATHFINDER_TILE_GOES_UP_PENALTY;

   432

					else

   433

						res += AI_PATHFINDER_FOUNDATION_PENALTY;

   434

				}

   435

			}

   436

		}

   437

	}

   438

   439

	// Are we part of a tunnel?

   440

	if ((AI_PATHFINDER_FLAG_TUNNEL & current->user_data[0]) != 0) {

   441

		// Tunnels are very expensive when build on long routes..

   442

		// Ironicly, we are using BridgeCode here ;)

   443

		r = AI_PATHFINDER_TUNNEL_PENALTY * GetBridgeLength(current->tile, parent->path.node.tile);

   444

		res += r + (r >> 8);

   445

	}

   446

   447

	// Are we part of a bridge?

   448

	if ((AI_PATHFINDER_FLAG_BRIDGE & current->user_data[0]) != 0) {

   449

		// That means for every length a penalty

   450

		res += AI_PATHFINDER_BRIDGE_PENALTY * GetBridgeLength(current->tile, parent->path.node.tile);

   451

		// Check if we are going up or down, first for the starting point

   452

		// In user_data[0] is at the 8th bit the direction

   453

		if (!(BRIDGE_NO_FOUNDATION & (1 << parent_tileh))) {

   454

			if (GetBridgeFoundation(parent_tileh, (current->user_data[0] >> 8) & 1) < 15)

   455

				res += AI_PATHFINDER_BRIDGE_GOES_UP_PENALTY;

   456

		}

   457

		// Second for the end point

   458

		if (!(BRIDGE_NO_FOUNDATION & (1 << tileh))) {

   459

			if (GetBridgeFoundation(tileh, (current->user_data[0] >> 8) & 1) < 15)

   460

				res += AI_PATHFINDER_BRIDGE_GOES_UP_PENALTY;

   461

		}

   462

		if (parent_tileh == 0) res += AI_PATHFINDER_BRIDGE_GOES_UP_PENALTY;

   463

		if (tileh == 0) res += AI_PATHFINDER_BRIDGE_GOES_UP_PENALTY;

   464

	}

   465

   466

	//  To prevent the AI from taking the fastest way in tiles, but not the fastest way

   467

	//    in speed, we have to give a good penalty to direction changing

   468

	//  This way, we get almost the fastest way in tiles, and a very good speed on the track

   469

	if (!PathFinderInfo->rail_or_road) {

   470

		if (parent->path.parent != NULL &&

   471

				AiNew_GetDirection(current->tile, parent->path.node.tile) != AiNew_GetDirection(parent->path.node.tile, parent->path.parent->node.tile)) {

   472

			// When road exists, we don't like turning, but its free, so don't be to piggy about it

   473

			if (IsRoad(parent->path.node.tile))

   474

				res += AI_PATHFINDER_DIRECTION_CHANGE_ON_EXISTING_ROAD_PENALTY;

   475

			else

   476

				res += AI_PATHFINDER_DIRECTION_CHANGE_PENALTY;

   477

		}

   478

	} else {

   479

		// For rail we have 1 exeption: diagonal rail..

   480

		// So we fetch 2 raildirection. That of the current one, and of the one before that

   481

		if (parent->path.parent != NULL && parent->path.parent->parent != NULL) {

   482

			int dir1 = AiNew_GetRailDirection(parent->path.parent->node.tile, parent->path.node.tile, current->tile);

   483

			int dir2 = AiNew_GetRailDirection(parent->path.parent->parent->node.tile, parent->path.parent->node.tile, parent->path.node.tile);

   484

			// First, see if we are on diagonal path, that is better than straight path

   485

			if (dir1 > 1) res -= AI_PATHFINDER_DIAGONAL_BONUS;

   486

   487

			// First see if they are different

   488

			if (dir1 != dir2) {

   489

				// dir 2 and 3 are 1 diagonal track, and 4 and 5.

   490

				if (!(((dir1 == 2 || dir1 == 3) && (dir2 == 2 || dir2 == 3)) || ((dir1 == 4 || dir1 == 5) && (dir2 == 4 || dir2 == 5)))) {

   491

					// It is not, so we changed of direction

   492

					res += AI_PATHFINDER_DIRECTION_CHANGE_PENALTY;

   493

				}

   494

				if (parent->path.parent->parent->parent != NULL) {

   495

					int dir3 = AiNew_GetRailDirection(parent->path.parent->parent->parent->node.tile, parent->path.parent->parent->node.tile, parent->path.parent->node.tile);

   496

					// Check if we changed 3 tiles of direction in 3 tiles.. bad!!!

   497

					if ((dir1 == 0 || dir1 == 1) && dir2 > 1 && (dir3 == 0 || dir3 == 1)) {

   498

						res += AI_PATHFINDER_CURVE_PENALTY;

   499

					}

   500

				}

   501

			}

   502

		}

   503

	}

   504

   505

	return (res < 0) ? 0 : res;

   506

}