1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "debug.h"

     4

#include "map.h"

     5

#include "tile.h"

     6

#include "command.h"

     7

#include "ai.h"

     8

#include "depot.h"

     9

    10

#define TEST_STATION_NO_DIR 0xFF

    11

    12

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

    13

// TODO: make it train compatible

    14

static bool TestCanBuildStationHere(uint tile, byte dir)

    15

{

    16

	Player *p = DEREF_PLAYER(_current_player);

    17

    18

	if (dir == TEST_STATION_NO_DIR) {

    19

		int32 ret;

    20

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

    21

		//  should be fixed!!!

    22

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

    23

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

    24

			if (!CmdFailed(ret)) return true;

    25

		}

    26

		return false;

    27

	}

    28

    29

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

    30

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

    31

}

    32

    33

    34

static bool IsRoad(TileIndex tile)

    35

{

    36

	return

    37

		// MP_STREET, but not a road depot?

    38

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

    39

		(IsTileType(tile, MP_TUNNELBRIDGE) && (

    40

			// road tunnel?

    41

			((_map5[tile] & 0x80) == 0 && (_map5[tile] & 0x4) == 0x4) ||

    42

			// road bridge?

    43

			((_map5[tile] & 0x80) != 0 && (_map5[tile] & 0x2) == 0x2)

    44

		));

    45

}

    46

    47

    48

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

    49

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

    50

    51

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

    52

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

    53

{

    54

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

    55

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

    56

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

    57

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

    58

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

    59

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

    60

	return AYSTAR_FOUND_END_NODE;

    61

    62

	return AYSTAR_DONE;

    63

}

    64

    65

// Calculates the hash

    66

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

    67

static uint AiPathFinder_Hash(uint key1, uint key2)

    68

{

    69

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

    70

}

    71

    72

// Clear the memory of all the things

    73

static void AyStar_AiPathFinder_Free(AyStar *aystar)

    74

{

    75

	AyStarMain_Free(aystar);

    76

	free(aystar);

    77

}

    78

    79

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

    80

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

    81

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

    82

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

    83

    84

// This creates the AiPathFinder

    85

AyStar *new_AyStar_AiPathFinder(int max_tiles_around, Ai_PathFinderInfo *PathFinderInfo) {

    86

	PathNode start_node;

    87

	uint x,y;

    88

	// Create AyStar

    89

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

    90

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

    91

	// Set the function pointers

    92

	result->CalculateG = AyStar_AiPathFinder_CalculateG;

    93

	result->CalculateH = AyStar_AiPathFinder_CalculateH;

    94

	result->EndNodeCheck = AyStar_AiPathFinder_EndNodeCheck;

    95

	result->FoundEndNode = AyStar_AiPathFinder_FoundEndNode;

    96

	result->GetNeighbours = AyStar_AiPathFinder_GetNeighbours;

    97

    98

	result->free = AyStar_AiPathFinder_Free;

    99

   100

	// Set some information

   101

	result->loops_per_tick = AI_PATHFINDER_LOOPS_PER_TICK;

   102

	result->max_path_cost = 0;

   103

	result->max_search_nodes = AI_PATHFINDER_MAX_SEARCH_NODES;

   104

   105

	// Set the user_data to the PathFinderInfo

   106

	result->user_target = PathFinderInfo;

   107

   108

	// Set the start node

   109

	start_node.parent = NULL;

   110

	start_node.node.direction = 0;

   111

	start_node.node.user_data[0] = 0;

   112

   113

	// Now we add all the starting tiles

   114

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

   115

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

   116

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

   117

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

   118

		}

   119

	}

   120

   121

	return result;

   122

}

   123

   124

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

   125

void clean_AyStar_AiPathFinder(AyStar *aystar, Ai_PathFinderInfo *PathFinderInfo) {

   126

	PathNode start_node;

   127

	uint x,y;

   128

   129

	aystar->clear(aystar);

   130

   131

	// Set the user_data to the PathFinderInfo

   132

	aystar->user_target = PathFinderInfo;

   133

   134

	// Set the start node

   135

	start_node.parent = NULL;

   136

	start_node.node.direction = 0;

   137

	start_node.node.user_data[0] = 0;

   138

	start_node.node.tile = PathFinderInfo->start_tile_tl;

   139

   140

	// Now we add all the starting tiles

   141

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

   142

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

   143

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

   144

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

   145

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

   146

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

   147

		}

   148

	}

   149

}

   150

   151

// The h-value, simple calculation

   152

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

   153

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

   154

	int r, r2;

   155

	if (PathFinderInfo->end_direction != AI_PATHFINDER_NO_DIRECTION) {

   156

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

   157

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

   158

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

   159

	} else {

   160

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

   161

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

   162

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

   163

	}

   164

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

   165

	if (r2 < r) r = r2;

   166

	return r * AI_PATHFINDER_H_MULTIPLER;

   167

}

   168

   169

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

   170

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

   171

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

   172

	uint i = 0;

   173

	PathNode *parent = &current->path;

   174

   175

	do {

   176

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

   177

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

   178

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

   179

			// We ran out of space for the PathFinder

   180

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

   181

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

   182

			return;

   183

		}

   184

		parent = parent->parent;

   185

	} while (parent != NULL);

   186

	PathFinderInfo->route_length = i;

   187

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

   188

}

   189

   190

// What tiles are around us.

   191

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

   192

	uint i;

   193

	int ret;

   194

	int dir;

   195

   196

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

   197

   198

	aystar->num_neighbours = 0;

   199

   200

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

   201

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

   209

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

   210

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

   211

   212

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

   215

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

   217

					// This problem only is valid for tunnels:

   218

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

   221

					}

   222

				}

   223

			}

   224

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

   227

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

   229

				}

   230

			}

   231

   232

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

   233

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

   234

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

   235

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

   236

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

   237

			}

   238

			dir = 0;

   239

   240

			// First, check if we have a parent

   241

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

   242

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

   243

				if (PathFinderInfo->start_direction != AI_PATHFINDER_NO_DIRECTION) {

   244

					// We do need a direction?

   246

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

   247

						continue;

   248

					}

   249

				}

   250

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

   251

				if (PathFinderInfo->rail_or_road) {

   252

					// Rail check

   255

					if (CmdFailed(ret)) continue;

   256

#ifdef AI_PATHFINDER_NO_90DEGREES_TURN

   257

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

   258

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

   260

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

   261

							continue;

   262

						}

   263

					}

   264

#endif

   265

				} else {

   266

					// Road check

   270

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

   271

							dir = 0;

   272

						} else {

   273

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

   275

								// We do miss some pieces :(

   277

							} else {

   278

								dir = 0;

   279

							}

   280

						}

   281

					}

   282

					// Only destruct things if it is MP_CLEAR of MP_TREES

   283

					if (dir != 0) {

   285

						if (CmdFailed(ret)) continue;

   286

					}

   287

				}

   288

			}

   289

   290

			// The tile can be connected

   292

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

   293

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

   294

		}

   295

	}

   296

   297

	// Next step, check for bridges and tunnels

   298

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

   299

   300

		TileInfo ti;

   301

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

   302

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

   303

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

   304

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

   305

		TileIndex new_tile = tile;

   306

   307

		FindLandscapeHeightByTile(&ti, tile);

   308

   309

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

   310

		//  And if there is a road or rail blocking

   311

		if (ti.tileh != 0 ||

   312

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

   313

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

   314

   315

			for (;;) {

   316

				new_tile += TileOffsByDir(dir);

   317

   318

				// Precheck, is the length allowed?

   319

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

   320

   321

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

   322

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

   323

   324

				// Try building the bridge..

   325

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

   326

				if (CmdFailed(ret)) continue;

   327

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

   328

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

   329

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

   330

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

   331

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

   332

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

   333

			}

   334

		}

   335

   336

		// Next, check for tunnels!

   337

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

   338

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

   339

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

   340

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

   341

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

   342

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

   343

			// Now simply check if a tunnel can be build

   344

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

   345

			FindLandscapeHeightByTile(&ti, _build_tunnel_endtile);

   346

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

   347

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

   348

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

   349

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

   350

			}

   351

		}

   352

	}

   353

}

   354

   355

extern uint GetRailFoundation(uint tileh, uint bits);

   356

extern uint GetRoadFoundation(uint tileh, uint bits);

   357

extern uint GetBridgeFoundation(uint tileh, byte direction);

   358

enum {

   359

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

   360

};

   361

   362

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

   363

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

   364

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

   365

	int r, res = 0;

   366

	TileInfo ti, parent_ti;

   367

   368

	// Gather some information about the tile..

   369

	FindLandscapeHeightByTile(&ti, current->tile);

   370

	FindLandscapeHeightByTile(&parent_ti, parent->path.node.tile);

   371

   372

	// Check if we hit the end-tile

   373

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

   374

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

   375

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

   376

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

   377

			return AYSTAR_INVALID_NODE;

   378

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

   379

		return 0;

   380

	}

   381

   382

	// Give everything a small penalty

   383

	res += AI_PATHFINDER_PENALTY;

   384

   385

	if (!PathFinderInfo->rail_or_road) {

   386

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

   387

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

   388

		if (IsRoad(current->tile)) {

   389

			res -= AI_PATHFINDER_ROAD_ALREADY_EXISTS_BONUS;

   390

		}

   391

	}

   392

   393

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

   394

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

   395

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

   396

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

   397

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

   398

	//  from one side.

   399

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

   400

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

   401

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

   402

			if (PathFinderInfo->rail_or_road) {

   403

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

   404

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

   405

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

   406

					res += AI_PATHFINDER_TILE_GOES_UP_PENALTY;

   407

				} else {

   408

					res += AI_PATHFINDER_FOUNDATION_PENALTY;

   409

				}

   410

			} else {

   411

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

   412

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

   413

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

   414

						res += AI_PATHFINDER_TILE_GOES_UP_PENALTY;

   415

					else

   416

						res += AI_PATHFINDER_FOUNDATION_PENALTY;

   417

				}

   418

			}

   419

		}

   420

	}

   421

   422

	// Are we part of a tunnel?

   423

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

   424

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

   425

		// Ironicly, we are using BridgeCode here ;)

   426

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

   427

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

   428

	}

   429

   430

	// Are we part of a bridge?

   431

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

   432

		// That means for every length a penalty

   433

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

   434

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

   435

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

   436

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

   437

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

   438

				res += AI_PATHFINDER_BRIDGE_GOES_UP_PENALTY;

   439

		}

   440

		// Second for the end point

   441

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

   442

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

   443

				res += AI_PATHFINDER_BRIDGE_GOES_UP_PENALTY;

   444

		}

   445

		if (parent_ti.tileh == 0)

   446

			res += AI_PATHFINDER_BRIDGE_GOES_UP_PENALTY;

   447

		if (ti.tileh == 0)

   448

			res += AI_PATHFINDER_BRIDGE_GOES_UP_PENALTY;

   449

	}

   450

   451

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

   452

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

   453

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

   454

	if (!PathFinderInfo->rail_or_road) {

   455

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

   456

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

   457

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

   458

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

   459

				res += AI_PATHFINDER_DIRECTION_CHANGE_ON_EXISTING_ROAD_PENALTY;

   460

			else

   461

				res += AI_PATHFINDER_DIRECTION_CHANGE_PENALTY;

   462

		}

   463

	} else {

   464

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

   465

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

   466

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

   467

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

   468

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

   469

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

   470

			if (dir1 > 1) { res -= AI_PATHFINDER_DIAGONAL_BONUS; }

   471

   472

			// First see if they are different

   473

			if (dir1 != dir2) {

   474

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

   475

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

   476

					// It is not, so we changed of direction

   477

					res += AI_PATHFINDER_DIRECTION_CHANGE_PENALTY;

   478

				}

   479

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

   480

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

   481

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

   482

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

   483

						res += AI_PATHFINDER_CURVE_PENALTY;

   484

					}

   485

				}

   486

			}

   487

		}

   488

	}

   489