The Divide-and-Conquer Approach to the Generalized<i>p</i>-Peg Tower of Hanoi Problem (Q4888283)

From MaRDI portal
Revision as of 12:46, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 910387
Language Label Description Also known as
English
The Divide-and-Conquer Approach to the Generalized<i>p</i>-Peg Tower of Hanoi Problem
scientific article; zbMATH DE number 910387

    Statements

    The Divide-and-Conquer Approach to the Generalized<i>p</i>-Peg Tower of Hanoi Problem (English)
    0 references
    0 references
    0 references
    28 July 1996
    0 references
    presumed minimum solution
    0 references
    optimal policy
    0 references
    optimal partition numbers
    0 references
    divide-and-conquer approach
    0 references
    generalized \(p\)-peg tower of Hanoi problem
    0 references

    Identifiers