KNIGHT’S TOUR

One of the oldest puzzles dating from the 14^th century. The problem is to find a sequence of 64 moves by which the knight can visit each square of the chessboard consecutively. The possible solutions were never calculated. A “closed tour” is one in which the square at the end of a knight’s tour is a knight moved away from the first square, as in the second example below. The master of Shatranj as-Suli published the following two closed tours:

The first example shows perfect axial symmetry on the left halfboard, the second is composed of two quasi-symmetrical half-board tours.

Not this time, Mr. Carlsen! (after winning the World Blitz Championship 2016) Sergey Karjakin
2016
Chess is a scientific game and its literature ought to be placed on the basis of the strictest truthfulness, which is the foundation of all scientific research. W. Steinitz
The main thing is that you’ve got to keep on studying however old you are. You can’t just rely on your capital, so you have to try and keep up, and that is a difficult task. Nigel Short
2016
I never make mistakes in chess, I only have hallucinations! Vlastimil Hort
1987
If I’m thinking for more than 20 minutes about one move, it’s usually a waste. Sometimes you can come up with some amazing solution but most of the time you just end up looping: you consider a move, you reject it, then you’re desperate, you come back to the move, you don’t remember why you rejected it, you have to make a move so you make it – then your opponent replies and you remember why you rejected it. The longest wait I ever did between moves was one hour and five minutes – and the move was horrible. Magnus Carlsen
2016

error: Content is protected !!

KNIGHT’S TOUR

KNIGHT’S TOUR

ECHESSPEDIA

Quotes of the Day