z-logo
open-access-imgOpen Access
The Generalized Colour Towers of Hanoi: An Iterative Algorithm
Author(s) -
M. C. Er
Publication year - 1984
Publication title -
the computer journal
Language(s) - French
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/27.3.278
Subject(s) - algorithm , iterative method , mathematics , clockwise , computer science , geometry , rotation (mathematics)
Presentation d'un algorithme iteratif pour resoudre le probleme de tours de Hanoi generalisee de couleur. On discute les principes fondamentaux. Le probleme est une variante du probleme des tours de Hanoi. On fait aussi une comparaison avec un algorithme recursif pour resoudre le meme probleme

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom