knight's tour

chess mathematic

The "knight's tour" is a classic problem in chess and graph theory, challenging players and mathematicians alike to cover every square on a board with a knight's unique move.

🇺🇸 US Voice:

🇬🇧 UK Voice:

Definition

C1Chess

(technical)A sequence of knight moves on a chessboard that visits each square exactly once.

Example

Completing a knight's tour on a standard chessboard is a challenging puzzle.

C1Graph Theory

(technical, academic)A problem involving a knight's movement on a board, aiming to visit every square without repetition.

Example

In graph theory, a knight's tour is studied as a Hamiltonian path problem.