Question

Problem 3: Consider a 8x8 chess board, where the rows and columns are numbered from 0 to 7. The problem is to find a route across the diagonal of the board. The movement can be done similar to the king, i.e. one tile at a time, in any direction. The start position is (0,0) while the goal tile id (7,7). There are certain barriers which occupy certain tiles on the board. Moving into any empty tile costs 1, while moving into a barrier costs 100. The barrier is at following positions, marked as B: B B B B B B B B B B B B Implement A* search algorithm to find out the route with the lowest cost (Multiple optimal solutions possible). Store the optimal route and cost of the route in a text file. Note: Using zero heuristic is considered as Dijkstra's algorithm, so not allowed.

          Problem 3:
Consider a 8x8 chess board, where the rows and columns are numbered from 0 to 7. The
problem is to find a route across the diagonal of the board. The movement can be done similar
to the king, i.e. one tile at a time, in any direction. The start position is (0,0) while the goal tile id
(7,7). There are certain barriers which occupy certain tiles on the board. Moving into any empty
tile costs 1, while moving into a barrier costs 100.
The barrier is at following positions, marked as B:
B
B
B
B
B
B
B
B
B
B
B
B
Implement A* search algorithm to find out the route with the lowest cost (Multiple optimal solutions
possible). Store the optimal route and cost of the route in a text file.
Note: Using zero heuristic is considered as Dijkstra's algorithm, so not allowed.

Problem 3:
Consider a 8x8 chess board, where the rows and columns are numbered from 0 to 7. The
problem is to find a route across the diagonal of the board. The movement can be done similar
to the king, i.e. one tile at a time, in any direction. The start position is (0,0) while the goal tile id
(7,7). There are certain barriers which occupy certain tiles on the board. Moving into any empty
tile costs 1, while moving into a barrier costs 100.
The barrier is at following positions, marked as B:
B
B
B
B
B
B
B
B
B
B
B
B
Implement A* search algorithm to find out the route with the lowest cost (Multiple optimal solutions
possible). Store the optimal route and cost of the route in a text file.
Note: Using zero heuristic is considered as Dijkstra's algorithm, so not allowed.

Added by Betty G.

Question

Please give Ace some feedback