The Problem of the Knight: A Fast and Simple Algorithm
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Download a Mathematica notebook that discusses different algorithms for solving the Knight's Tour problem, finding a path for the chess knight that visits every square once. For an Introduction, Implementation, and Examples, visit Roth's Max-Planck-Institut site.|
|Levels:||High School (9-12), College|
|Resource Types:||Games, Mathematica|
|Math Topics:||Algorithms, Graph Theory|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.