COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Generalised Knight ToursAdd to your list(s) Download to your calendar using vCal - Nikolai Beluhov (Stara Zagora)
- Thursday 28 November 2019, 14:30-15:30
- MR12.
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:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Interested Talks
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsTagliaferri Lecture Álgebra linear Operations Group Seminar Series## Other talksRotation Invariant Householder Parameterization for Bayesian PCA Human Origins Constraining models of warm and self-interacting dark matter with quadruple-image strong gravitational lenses Prevention of mental illness in the adolescent years Mobile Knowledges before the Classics (Global Imaginaries through the Ages) ENGINEERING THE A14 - THE CHALLENGES OF THE CAMBRIDGE TO HUNTINGDON, ROAD IMPROVEMENT SCHEME |