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

Their Ages.
Money Puzzles
Mrs. Smiley's Christmas Present.
Patchwork Puzzles
The Antiquary's Chain.
Combination and Group Problems
The Nine Counters.
Money Puzzles
The Christmas Pudding.
Various Dissection Puzzles
At A Cattle Market.
Money Puzzles
A Magic Square Of Composites.
Magic Squares Problem.
The Cardboard Chain.
Various Dissection Puzzles
The Thirty-one Game
MISCELLANEOUS PUZZLES
The Torn Number.
Money Puzzles
A Charitable Bequest.
Money Puzzles
The Star Puzzle.
The Guarded Chessboard
Beef And Sausages.
Money Puzzles
Curious Numbers.
Money Puzzles
The Four Sons.
Patchwork Puzzles