MathPuzzle

Free puzzles / Question / The Guarded Chessboard

St. George And The Dragon.

Here is a little puzzle on a reduced chessboard of forty-nine squares. St. George wishes to kill the dragon. Killing dragons was a well-known pastime of his, and, being a knight, it was only natural that he should desire to perform the feat in a series of knight's moves. Can you show how, starting from that central square, he may visit once, and only once, every square of the board in a chain of chess knight's moves, and end by capturing the dragon on his last move? Of course a variety of different ways are open to him, so try to discover a route that forms some pretty design when you have marked each successive leap by a straight line from square to square.

Answer

There are numerous solutions to this little agricultural problem. The version I give in the next column is rather curious on account of the long parallel straight lines formed by some of the moves. [Illustration: Farmer Lawrence's Cornfields.]