The Distribution of the Knight
Library Home 
Full Table of Contents 
Suggest a Link 
Library Help
http://www.tri.org.au/knightframe.html  


the Theoretical Research Institute  
For every given starting point in the knight's tour problem, evaluate every possible path that visits each square exactly once, and then count how many solutions exist. Illustrations and calculations of the distribution of solutions and dead ends across a chess board, for all chess boards with 32 or fewer squares. Mathematica source code and related links available.  


Levels:  High School (912), College, Research 
Languages:  English 
Resource Types:  Problems/Puzzles, Mathematica 
Math Topics:  Graph Theory 
[Privacy Policy] [Terms of Use]
© 1994 The Math Forum at NCTM. All rights reserved.
http://mathforum.org/