Generalised Euler's knight - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Preprints, Working Papers, ... Year : 1998

Generalised Euler's knight

Nicolas Beldiceanu
Eric Bourreau
Helmut Simonis
  • Function : Author
  • PersonId : 931450
Abderrahmane Aggoun
  • Function : Author


Euler, Vandermonde, Dudeney, Schwesk, Berliner, Conrad and many others already considered knight's tours on chessboards. The classical knight's tour problem consist of finding out on a N × M chessboard a sequence of legal knight moves that visit every cell exactly once and finish by returning to the initial cell. A more challenging question is to generalise the problem to more than one knight. More precisely, we search for a partitioning of the m x n chessboard by a set of C cycles in such a way that each cell belongs to one single cycle. Moreover we impose all the cycles to be balanced. Since a cycle can't have an odd number of cells, we enforce that each cycle visits between 2 x floor(floor((m x n) / c) / 2) and 2 x cell(cell((m x n) / c) / 2) cells. We systematically consider all the boards m x n such that 1
Fichier principal
Vignette du fichier
Bourreau EURO98 Technical Report m_knight.pdf (76.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-01079127 , version 1 (31-10-2014)


  • HAL Id : lirmm-01079127 , version 1


Nicolas Beldiceanu, Eric Bourreau, Helmut Simonis, Abderrahmane Aggoun. Generalised Euler's knight. 1998. ⟨lirmm-01079127⟩
263 View
271 Download


Gmail Facebook X LinkedIn More