Tile_coord *result = new Tile_coord[cnt]; result[cnt - 1] = Tile_coord(-1, -1, -1);
Tile_coord *result = new Tile_coord[cnt - 1]; result[cnt - 2] = Tile_coord(-1, -1, -1);
	Tile_coord *create_path()	// Create path back to start, ending					//   with Tile_coord(-1, -1, -1).		{		int cnt = 2;		// This, and fake after it.					// Count back to start.		Search_node *each = this;		while ((each = each->parent) != 0)			cnt++;		Tile_coord *result = new Tile_coord[cnt];		result[cnt - 1] = Tile_coord(-1, -1, -1);		each = this;		for (int i = cnt - 2; i >= 0; i--)			{			result[i] = each->tile;			each = each->parent;			}		return result;		}