graph search algorithm - BFS

In this problem you are going to find out the shortest path between two cells of a chess board for a knight. I don't know how, but you have to prove that in a 8x8 chess board if you place a knight in a cell then it can reach any cell you want. So the shortest path problem works here.

The neighbors of a cell are these cells, if the cell is (x, y):

(x+1, y+2)

(x+1, y-2)

(x-1, y+2)

(x-1, y-2)

(x+2, y+1)

(x+2, y-1)

(x-2, y+1)

(x-2, y-1)

## No comments:

## Post a Comment