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

A Puzzling Watch.
Money Puzzles
The Four Kangaroos.
The Guarded Chessboard
A Deal In Apples.
Money Puzzles
The Sailor's Puzzle.
Unicursal and Route Problems
Pocket Money.
Money Puzzles
Who Was First?
Unclassified Problems.
The Languishing Maiden.
The Guarded Chessboard
The Riddle Of The Tiled Hearth
THE MERRY MONKS OF RIDDLEWELL
An Easy Square Puzzle.
Various Dissection Puzzles
The Chalked Numbers
THE SQUIRE'S CHRISTMAS PUZZLE PARTY
The Primrose Puzzle
MISCELLANEOUS PUZZLES
The Glass Balls.
Combination and Group Problems
The Union Jack.
Unicursal and Route Problems
The Mouse-trap Puzzle.
Combination and Group Problems
An Episcopal Visitation.
The Guarded Chessboard