A Non-recursive Algorithm for 4-Peg Hanoi Tower
- 10.2991/iske.2007.16How to use a DOI?
- 4-peg Hanoi Tower; cross correlation; iteration path
The compound relationship between different moving-orders with different plates of 4-peg Hanoi Tower problem is analyzed in this paper, which is regarded as a new cross correlation pattern without fixed span, not the abutting correlation pattern of 3-peg problem. It is rearranged to a binary and hierarchical tree good for understanding and using. A new idea to solve the 4-peg with a non-recursive algorithm is proposed by forming an iteration path with those nodes that are related to the target problem directly and iterating according this path. By abandoning the storage and computing of useless node, the efficiency of the non-recursive algorithm is improved great
- © 2007, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Jun Wang AU - Junpeng Liu AU - Guoying Yue AU - Liangshan Shao AU - Shukui Lu PY - 2007/10 DA - 2007/10 TI - A Non-recursive Algorithm for 4-Peg Hanoi Tower BT - Proceedings of the 2007 International Conference on Intelligent Systems and Knowledge Engineering (ISKE 2007) PB - Atlantis Press SP - 84 EP - 87 SN - 1951-6851 UR - https://doi.org/10.2991/iske.2007.16 DO - 10.2991/iske.2007.16 ID - Wang2007/10 ER -