Skip to content

A simple program that implements and visualizes Warnsdoff's algorthim for the Knight Tour.

License

Notifications You must be signed in to change notification settings

anjolaolubusi/Knight-Tour-Warnsdorff

Repository files navigation

Knight-Tour-Warnsdorff

Knight-Tour-Warnsdorff is an implementation and visualization of the Warnsdorff algorithm of the Knight Tour Problem. To explain briefly, a knight's tour is a sequences of moves that a knight can make to visit each square once. The Warnsdorff algorithm works by making the knight move to the square with the least onwards moves.

Building and Running

pip install -r requirements.txt

or

pip3 install -r requirements.txt

Once finished, you can run the project by typing:

python main.py

Built with

Authors

Acknowledgments

  • Warnsdorff for his Warnsdorff's algorithm.
  • Arnd Roth for his improvements to the Warnsdorff's algorithm

Releases

No releases published

Packages

No packages published

Languages