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

Two New Magic Squares.
Magic Squares Problem.
The Nun's Puzzle
CANTERBURY PUZZLES
Catching The Hogs
MISCELLANEOUS PUZZLES
The Four Elopements.
Measuring, Weight, and Packing Puzzles.
The Glass Balls.
Combination and Group Problems
Sir Edwyn De Tudor.
Money Puzzles
The Clerk Of Oxenford's Puzzle
CANTERBURY PUZZLES
The Weaver's Puzzle
CANTERBURY PUZZLES
The Wife Of Bath's Riddles
CANTERBURY PUZZLES
Queer Relationships.
Money Puzzles
The Motor-garage Puzzle.
Moving Counter Problem
The Magic Knight's Tour.
Magic Squares Problem.
The Six Frogs.
Moving Counter Problem
Romeo's Second Journey
THE PROFESSOR'S PUZZLES
The Chinese Chessboard.
Chessboard Problems