Towers of hanoi problem with arbitrary<i>k</i>≧3 pages (Q3806843)

From MaRDI portal
Revision as of 10:53, 19 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Towers of hanoi problem with arbitrary<i>k</i>≧3 pages
scientific article

    Statements

    Towers of hanoi problem with arbitrary<i>k</i>≧3 pages (English)
    0 references
    0 references
    1988
    0 references
    Towers of Hanoi
    0 references
    recursive algorithm
    0 references

    Identifiers