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

From MaRDI portal
Revision as of 23:17, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    Towers of Hanoi
    0 references
    recursive algorithm
    0 references
    0 references