Memory Saving for Solving the Towers of Hanoi Problem

机译：节省内存以解决河内难题

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

The towers of Hanoi problem is a classical problem in puzzles, games, mathematics, data structures, and algorithms. With comparing the sizes of disk, labeling the disks, and combining the source array and target array, a least memory used algorithm for solving the towers of Hanoi problem is proposed in this paper. If there are n disks, the proposed algorithm reduces the space needed from 2n+2 to n+5.

机译：河内问题之塔是难题，游戏，数学，数据结构和算法中的经典问题。通过比较磁盘大小，标记磁盘并结合源阵列和目标阵列，提出了一种用于解决河内塔问题的最少内存使用算法。如果有n个磁盘，则所提出的算法将所需的空间从2n + 2减少到n + 5。

著录项

来源
《World multi-conference on systemics, cybernetics and informatics;WMSCI 2008;ISAS;International conference on Information systems analysis and synthesis》|2008年|36-38|共3页
会议地点
作者
Chen-An Fang; Yu-Kumg Chen;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类计算技术、计算机技术;
关键词
towers of Hanoi; data structure; algorithm; mathematics;

机译：河内的塔;数据结构;算法;数学;

相似文献

外文文献
中文文献
专利

1. What is the least number of moves needed to solve the k-peg Towers of Hanoi problem? [J] . Roberto Demontis Discrete mathematics, algorithms, and applications . 2019,第1期

机译：解决河内问题K-PEG塔所需的最少行动是什么？
2. Solving the Towers of Hanoi - how an amoeboid organism efficiently constructs transport networks [J] . Reid Chris R., Beekman Madeleine The Journal of Experimental Biology . 2013,第9期

机译：解决河内的塔楼-变形虫生物如何有效地构建运输网络
3. An Optimal Algorithm for Solving the Towers of Hanoi Problem with the Least Storage Used [J] . Yu-Kumg CHEN, Chen-An FANG, Fan-Chieh CHENG IEICE transactions on information and systems . 2011,第2期

机译：用最少存储量求解河内问题塔的优化算法
4. Memory Saving for Solving the Towers of Hanoi Problem [C] . Chen-An Fang, Yu-Kumg Chen World Multi-Conference on Systemics, Cybernetics and Informatics . 2008

机译：解决河内问题塔的记忆保存
5. The effects of practice, verbalization, and mode of presentation on problem solving strategies for the Tower of Hanoi problem. [D] . Wong, Lucas L. 2014

机译：练习，口头表达和陈述方式对河内塔问题解决策略的影响。
6. Problem Solving as Probabilistic Inference with Subgoaling: Explaining Human Successes and Pitfalls in the Tower of Hanoi [O] . Francesco Donnarumma, Domenico Maisto, Giovanni Pezzulo 2016

机译：解决问题的概率推论：解释人类的成功和在河内塔中的陷阱
7. What is the least number of moves needed to solve the k-peg Towers of Hanoi problem? [O] . Demontis, Roberto 2016

机译：什么是解决k-peg塔所需的最少数量的移动河内问题？
8. Tower-Noticing Triggers Strategy-Change in the Tower of Hanoi: A Soar Model. [R] . Ruiz, D., Newell, A. 1989

机译：塔内注意触发战略 - 河内塔的变化：一个翱翔模型。

Memory Saving for Solving the Towers of Hanoi Problem

摘要

著录项

相似文献

相关主题

期刊订阅