BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Generalised Knight Tours - Nikolai Beluhov (Stara Zagora)
DTSTART:20191128T143000Z
DTEND:20191128T153000Z
UID:TALK128866@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:The classical knight tour problem extends naturally to general
 ised knights\, which move by leaping $p$ units along one coordinate axis a
 nd $q$ units along the other. We require that $p + q$ is odd and that $p$ 
 and $q$ are coprime\, as otherwise the generalised knight cannot reach\nev
 ery cell. A well-known conjecture is that every generalised knight has a H
 amiltonian cycle on some rectangular chessboard. We prove this conjecture.
  We also determine the smallest square chessboard with this property\, who
 se side-length was first conjectured to be $2(p + q)$ by T. H. Willcocks i
 n 1976.
LOCATION:MR12
END:VEVENT
END:VCALENDAR