VIEW THE MOBILE VERSION of www.mathpuzzle.ca Informational Site Network Informational
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

An Easy Dissection Puzzle.
Various Dissection Puzzles
Two New Magic Squares.
Magic Squares Problem.
The Dutchmen's Wives.
Money Puzzles
The Great Dispute Between The Friar And The Sompnour
CANTERBURY PUZZLES
Wine And Water.
Measuring, Weight, and Packing Puzzles.
The Horse-race Puzzle.
Problems Concerning Games.
A Railway Puzzle.
Moving Counter Problem
A Shopping Perplexity.
Money Puzzles
A Puzzling Legacy.
Money Puzzles
The Adventurous Snail
MISCELLANEOUS PUZZLES
The Five Crescents Of Byzantium.
Chessboard Problems
A Dormitory Puzzle.
Combination and Group Problems
The Widow's Legacy.
Money Puzzles
Romeo's Second Journey
THE PROFESSOR'S PUZZLES
The Mystic Eleven.
Money Puzzles