![]() |
|||
| This is the classic "The Reve's Puzzle" from Henry E. Dudeney's "The Canterbury Puzzles".
When Chaucer's Pilgrims stopped at a wayside tavern, the Reve — a "wily man" according to Chaucer — set up four stools, placed eight cheeses of differing sizes on one of the stools, and challenged the other pilgrims to move them to one of the other stools in the least number of moves. They have to be moved one at a time, and a larger cheese can never be placed on a smaller. After eight cheeses have been successfully moved, the challenge is to move nine. After nine have been moved, the challenge is to move ten. In each case, they have to be moved in the least number of moves possible. When a pilgrim finally moves 21 cheeses in the least number of moves, the Reve will give that pilgrim "a draught of the best that our good host can provide." |
![]() |
||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
In this puzzle, you -- the Pilgrim -- are challenged to move the cheeses from
the starting stool to one of the other stools. The goal is to move them in as few moves as possible.
In the Lite version, you:
|
The Full version has two modes, a Practice mode and a Puzzle mode. In Practice mode, you can do everything you can do in the Lite version plus you can choose from 8 through 21 cheeses. In Puzzle mode, you:
|
The question of determining the minimum number of moves required to move n cheeses in The Reve's Puzzle is still open. The "Frame–Stewart Algorithm" — published in 1939 — describes a method of moving the cheeses similar to the one used in this app, but it has not been proven that this method provides a minimum number of moves. By all accounts, this is a very difficult problem of mathematics. The illustrations and graphics for this app were created by Judy Coppola of Sava Design (www.savadesign.com) You can visit a web page containing a Java Applet that demonstrates The Reve's Puzzle. |
Further notes:
|
We want to hear from you regarding any suggestions you have for improving the puzzle. |