Skip to content

My implementation of the knightMove function which uses recursion to get the shortest path between two points on a chess board using the movement pattern of the knight piece.

Notifications You must be signed in to change notification settings

Beschuetzer/Knight-s-Tour-Problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 

Repository files navigation

Knight's Tour Problem

My implementation of the knightMove function which uses recursion to get the shortest path between two points using the movement pattern of the knight chess piece.

About

My implementation of the knightMove function which uses recursion to get the shortest path between two points on a chess board using the movement pattern of the knight piece.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published