Informational Site NetworkInformational Site Network
Privacy
 
Home Top Rated Puzzles Most Viewed Puzzles All Puzzle Questions Random Puzzle Question Search


THE MAGIC KNIGHT'S TOUR.





(Magic Squares Problem.)
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."


Read Answer





Next: A MAGIC SQUARE OF COMPOSITES.

Previous: A MAGIC SQUARE OF COMPOSITES.



Add to Informational Site Network
Report
Privacy
ADD TO EBOOK




Random Questions

The Riddle Of The Cellarer
THE MERRY MONKS OF RIDDLEWELL
The Runaway Motor-car
Adventures of the Puzzle Club
Crossing The Stream.
Measuring, Weight, and Packing Puzzles.
The Honest Dairyman.
Measuring, Weight, and Packing Puzzles.
Ancient Chinese Puzzle.
The Guarded Chessboard
The Cushion Covers.
Patchwork Puzzles
Under The Veil.
Chessboard Problems
A Dormitory Puzzle.
Combination and Group Problems
The Two Aeroplanes.
Money Puzzles
The Japanese Ladies And The Carpet
MISCELLANEOUS PUZZLES
The Eight Queens.
Chessboard Problems
Slow Cricket.
Problems Concerning Games.
The Glass Balls.
Combination and Group Problems
The Cab Numbers.
Money Puzzles
A Trick With Dice.
Problems Concerning Games.