The Distribution of the Knight
Library Home || Full Table of Contents || Suggest a Link || Library Help
|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 (9-12), College, Research|
|Resource Types:||Problems/Puzzles, Mathematica|
|Math Topics:||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.