排序方式： 共有19条查询结果，搜索用时 156 毫秒
1.
周斌 《实验室研究与探索》2011,30(7):61-63,71
"Problem of Towers of Hanoi",用递归的方法能很容易地解决问题,不用递归的方法将会是比较困难,因为随着参与盘子数的不断增多,计算时间和复杂度将会不断增多。运用仿真软件能清晰地勾勒出每个盘子的移动轨迹并给出详细的移动步骤,这将会使此问题能更形象、更直观的解决。 相似文献
2.
递归算法是数学和计算机科学中非常重要的一个概念,也是教学中的一个难点。设计一款以汉诺塔为道具的数字教学游戏,旨在帮助学习者在愉悦的过程中体会和理解递归算法。 相似文献
3.
Hanoi塔问题作为一个古典的数学问题,一直以来都是数据结构中递归算法的经典案例,在对Hanoi塔问题递归算法进行研究与分析后,提出一种占据内存更少,速度更快且实现简单的非递归算法． 相似文献
4.
陈海丽 《南宁职业技术学院学报》2011,16(2):17-21
中国—东盟自由贸易区建成以后,中越两国各方面的交流变得更加频繁。民以食为天,两国的饮食交流在今天显得日益重要。通过选取在越南河内的中国特色民间小吃为考察对象,探讨它们在越南的发展现状和本土化过程,分析其本土化的形式和原因,印证中越源远流长的历史关系,展望两国美好发展未来。 相似文献
5.
6.
张满利 《廊坊师范学院学报》2001,17(4):50-51
对“汉诺塔问题”的最少移动次数及实现最少移动次数的方案数量进行了研究,并证明了实现最少移动次数的方案是唯一的． 相似文献
7.
Tower of Hanoi has become a popular tool in cognitive and neuropsychology to assess a set of behaviors collectively referred to as executive functions. Substantial variability in performance on the Tower of Hanoi (TOH) disk-transfer task among normally functioning young adults, and potential contributions to these individual differences, were examined. In this expanded 60-problem version of the four-disk TOH, the degree to which problem administration (blocked vs. random) and strategy knowledge influenced overall performance and changes in accuracy across problems was examined. Eighty-seven college students were randomly assigned to a Blocked Group (problems given in ascending order of move-length) and a Random Group (problems given in a random order). After administration of the TOH task, participants described their problem solving and these verbal protocols were analyzed with regard to four elements of a strategic approach to problem solving. Problem administration order demonstrated no effect on task performance or on expressed strategy knowledge; however, strategy knowledge did predict performance on the TOH. An expected decrease in performance across trials was observed in the Blocked Group, and an increase in accuracy in the Random group indicated a learning effect. Strategy knowledge did not interact with these changes in performance across the items. These results suggest that external cues do not influence performance on the TOH to the same extent as individual differences in strategy induction relatively early in the problem solving process. 相似文献
8.
AbstractThe present study investigated the usefulness of a pre-programmed, teleoperated, socially assistive peer robot in dynamic testing of complex problem solving utilising the Tower of Hanoi. The robot, in a ‘Wizard of Oz’ setting, provided instructions and prompts during dynamic testing to children when they had to solve 3?D Tower of Hanoi puzzles. Participants were 37?second grade 8-year-old children, of whom half received graduated prompts training between pre-test and post-test, delivered by the robot, and half did not. It was found that children’s progression in task accuracy varied considerably, depending on whether or not children were trained in solving Tower puzzles. Trained children showed greater progression in the number of Tower problems that they could solve accurately, made considerably fewer steps, although the Tower puzzles increased quickly in difficulty level. The mean completion time of trained children decreased at a slower rate than that of the untrained children, but both groups of children took considerably more time to think and plan ahead before they started the solving process. Only moderate relations with planning behaviour were found. In general, the study revealed that computerised dynamic testing with a robot as assistant has much potential in unveiling children’s potential for learning and their ways of tackling complex problems. The advantages and challenges of using a robot in educational assessment were discussed. 相似文献
9.
本结合图形详细分析了汉诺(Hanoi)塔递归算法，并用一个完全展开的汉诺塔递归程序帮助学生理解、掌握函数的递归及汉诺塔问题。 相似文献
10.
递归问题是计算机程序设计语言里面的一个重点,难点问题,本文以汉诺塔问题为例讨论如何用二叉树来求解递归问题. 相似文献