What is the least number of moves needed to solve the k-peg Towers of Hanoi problem? (Q4621297)

From MaRDI portal
Revision as of 19:14, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
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
    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

    Identifiers