A **knight’s tour** is a sequence of moves of a knight on a chessboard such that the knight visits every square only once.

It is an interesting chess puzzle that starts by removing all chess pieces from a chess board and leaving just one knight on any of the 64 squares. The puzzle involves trying to make the knight jump around the board and eventually land on all 64 squares without landing on a square already visited.

The **knight’s tour problem** is the mathematical problem of finding a knight’s tour. Creating a program to find a knight’s tour is a common problem given to computer science students.

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 has been presented as an elaborate poetic figure (“citra-alaṅkāra”) called the “turagapadabandha” or ‘arrangement in the steps of a horse.’

Below is a very good video describing the knight’s tour problem from a mathematics perspective.

You must be logged in to post a comment.