Using bfs, find the sortest path for a knight to pass in a Chessboard NxN from (x,y) to (w,z)
djvita / bfs-knight-shortest-path Goto Github PK
View Code? Open in Web Editor NEWUsing bfs, find the sortest path for a knight to pass in a Chessboard NxN from (x,y) to (w,z)