The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Le problème des Tours de Hanoï est un problème classique en matière d’énigmes, de jeux, de mathématiques, de structures de données et d’algorithmes. Dans cette lettre, un algorithme de moindre mémoire utilisée est proposé en combinant le tableau source et le tableau cible pour comparer les tailles de disque et étiqueter les disques dans le problème des tours de Hanoï. En conséquence, l'algorithme proposé réduit l'espace nécessaire de 2n+2 à n+5, où n représente le numéro de disque.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Yu-Kumg CHEN, Chen-An FANG, Fan-Chieh CHENG, "An Optimal Algorithm for Solving the Towers of Hanoi Problem with the Least Storage Used" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 2, pp. 240-242, February 2011, doi: 10.1587/transinf.E94.D.240.
Abstract: The Towers of Hanoi problem is a classical problem in puzzles, games, mathematics, data structures, and algorithms. In this letter, a least memory used algorithm is proposed by combining the source array and target array for comparing the sizes of disk and labeling the disks in the towers of Hanoi problem. As a result, the proposed algorithm reduces the space needed from 2n+2 to n+5, where n represents the disks number.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.240/_p
Copier
@ARTICLE{e94-d_2_240,
author={Yu-Kumg CHEN, Chen-An FANG, Fan-Chieh CHENG, },
journal={IEICE TRANSACTIONS on Information},
title={An Optimal Algorithm for Solving the Towers of Hanoi Problem with the Least Storage Used},
year={2011},
volume={E94-D},
number={2},
pages={240-242},
abstract={The Towers of Hanoi problem is a classical problem in puzzles, games, mathematics, data structures, and algorithms. In this letter, a least memory used algorithm is proposed by combining the source array and target array for comparing the sizes of disk and labeling the disks in the towers of Hanoi problem. As a result, the proposed algorithm reduces the space needed from 2n+2 to n+5, where n represents the disks number.},
keywords={},
doi={10.1587/transinf.E94.D.240},
ISSN={1745-1361},
month={February},}
Copier
TY - JOUR
TI - An Optimal Algorithm for Solving the Towers of Hanoi Problem with the Least Storage Used
T2 - IEICE TRANSACTIONS on Information
SP - 240
EP - 242
AU - Yu-Kumg CHEN
AU - Chen-An FANG
AU - Fan-Chieh CHENG
PY - 2011
DO - 10.1587/transinf.E94.D.240
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2011
AB - The Towers of Hanoi problem is a classical problem in puzzles, games, mathematics, data structures, and algorithms. In this letter, a least memory used algorithm is proposed by combining the source array and target array for comparing the sizes of disk and labeling the disks in the towers of Hanoi problem. As a result, the proposed algorithm reduces the space needed from 2n+2 to n+5, where n represents the disks number.
ER -