Python implementation to solve Knight's tour
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
.gitignore
README.md
knights.py
tree.py

README.md

KNIGHT'S TOUR

Python implementation to solve http://en.wikipedia.org/wiki/Knight's_tour

Uses Warnsdorff's algorithm to solve it.

Quick streetcar coding implementation so could probably benefit from some optimisations and enhancements