Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:puzzle
|
| gptkbp:alsoKnownAs |
Reve's problem
|
| gptkbp:category |
gptkb:recreational_mathematics
|
| gptkbp:firstDescribed |
gptkb:Henry_Dudeney
1907 |
| gptkbp:generalizes |
gptkb:Tower_of_Hanoi
|
| gptkbp:goal |
move a stack of disks from one peg to another using four pegs
|
| gptkbp:hasRule |
no disk may be placed on top of a smaller disk
only one disk may be moved at a time |
| gptkbp:minimumMovesFor4Disks |
9
|
| gptkbp:minimumMovesFor5Disks |
13
|
| gptkbp:minimumMovesFor6Disks |
17
|
| gptkbp:minimumMovesFormula |
Frame–Stewart algorithm
|
| gptkbp:namedAfter |
Reve (the wise man in Dudeney's story)
|
| gptkbp:numberOfPegs |
4
|
| gptkbp:relatedTo |
gptkb:Tower_of_Hanoi
|
| gptkbp:bfsParent |
gptkb:Hanoi_Tower
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Reve's puzzle
|