1

/* $Id$ */

     2

     3

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

     4

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

     5

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

     6

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

     8

#include "trolly.h"

     9

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

    10

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

    11

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

    13

#include "../ai.h"

    18

    19

#define TEST_STATION_NO_DIR 0xFF

    20

    21

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

    22

// TODO: make it train compatible

    23

static bool TestCanBuildStationHere(TileIndex tile, byte dir)

    24

{

    25

	Player *p = GetPlayer(_current_player);

    26

    27

	if (dir == TEST_STATION_NO_DIR) {

    28

		CommandCost ret;

    29

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

    30

		//  should be fixed!!!

    31

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

    33

			if (CmdSucceeded(ret)) return true;

    34

		}

    35

		return false;

    36

	}

    37

    38

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

    40

}

    41

    42

    43

static bool IsRoad(TileIndex tile)

    44

{

    45

	return

    46

		// MP_ROAD, but not a road depot?

    47

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

    49

}

    50

    51

    52

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

    53

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

    54

    55

    56

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

    57

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

    58

{

    59

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

    60

    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

	delete 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 = new 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

			TileIndex tile = TileXY(x, y);

   159

   160

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

   161

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

   162

			start_node.node.tile = tile;

   163

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

   164

		}

   165

	}

   166

}

   167

   168

   169

// The h-value, simple calculation

   170

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

   171

{

   172

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

   173

	int r, r2;

   174

   175

	if (PathFinderInfo->end_direction != AI_PATHFINDER_NO_DIRECTION) {

   176

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

   177

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

   178

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

   179

	} else {

   180

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

   181

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

   182

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

   183

	}

   184

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

   185

	if (r2 < r) r = r2;

   186

	return r * AI_PATHFINDER_H_MULTIPLER;

   187

}

   188

   189

   190

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

   191

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

   192

{

   193

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

   194

	uint i = 0;

   195

	PathNode *parent = &current->path;

   196

   197

	do {

   198

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

   199

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

   200

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

   201

			// We ran out of space for the PathFinder

   202

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

   203

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

   204

			return;

   205

		}

   206

		parent = parent->parent;

   207

	} while (parent != NULL);

   208

	PathFinderInfo->route_length = i;

   209

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

   210

}

   211

   212

   213

// What tiles are around us.

   214

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

   215

{

   216

	CommandCost ret;

   217

	int dir;

   218

   219

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

   220

   221

	aystar->num_neighbours = 0;

   222

   223

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

   224

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

   225

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

   226

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

   227

   228

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

   229

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

   230

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

   231

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

   232

   233

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

   234

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

   235

				if (IsTileType(atile, MP_TUNNELBRIDGE)) {

   237

				}

   238

			}

   239

   240

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

   241

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

   242

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

   243

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

   244

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

   245

			}

   246

			dir = 0;

   247

   248

			// First, check if we have a parent

   249

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

   250

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

   251

				if (PathFinderInfo->start_direction != AI_PATHFINDER_NO_DIRECTION) {

   252

					// We do need a direction?

   253

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

   254

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

   255

						continue;

   256

					}

   257

				}

   258

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

   259

				if (PathFinderInfo->rail_or_road) {

   260

					// Rail check

   261

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

   262

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

   263

					if (CmdFailed(ret)) continue;

   264

#ifdef AI_PATHFINDER_NO_90DEGREES_TURN

   265

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

   266

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

   267

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

   268

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

   269

							continue;

   270

						}

   271

					}

   272

#endif

   273

				} else {

   274

					// Road check

   275

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

   276

					if (IsRoad(ctile)) {

   277

						if (IsTileType(ctile, MP_TUNNELBRIDGE)) {

   278

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

   279

							dir = 0;

   280

						} else {

   281

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

   282

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

   283

								// We do miss some pieces :(

   284

								dir &= ~GetAnyRoadBits(ctile, ROADTYPE_ROAD);

   285

							} else {

   286

								dir = 0;

   287

							}

   288

						}

   289

					}

   290

					// Only destruct things if it is MP_CLEAR of MP_TREES

   291

					if (dir != 0) {

   292

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

   293

						if (CmdFailed(ret)) continue;

   294

					}

   295

				}

   296

			}

   297

   298

			// The tile can be connected

   299

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

   300

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

   301

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

   302

		}

   303

	}

   304

   305

	// Next step, check for bridges and tunnels

   306

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

   307

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

   308

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

   309

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

   310

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

   311

		TileIndex new_tile = tile;

   312

		Slope tileh = GetTileSlope(tile, NULL);

   313

   314

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

   315

		//  And if there is a road or rail blocking

   316

		if (tileh != SLOPE_FLAT ||

   317

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

   318

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

   319

			for (;;) {

   320

				new_tile += TileOffsByDiagDir(dir);

   321

   322

				// Precheck, is the length allowed?

   323

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

   324

   325

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

   326

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

   327

   328

				// Try building the bridge..

   329

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

   330

				if (CmdFailed(ret)) continue;

   331

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

   332

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

   333

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

   334

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

   335

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

   336

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

   337

			}

   338

		}

   339

   340

		// Next, check for tunnels!

   341

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

   342

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

   343

		if ((dir == DIAGDIR_NE && tileh == SLOPE_NE) ||

   344

				(dir == DIAGDIR_SE && tileh == SLOPE_SE) ||

   345

				(dir == DIAGDIR_SW && tileh == SLOPE_SW) ||

   346

				(dir == DIAGDIR_NW && tileh == SLOPE_NW)) {

   347

			// Now simply check if a tunnel can be build

   348

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

   349

			tileh = GetTileSlope(_build_tunnel_endtile, NULL);

   350

			if (CmdSucceeded(ret) && (tileh == SLOPE_SW || tileh == SLOPE_SE || tileh == SLOPE_NW || tileh == SLOPE_NE)) {

   351

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

   352

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

   353

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

   354

			}

   355

		}

   356

	}

   357

}

   358

   359

   360

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

   361

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

   362

   363

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

   364

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

   365

{

   366

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

   367

	int res = 0;

   368

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

   369

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

   370

   371

	// Check if we hit the end-tile

   372

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

   373

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

   374

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

   375

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

   376

			return AYSTAR_INVALID_NODE;

   377

		}

   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_tileh != SLOPE_FLAT && 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) {

   403

			if (PathFinderInfo->rail_or_road) {

   404

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

   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

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

   414

						res += AI_PATHFINDER_TILE_GOES_UP_PENALTY;

   415

					} else {

   416

						res += AI_PATHFINDER_FOUNDATION_PENALTY;

   417

					}

   418

				}

   419

			}

   420

		}

   421

	}

   422

   423

	// Are we part of a tunnel?

   424

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

   425

		int r;

   426

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

   427

		// Ironicly, we are using BridgeCode here ;)

   428

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

   429

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

   430

	}

   431

   432

	// Are we part of a bridge?

   433

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

   434

		// That means for every length a penalty

   435

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

   436

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

   437

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

   439

		// Second for the end point

   441

	}

   442

   443

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

   444

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

   445

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

   446

	if (!PathFinderInfo->rail_or_road) {

   447

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

   448

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

   449

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

   450

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

   451

				res += AI_PATHFINDER_DIRECTION_CHANGE_ON_EXISTING_ROAD_PENALTY;

   452

			} else {

   453

				res += AI_PATHFINDER_DIRECTION_CHANGE_PENALTY;

   454

			}

   455

		}

   456

	} else {

   457

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

   458

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

   459

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

   460

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

   461

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

   462

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

   463

			if (dir1 > 1) res -= AI_PATHFINDER_DIAGONAL_BONUS;

   464

   465

			// First see if they are different

   466

			if (dir1 != dir2) {

   467

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

   468

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

   469

					// It is not, so we changed of direction

   470

					res += AI_PATHFINDER_DIRECTION_CHANGE_PENALTY;

   471

				}

   472

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

   473

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

   474

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

   475

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

   476

						res += AI_PATHFINDER_CURVE_PENALTY;

   477

					}

   478

				}

   479

			}

   480

		}

   481

	}