Library Home || Full Table of Contents || Suggest a Link || Library Help
|Describes two methods for finding Knight's Tours (paths for a chess knight to visit every square on a chessboard), backtracking and Warnsdorff's Rule. Java applets demonstrate both methods.|
|Levels:||High School (9-12), College|
|Resource Types:||Games, Web Interactive/Java|
|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.