On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem (Q1613371): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4096952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative algorithm for the Tower of Hanoi with four pegs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths between regular states of the Tower of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized<sub>p</sub>peg tower of hanoi problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946175 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(01)00287-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965106165 / rank
 
Normal rank

Latest revision as of 09:50, 30 July 2024

scientific article
Language Label Description Also known as
English
On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
scientific article

    Statements

    On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2002
    0 references
    multi-peg tower of Hanoi problem
    0 references
    Frame-Stewart algorithm
    0 references
    recursion
    0 references
    dynamic programming
    0 references

    Identifiers