Free puzzles / Question / Magic Squares Problem.
The Magic Knight's Tour.
Here is a problem that has never yet been solved, nor has its
impossibility been demonstrated. Play the knight once to every square of
the chessboard in a complete tour, numbering the squares in the order
visited, so that when completed the square shall be "magic," adding up
to 260 in every column, every row, and each of the two long diagonals. I
shall give the best answer that I have been able to obtain, in which
there is a slight error in the diagonals alone. Can a perfect solution
be found? I am convinced that it cannot, but it is only a "pious
opinion."
Answer
The explanation of this little fallacy is as follows. The error lies in
assuming that the little triangular piece, marked C, is exactly the same
height as one of the little squares of the board. As a matter of fact,
its height (if we make the sixty-four squares each a square inch) will
be 1+1/7 in. Consequently the rectangle is really 9+1/7 in. by 7 in., so
that the area is sixty-four square inches in either case. Now, although
the pieces do fit together exactly to form the perfect rectangle, yet
the directions of the horizontal lines in the pieces will not coincide.
The new diagram above will make everything quite clear to the reader.