Knight Paths

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

The path displayed on the board is the shortest path for the knight to take from its starting square to the X, avoiding the pawns. When you click the board, the new path begins at the previous destination X and ends at the newly selected square. Although there may be other paths of the same length, there is never any path shorter than the displayed path.

Contributed by: Taylor McCreary (July 2013)
(Mathematica Summer Camp 2013)
Open content licensed under CC BY-NC-SA


Snapshots


Details

To find the shortest path, the Demonstration takes the square the knight is on and uses it to create a graph of all of the paths the knight can take, removing any paths that connect to squares containing pawns. Then the Demonstration calls Mathematica's built-in FindShortestPath function to find the path the knight should take and finds those squares on the chessboard to output the highlighted path. The graph of the knight's paths changes every time a new pawn configuration is created.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send