Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:puzzle
|
| gptkbp:alsoKnownAs |
gptkb:Tower_of_Brahma
|
| gptkbp:category |
gptkb:algorithm
gptkb:mathematics gptkb:puzzle |
| gptkbp:goal |
move all disks from source peg to target peg
|
| gptkbp:hasDisks |
n (variable number)
|
| gptkbp:hasLegend |
Brahmin priests moving disks in a temple
|
| gptkbp:hasRule |
no disk may be placed on top of a smaller disk
only one disk may be moved at a time only the top disk of a peg may be moved |
| gptkbp:hasVersion |
wooden puzzle
|
| https://www.w3.org/2000/01/rdf-schema#label |
Towers of Hanoi
|
| gptkbp:introducedIn |
1883
|
| gptkbp:inventedBy |
gptkb:Édouard_Lucas
|
| gptkbp:minimumMovesFormula |
2^n - 1
|
| gptkbp:numberOfPegs |
3
|
| gptkbp:relatedTo |
gptkb:algorithm
dynamic programming recursion |
| gptkbp:socialMedia |
gptkb:simulation
|
| gptkbp:usedIn |
computer science
psychology recreational mathematics |
| gptkbp:bfsParent |
gptkb:Tower_of_Hanoi
|
| gptkbp:bfsLayer |
7
|