What is the least number of moves needed to solve the k-peg Towers of Hanoi problem? (Q4621297): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2964239108 / rank | |||
Normal rank | |||
Latest revision as of 10:37, 30 July 2024
scientific article; zbMATH DE number 7020358
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What is the least number of moves needed to solve the k-peg Towers of Hanoi problem? |
scientific article; zbMATH DE number 7020358 |
Statements
What is the least number of moves needed to solve the k-peg Towers of Hanoi problem? (English)
0 references
11 February 2019
0 references
Tower of Hanoi
0 references
peg
0 references
disk
0 references
minimum number
0 references
Frame-Stewart
0 references
open problem
0 references
