Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:puzzle
|
| gptkbp:alsoKnownAs |
gptkb:Reve's_puzzle
|
| gptkbp:generalizes |
gptkb:Tower_of_Hanoi
|
| https://www.w3.org/2000/01/rdf-schema#label |
multi-peg Tower of Hanoi
|
| gptkbp:introducedIn |
1939
|
| gptkbp:minimumMovesKnownFor |
three pegs
|
| gptkbp:minimumMovesUnknownFor |
four or more pegs
|
| gptkbp:numberOfIssues |
minimum moves for arbitrary pegs
|
| gptkbp:numberOfPegs |
four or more
|
| gptkbp:objective |
move all disks to another peg with minimum moves
|
| gptkbp:prohibits |
only one disk moved at a time
no larger disk on top of a smaller disk |
| gptkbp:relatedTo |
graph theory
recursion algorithmic complexity Frame–Stewart algorithm |
| gptkbp:studiedBy |
J. S. Frame
B. M. Stewart |
| gptkbp:type |
combinatorial optimization
|
| gptkbp:bfsParent |
gptkb:Hanoi_Tower
|
| gptkbp:bfsLayer |
8
|