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
Masalah Menara Hanoi ialah masalah klasik dalam teka-teki, permainan, matematik, struktur data dan algoritma. Dalam surat ini, algoritma terkecil memori yang digunakan dicadangkan dengan menggabungkan tatasusunan sumber dan tatasusunan sasaran untuk membandingkan saiz cakera dan melabelkan cakera dalam masalah menara Hanoi. Akibatnya, algoritma yang dicadangkan mengurangkan ruang yang diperlukan daripada 2n+2 XNUMX XNUMX XNUMX hingga n+5, di mana n mewakili nombor cakera.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -