1

/* $Id$ */

     2

     3

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

     4

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

     5

#include "../../bridge_map.h"

     6

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

     7

#include "../../command_func.h"

     8

#include "trolly.h"

     9

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

    10

#include "../../tunnel_map.h"

    11

#include "../../bridge.h"

    12

#include "../../tunnelbridge_map.h"

    13

#include "../ai.h"

    14

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

    15

#include "../../player_base.h"

    16

#include "../../player_func.h"

    18

    19

    20

#define TEST_STATION_NO_DIR 0xFF

    21

    22

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

    23

// TODO: make it train compatible

    24

static bool TestCanBuildStationHere(TileIndex tile, byte dir)

    25

{

    26

	Player *p = GetPlayer(_current_player);

    27

    28

	if (dir == TEST_STATION_NO_DIR) {

    29

		CommandCost ret;

    30

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

    31

		//  should be fixed!!!

    32

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

    33

			ret = AiNew_Build_Station(p, _players_ainew[p->index].tbt, tile, 1, 1, dir, DC_QUERY_COST);

    34

			if (CmdSucceeded(ret)) return true;

    35

		}

    36

		return false;

    37

	}

    38

    39

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

    40

	return CmdSucceeded(AiNew_Build_Station(p, _players_ainew[p->index].tbt, tile, 1, 1, dir, DC_QUERY_COST));

    41

}

    42

    43

    44

static bool IsRoad(TileIndex tile)

    45

{

    46

	return

    47

		// MP_ROAD, but not a road depot?

    48

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

    49

		(IsTileType(tile, MP_TUNNELBRIDGE) && GetTunnelBridgeTransportType(tile) == TRANSPORT_ROAD);

    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

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

    61

    62

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

    63

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

    64

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

    65

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

    66

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

    67

				return AYSTAR_FOUND_END_NODE;

    68

    69

	return AYSTAR_DONE;

    70

}

    71

    72

    73

// Calculates the hash

    74

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

    75

static uint AiPathFinder_Hash(uint key1, uint key2)

    76

{

    77

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

    78

}

    79

    80

    81

// Clear the memory of all the things

    82

static void AyStar_AiPathFinder_Free(AyStar *aystar)

    83

{

    84

	AyStarMain_Free(aystar);

    85

	delete aystar;

    86

}

    87

    88

    89

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

    90

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

    91

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

    92

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

    93

    94

    95

// This creates the AiPathFinder

    96

AyStar *new_AyStar_AiPathFinder(int max_tiles_around, Ai_PathFinderInfo *PathFinderInfo)

    97

{

    98

	PathNode start_node;

    99

	uint x;

   100

	uint y;

   101

	// Create AyStar

   102

	AyStar *result = new AyStar();

   103

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

   104

	// Set the function pointers

   105

	result->CalculateG = AyStar_AiPathFinder_CalculateG;

   106

	result->CalculateH = AyStar_AiPathFinder_CalculateH;

   107

	result->EndNodeCheck = AyStar_AiPathFinder_EndNodeCheck;

   108

	result->FoundEndNode = AyStar_AiPathFinder_FoundEndNode;

   109

	result->GetNeighbours = AyStar_AiPathFinder_GetNeighbours;

   110

   111

	result->free = AyStar_AiPathFinder_Free;

   112

   113

	// Set some information

   114

	result->loops_per_tick = AI_PATHFINDER_LOOPS_PER_TICK;

   115

	result->max_path_cost = 0;

   116

	result->max_search_nodes = AI_PATHFINDER_MAX_SEARCH_NODES;

   117

   118

	// Set the user_data to the PathFinderInfo

   119

	result->user_target = PathFinderInfo;

   120

   121

	// Set the start node

   122

	start_node.parent = NULL;

   123

	start_node.node.direction = 0;

   124

	start_node.node.user_data[0] = 0;

   125

   126

	// Now we add all the starting tiles

   127

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

   128

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

   129

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

   130

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

   131

		}

   132

	}

   133

   134

	return result;

   135

}

   136

   137

   138

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

   139

void clean_AyStar_AiPathFinder(AyStar *aystar, Ai_PathFinderInfo *PathFinderInfo)

   140

{

   141

	PathNode start_node;

   142

	uint x;

   143

	uint y;

   144

   145

	aystar->clear(aystar);

   146

   147

	// Set the user_data to the PathFinderInfo

   148

	aystar->user_target = PathFinderInfo;

   149

   150

	// Set the start node

   151

	start_node.parent = NULL;

   152

	start_node.node.direction = 0;

   153

	start_node.node.user_data[0] = 0;

   154

	start_node.node.tile = PathFinderInfo->start_tile_tl;

   155

   156

	// Now we add all the starting tiles

   157

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

   158

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

   159

			TileIndex tile = TileXY(x, y);

   160

   161

			if (!IsTileType(tile, MP_CLEAR) && !IsTileType(tile, MP_TREES)) continue;

   162

			if (!TestCanBuildStationHere(tile, TEST_STATION_NO_DIR)) continue;

   163

			start_node.node.tile = tile;

   164

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

   165

		}

   166

	}

   167

}

   168

   169

   170

// The h-value, simple calculation

   171

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

   172

{

   173

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

   174

	int r, r2;

   175

   176

	if (PathFinderInfo->end_direction != AI_PATHFINDER_NO_DIRECTION) {

   177

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

   178

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

   179

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

   180

	} else {

   181

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

   182

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

   183

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

   184

	}

   185

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

   186

	if (r2 < r) r = r2;

   187

	return r * AI_PATHFINDER_H_MULTIPLER;

   188

}

   189

   190

   191

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

   192

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

   193

{

   194

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

   195

	uint i = 0;

   196

	PathNode *parent = &current->path;

   197

   198

	do {

   199

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

   200

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

   201

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

   202

			// We ran out of space for the PathFinder

   203

			DEBUG(ai, 0, "No more space in pathfinder route[] array");

   204

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

   205

			return;

   206

		}

   207

		parent = parent->parent;

   208

	} while (parent != NULL);

   209

	PathFinderInfo->route_length = i;

   210

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

   211

}

   212

   213

   214

// What tiles are around us.

   215

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

   216

{

   217

	CommandCost ret;

   218

	int dir;

   219

   220

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

   221

   222

	aystar->num_neighbours = 0;

   223

   224

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

   225

	for (DiagDirection i = DIAGDIR_BEGIN; i < DIAGDIR_END; i++) {

   226

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

   227

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

   228

   229

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

   230

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

   231

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

   232

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

   233

   234

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

   235

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

   236

				if (IsTileType(atile, MP_TUNNELBRIDGE)) {

   237

					if (GetTunnelBridgeDirection(atile) != i) continue;

   238

				}

   239

			}

   240

   241

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

   242

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

   243

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

   244

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

   245

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

   246

			}

   247

			dir = 0;

   248

   249

			// First, check if we have a parent

   250

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

   251

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

   252

				if (PathFinderInfo->start_direction != AI_PATHFINDER_NO_DIRECTION) {

   253

					// We do need a direction?

   254

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

   255

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

   256

						continue;

   257

					}

   258

				}

   259

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

   260

				if (PathFinderInfo->rail_or_road) {

   261

					// Rail check

   262

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

   263

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

   264

					if (CmdFailed(ret)) continue;

   265

#ifdef AI_PATHFINDER_NO_90DEGREES_TURN

   266

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

   267

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

   268

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

   269

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

   270

							continue;

   271

						}

   272

					}

   273

#endif

   274

				} else {

   275

					// Road check

   276

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

   277

					if (IsRoad(ctile)) {

   278

						if (IsTileType(ctile, MP_TUNNELBRIDGE)) {

   279

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

   280

							dir = 0;

   281

						} else {

   282

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

   283

							if ((GetAnyRoadBits(ctile, ROADTYPE_ROAD) & dir) != dir) {

   284

								// We do miss some pieces :(

   285

								dir &= ~GetAnyRoadBits(ctile, ROADTYPE_ROAD);

   286

							} else {

   287

								dir = 0;

   288

							}

   289

						}

   290

					}

   291

					// Only destruct things if it is MP_CLEAR of MP_TREES

   292

					if (dir != 0) {

   293

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

   294

						if (CmdFailed(ret)) continue;

   295

					}

   296

				}

   297

			}

   298

   299

			// The tile can be connected

   300

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

   301

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

   302

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

   303

		}

   304

	}

   305

   306

	// Next step, check for bridges and tunnels

   307

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

   308

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

   309

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

   310

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

   311

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

   312

		TileIndex new_tile = tile;

   313

		Slope tileh = GetTileSlope(tile, NULL);

   314

   315

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

   316

		//  And if there is a road or rail blocking

   317

		if (tileh != SLOPE_FLAT ||

   318

				(PathFinderInfo->rail_or_road && IsTileType(tile + TileOffsByDiagDir(dir), MP_ROAD)) ||

   319

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

   320

			for (;;) {

   321

				new_tile += TileOffsByDiagDir(dir);

   322

   323

				// Precheck, is the length allowed?

   325

   326

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

   327

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

   328

   329

				// Try building the bridge..

   330

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

   331

				if (CmdFailed(ret)) continue;

   332

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

   333

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

   334

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

   335

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

   336

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

   337

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

   338

			}

   339

		}

   340

   341

		// Next, check for tunnels!

   342

		// Tunnels can only be built on slopes corresponding to the direction

   343

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

   345

			// Now simply check if a tunnel can be build

   346

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

   347

			tileh = GetTileSlope(_build_tunnel_endtile, NULL);

   349

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

   350

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

   351

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

   352

			}

   353

		}

   354

	}

   355

}

   356

   357

   358

extern Foundation GetRailFoundation(Slope tileh, TrackBits bits); // XXX function declaration in .c

   359

extern Foundation GetRoadFoundation(Slope tileh, RoadBits bits); // XXX function declaration in .c

   360

   361

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

   362

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

   363

{

   364

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

   365

	int res = 0;

   366

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

   367

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

   368

   369

	// Check if we hit the end-tile

   370

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

   371

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

   372

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

   373

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

   374

			return AYSTAR_INVALID_NODE;

   375

		}

   376

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

   377

		return 0;

   378

	}

   379

   380

	// Give everything a small penalty

   381

	res += AI_PATHFINDER_PENALTY;

   382

   383

	if (!PathFinderInfo->rail_or_road) {

   384

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

   385

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

   386

		if (IsRoad(current->tile)) {

   387

			res -= AI_PATHFINDER_ROAD_ALREADY_EXISTS_BONUS;

   388

		}

   389

	}

   390

   391

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

   392

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

   393

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

   394

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

   395

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

   396

	//  from one side.

   397

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

   398

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

   399

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

   400

			if (PathFinderInfo->rail_or_road) {

   401

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

   403

					res += AI_PATHFINDER_TILE_GOES_UP_PENALTY;

   404

				} else {

   405

					res += AI_PATHFINDER_FOUNDATION_PENALTY;

   406

				}

   407

			} else {

   408

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

   409

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

   411

						res += AI_PATHFINDER_TILE_GOES_UP_PENALTY;

   412

					} else {

   413

						res += AI_PATHFINDER_FOUNDATION_PENALTY;

   414

					}

   415

				}

   416

			}

   417

		}

   418

	}

   419

   420

	// Are we part of a tunnel?

   421

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

   422

		int r;

   423

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

   424

		// Ironicly, we are using BridgeCode here ;)

   426

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

   427

	}

   428

   429

	// Are we part of a bridge?

   430

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

   431

		// That means for every length a penalty

   433

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

   434

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

   435

		if (!HasBridgeFlatRamp(parent_tileh, (Axis)((current->user_data[0] >> 8) & 1))) res += AI_PATHFINDER_BRIDGE_GOES_UP_PENALTY;

   436

		// Second for the end point

   437

		if (!HasBridgeFlatRamp(tileh, (Axis)((current->user_data[0] >> 8) & 1))) res += AI_PATHFINDER_BRIDGE_GOES_UP_PENALTY;

   438

	}

   439

   440

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

   441

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

   442

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

   443

	if (!PathFinderInfo->rail_or_road) {

   444

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

   445

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

   446

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

   447

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

   448

				res += AI_PATHFINDER_DIRECTION_CHANGE_ON_EXISTING_ROAD_PENALTY;

   449

			} else {

   450

				res += AI_PATHFINDER_DIRECTION_CHANGE_PENALTY;

   451

			}

   452

		}

   453

	} else {

   454

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

   455

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

   456

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

   457

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

   458

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

   459

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

   460

			if (dir1 > 1) res -= AI_PATHFINDER_DIAGONAL_BONUS;

   461

   462

			// First see if they are different

   463

			if (dir1 != dir2) {

   464

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

   465

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

   466

					// It is not, so we changed of direction

   467

					res += AI_PATHFINDER_DIRECTION_CHANGE_PENALTY;

   468

				}

   469

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

   470

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

   471

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

   472

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

   473

						res += AI_PATHFINDER_CURVE_PENALTY;

   474

					}

   475

				}

   476

			}

   477

		}

   478

	}

   479

   480

	return (res < 0) ? 0 : res;

   481

}