1 gen 800 anni - The Knight's Tour - First Known Example

Descrizione:

A Knight's tour is a type of chess puzzle or problem in which you move the knight so it visits every square of the chessboard just once.

If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed (or re-entrant); otherwise, it is open.

The earliest known reference to the knight's tour problem dates back to the 9th century AD. In Rudraṭa's Kavyalankara, a Sanskrit work on Poetics, the pattern of a knight's tour on a half-board.