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

The Icosahedron Puzzle.
Unicursal and Route Problems
Noughts And Crosses
MISCELLANEOUS PUZZLES
The Fifteen Dominoes.
Combination and Group Problems
The Garden Puzzle.
Patchwork Puzzles
St. George And The Dragon.
The Guarded Chessboard
Bishops In Convocation.
Chessboard Problems
Torpedo Practice.
Moving Counter Problem
The Seven Pigs.
Various Dissection Puzzles
The Bicycle Thief.
Money Puzzles
The Riddle Of St Edmondsbury
THE MERRY MONKS OF RIDDLEWELL
Rackbrane's Little Loss.
Money Puzzles
The Weaver's Puzzle
CANTERBURY PUZZLES
Tasting The Plum Puddings
THE SQUIRE'S CHRISTMAS PUZZLE PARTY
The Motor-car Tour.
Unicursal and Route Problems
The Barrel Of Beer.
Money Puzzles