History of the game
A Brief History of the Knight's Tour
The idea begins with a simple challenge: can a knight visit every square once? Over centuries, poets, chess composers, and mathematicians found their own answers.
One move, every square
A chess knight moves two squares in one direction and one square at a right angle. A knight's tour asks the piece to visit every square on a board exactly once. If the final square is one knight's move from the starting square, the route can form a loop and is called a closed tour. Otherwise, it is an open tour. The rule is short, but the number of possible choices makes the problem surprisingly deep.3, 5
The example shown here uses a 4 × 8 board and follows an open knight's tour through all 32 positions.
A path through poetry
Long before the tour became a familiar mathematical puzzle, a related pattern appeared in Sanskrit poetry. Rudraṭa's ninth-century Kāvyālaṅkāra, a work on poetics, describes a horse-step arrangement often called turagapadabandha. A verse is set into four rows of eight syllables. Following moves like a chess knight produces another reading of those same syllables.1, 2
The resemblance to this game is striking: four rows, eight positions in each row, and language revealed through movement. Tour of Phrase is not a reconstruction of Rudraṭa's verse. It borrows the broader idea that a path across a board can also become a path through words.
From shatranj manuscripts to Europe
The tour was not confined to poetry. It also circulated as a chess problem in Asia. Historical accounts preserve early examples connected with Kashmir and with Persian and Arabic shatranj, the form of chess played before the modern European game took shape. Some are associated with writers such as al-Adli, who was active in the ninth century. Many early works survive only through later copies and historians' reconstructions, so assigning the puzzle to one inventor would go beyond the evidence.2, 6
Over time, the tour became a chess exercise, a recreational puzzle, and a mathematical question. Numbered boards made the route easy to record. Each number marked the next landing, so one solution could be studied and compared with another.
Euler studies the route
By the eighteenth century, the problem had reached Leonhard Euler. His paper, written in 1758 and published in 1766, became its best-known early mathematical treatment. Rather than record one finished route, Euler looked for methods that could construct tours. His title translates as “Solution of a curious question which does not seem to have been subjected to any analysis.” The Euler Archive preserves the paper and an English translation.3, 4, 5
Euler did not invent the knight's tour. His contribution was to analyze it systematically, turning a well-travelled puzzle into a subject for sustained study.
The modern mathematical view
Strip away the chessboard and the tour becomes a network problem. In graph theory, every square is a vertex and every legal knight move is an edge. A route that visits each vertex once is a Hamiltonian path. If it returns to its beginning, it is a Hamiltonian cycle. The terminology came later, but it describes precisely what Euler and earlier composers were exploring.3, 5
The graph view also explains why changing the board changes the puzzle. A 4 × 8 board has a different network of possible moves from the familiar 8 × 8 chessboard. Corners and edges offer fewer choices, while central positions open more branches.
How Tour of Phrase changes the puzzle
Tour of Phrase puts words back into the path. Its board contains 32 character units, including spaces and punctuation. Every square must be visited once, but a complete geometric tour is not enough. The units must appear in the right order and rebuild the hidden phrase.
Two kinds of clue work at once. The knight's move limits where the path can go, while the emerging language suggests what should come next. Each day's phrase follows a route shaped by centuries of poetry, chess, and mathematics.
References
Sources
- Attentive Minds: A History of the Indian Performative Art of Avadhāna (opens in a new tab)Brill
- Knuth: Knight's Tours in Olin Hall (opens in a new tab)Stanford University
- Puzzles: Mathematics and Chess (opens in a new tab)MacTutor History of Mathematics, University of St Andrews
- Solution of a curious question which does not seem to have been subjected to any analysis (opens in a new tab)Euler Archive, University of the Pacific
- Knight's Tour Problem (opens in a new tab)ETH Zurich Library
- A History of Chess (opens in a new tab)H. J. R. Murray, Clarendon Press, 1913