Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:puzzle
|
| gptkbp:alsoKnownAs |
gptkb:Towers_of_Hanoi
|
| gptkbp:category |
gptkb:puzzle
|
| gptkbp:describedBy |
gptkb:Édouard_Lucas
|
| gptkbp:describedYear |
1883
|
| gptkbp:hasLegend |
Hindu temple in Benares
|
| gptkbp:hasRule |
no disk may be placed on a smaller disk
only one disk moved at a time |
| gptkbp:hasVariant |
different initial configurations
more than three pegs |
| https://www.w3.org/2000/01/rdf-schema#label |
Tower of Brahma
|
| gptkbp:legendInvolves |
priests moving disks
|
| gptkbp:legendStates |
world will end when puzzle is solved
|
| gptkbp:minimumMovesFormula |
2^n - 1
|
| gptkbp:numberOfDiscs |
variable
|
| gptkbp:originatedIn |
gptkb:India
|
| gptkbp:puzzleType |
recreational mathematics
|
| gptkbp:referencedIn |
popular culture
mathematics literature |
| gptkbp:relatedTo |
mathematical induction
recursive algorithms |
| gptkbp:requires |
multiple disks
three rods |
| gptkbp:usedIn |
computer science education
|
| gptkbp:usedToTeach |
recursion
algorithm design |
| gptkbp:bfsParent |
gptkb:Towers_of_Hanoi
|
| gptkbp:bfsLayer |
8
|