• Journal of Advanced Navigation Technology
• /
• v.14 no.6
• /
• pp.975-983
• /
• 2010

In this paper, we introduce extended problems of Tower of Hanoi (ToH) and propose a novel visualization method to express a state space of ToH. As for the extended problems, we introduce multi-peg ToH, multi-stack ToH, and regular state ToH. The novel visualization method in this paper is a natural extension of Hanoi graph visualization. In the proposed method, we assign one Cartesian coordinate point per each disk to provide an unified visualization that the marks on a link and the changes of a state should correspond with a peg position of a disk. Compared with Hanoi graph, the generated graph by the proposed method is isomorphic if we remove links of forbidden move, which indicates that our method is a generalization of Hanoi graph and thus is more expressive. To help the understanding of the readers, we show the generated graphs by our method when the number of disks is 2 and 3.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.171-172
• /
• 2011

In this research, we discuss the process of analyzing the solution of four-peg tower of Hanoi using protocol analysis technique, and of developing decision trees from the analyzed contents. For these, we design and implement a computer program that can simulate four-peg tower of Hanoi. The implemented program generates a certain regular-to-regular tower of Hanoi problem, let a user to solve the problem, and records the solution process. From the process by the implemented program and the recorded protocol, we can build the decision tree for the solution. We expect this research can contribute to find a non-optimal solution for n-peg tower of Hanoi.

• Communications of Mathematical Education
• /
• v.21 no.1 s.29
• /
• pp.19-31
• /
• 2007

Currently the mathematics gifted students educational program is plentifully being developed for the elementary and the junior high school students. But the educational program for the gifted students who comes and goes to the high school is not many. This study look for the regularity and generalization of Hanoi Tower with 4 pillars, from the regularity and generalization of Hanoi Tower with 3 pillars. I think this study will be a clue to find the regularity and generalization of Hanoi Tower with n pillars, it's not solved still.

• Magazine of the Korea Concrete Institute
• /
• v.22 no.2
• /
• pp.49-54
• /
• 2010

• Korean Journal of Child Studies
• /
• v.16 no.1
• /
• pp.133-146
• /
• 1995

The purpose of this study was to compare the metacognitive abilities of low and middle-achievers in elementary school. Forty-nine low-and fifty middle-achieving 6th graders were selected from two elementary schools in Seoul. The tower of Hanoi with three discs was used to explore the children's abilities. The subjects were asked to move the three discs on a post to another post five times. All children's performances on the Hanoi tower were video taped. KEDI-WISC, an intelligence test was also used to see whether the children's intelligence scores affect their performances. The results showed that: (1) there was no significant difference between the two groups in the rate of success for the tasks; (2) low-achievers took more time to finish the tasks than middle-achievers, but the time difference decreased dramatically after the first trial; (3) no significant differences was found in self monitoring abilities, though the low-achievers needed more time to start monitoring themselves; (4) low-achievers had much more difficulty in representing the tasks; (5) the IQ scores of the middle-achievers were significantly higher than the low-achievers, but the IQ scores of low achievers were more scattered than those of middle-achievers; that is, IQ scores significantly affected the performance of the children.

• The Journal of Korean Association of Computer Education
• /
• v.16 no.4
• /
• pp.33-45
• /
• 2013

This paper aims at exploring how a high school student is engaged with C computer programming language and explore deep aspects of programming experiences based on video recalled interview as part of portraiture. The single case was selected and several in-depth interviews and video recording were arranged after Oct 2011. The portrait of K reveals interesting strands of his computer programming experiences with his own thinking patterns and exploring ideas for more concrete ways of coding his thinking similar to scientific experiments; ie, design-development-implementation-debugging-revision. Overall, this case illustrates how the inner aspects of subjective programming experiences on the tower of Hanoi were integrated and unified within himself for inner growth. We discussed the student's inner faculties as part of the student's unity and suggested future research direction.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1400-1406
• /
• 2007

The core part of education program of the gifted students in information is the thinking ability extension of the programming. We propose four phases of the education model : (1) problem understanding (2) visualization (3) symbolization (4) algorithmization. This model of four phases is applied to learn the abstract concept of recursion using the data structure of Tree. This model is verified by presenting the example of 'Hanoi Tower' to stimulate intellectual curiosity of the students and help to expand their thinking strength. Also, we show the characteristics of which the teaching subjects and learning activities have, by presenting and clarifying the type of education program, properties of the learning contents, and lower level components. The students can deepen and foster the growth of the learning contents by the students' activities of self-evaluation, and their thinking abilities are increased by the guidances of their teachers.

• Korean Journal of Child Studies
• /
• v.20 no.4
• /
• pp.105-117
• /
• 1999

This study investigated the influence of peer friendliness, conflict, and collaboration on children's problem solving performance. Eighty-two preschool children (41 pairs) filled out the Friendship Assessment Inventory and participated in 3 problem-solving sessions using the Tower of Hanoi. Results showed that just working together does not improve children's problem solving performance. The degree of friendliness children have for each other has a significant effect on their problem solving performance. The children who worked with more friendly peers were more collaborative and were better problem solvers than those who worked with less friendly peers. This study suggests the importance of the relationship between interacting peers on problem solving performance.

• Journal of Engineering Education Research
• /
• v.13 no.2
• /
• pp.3-6
• /
• 2010

In this paper, we report a case study of applying puzzle solving as a programming practice. There are many students, who have attended computer programming language courses, have had difficulties in accomplishing the course assignments. It is because just following and citing the programming language course materials is not sufficient for constructing computer programs. Many professional developers have stated that computer programming for small problems is an art of puzzle solving, where developing enterprise-size computer programming projects involves architectural insights which are already dealt in software engineering literatures. Following those backgrounds, we have explored the applicability of puzzle solving in a C++ object oriented programming course and have reported the results. The experimental results show that puzzle solving is effective to the students who are interested in computer programming and have at least beginner-level knowledge and expertise, but it turned out that puzzle solving assignments still does not draw much attention of the students who are not seriously interested in computer programming.

• The KIPS Transactions:PartB
• /
• v.16B no.6
• /
• pp.489-496
• /
• 2009

Hierarchical Task Network(HTN) planning, a typical planning method for effectively taking advantage of domain-specific control knowledge, has been widely used in complex real applications for a long time. However, it still lacks theoretical formalization and standardization, and so there are some differences among existing HTN planners in terms of principle and performance. In this paper, we present an effective way to translate a HTN planning domain specification into the corresponding standard PDDL specification. Its main advantage is to allow even many domain-independent classical planners to utilize domain-specific control knowledge contained in the HTN specifications. In this paper, we try our translation-based approach to three different domains such as Blocks World, Office Delivery, Hanoi Tower, and then conduct some experiments with a forward-chaining heuristic state-space planner, FF, to analyze the efficiency of our approach.