An experiment writen in Python to check how many moves a knight needs to get around a chessboard.
-
Updated
Sep 26, 2022 - Python
#
knight-shortest-path
Here are 3 public repositories matching this topic...
Given a chess board setup up with initial knight position and destination, it finds the shortest path (minimum number of steps) for the knight to another position (destination) on the board.
-
Updated
Dec 17, 2017 - Ruby
Knight's Shortest Path Problem
-
Updated
Feb 8, 2022 - Java
Improve this page
Add a description, image, and links to the knight-shortest-path topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the knight-shortest-path topic, visit your repo's landing page and select "manage topics."