University of Cambridge > Talks.cam > Combinatorics Seminar > Generalised Knight Tours

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Generalised Knight Tours

Download to your calendar using vCal

  • UserNikolai Beluhov (Stara Zagora)
  • ClockThursday 28 November 2019, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason .

The classical knight tour problem extends naturally to generalised knights, which move by leaping $p$ units along one coordinate axis and $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 every cell. A well-known conjecture is that every generalised knight has a Hamiltonian cycle on some rectangular chessboard. We prove this conjecture. We also determine the smallest square chessboard with this property, whose side-length was first conjectured to be $2(p + q)$ by T. H. Willcocks in 1976.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

The Castle Inn (moved due to strike action) McCrum Lecture Theatre, Bene't Street, Next to the Eagle Pub LT0

Other talks

Illegal trade in the North Atlantic Talk TBC "Gods, Monsters & Middle-class Uncles: Indian Comics in a Time between Worlds" Toward affordable preventive healthcare The Gardens of the Western Cape Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity