Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-14T07:30:13.894Z Has data issue: false hasContentIssue false
  • English
  • Français

The knight’s tour

Published online by Cambridge University Press:  01 August 2016

Robert Cannon  and
Stan Dolan
Robert Cannon
Affiliation:
Kingswood School, Bath, Avon BA1 5RG
Stan Dolan
Affiliation:
Kingswood School, Bath, Avon BA1 5RG
Get access Rights & Permissions [Opens in a new window]

Extract

The classical problem of the knight’s tour consists of moving a knight over a chess board in such a manner that it moves successively on to every possible square once and only once. If the initial and final squares of this tour are a knight’s move away from each other, then for obvious reasons the tour is termed re-entrant. The problem has a long and interesting history. Solutions due to De Moivre, Euler, Vandermonde, Warnsdorff and Roget, together with further references can be found in [1].

Type
Research Article
Information
The Mathematical Gazette , Volume 70 , Issue 452 , June 1986 , pp. 91 - 100
Copyright
Copyright © Mathematical Association 1986

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Ball, W. W. R., Mathematical recreations and essays, Macmillan and Co. Google Scholar