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 Motor-garage Puzzle.
Moving Counter Problem
The Carpenter's Puzzle
CANTERBURY PUZZLES
A Wonderful Village.
Unclassified Problems.
The Kennel Puzzle.
The Guarded Chessboard
The Dyer's Puzzle
CANTERBURY PUZZLES
The Christmas Geese
THE SQUIRE'S CHRISTMAS PUZZLE PARTY
Bachet's Square.
Chessboard Problems
The Ruby Brooch.
Unclassified Problems.
The Great Scramble.
Money Puzzles
Two New Magic Squares.
Magic Squares Problem.
The Puzzle Of The Doctor Of Physic
CANTERBURY PUZZLES
The Parish Council Election.
Money Puzzles
Pheasant-shooting.
Unclassified Problems.
The Tube Inspector's Puzzle.
Unicursal and Route Problems
The Eight Villas.
Combination and Group Problems