What is the least number of moves needed to solve the \(k\)-peg Tower of Hanoi problem? (Q4621297)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: What is the least number of moves needed to solve the k-peg Tower of Hanoi problem? |
scientific article; zbMATH DE number 7020358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | What is the least number of moves needed to solve the \(k\)-peg Tower 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
0.802192211151123
0 references
0.7962379455566406
0 references
0.7940412163734436
0 references
