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

"strand" Patience.
Problems Concerning Games.
The Broken Coins.
Money Puzzles
Such A Getting Upstairs.
Unclassified Problems.
A Post-office Perplexity.
Money Puzzles
The Nine Counters.
Money Puzzles
The Milkmaid Puzzle.
Patchwork Puzzles
The Cubic Knight's Tour.
The Guarded Chessboard
Painting The Lamp-posts.
Money Puzzles
The Four Frogs.
The Guarded Chessboard
The Keg Of Wine.
Measuring, Weight, and Packing Puzzles.
Chinese Money.
Money Puzzles
The Grand Tour.
Unicursal and Route Problems
Drawing Her Pension.
Money Puzzles
Boards With An Odd Number Of Squares.
Chessboard Problems
Stealing The Bell-ropes.
Patchwork Puzzles