Navaneesha Subramaniam (2007) The Hanoi graphs for the horizon tower. Universiti Malaysia Sabah. (Unpublished)
|
Text
ae0000001766.pdf Download (1MB) | Preview |
Abstract
This dissertation describes a variant of the Tower of Hanoi game called The Horizon Tower where this game contains different disks arrangements. The disks in the Horizon Tower are given two alternating colors (blue and red) and hence this game can be solved to build one Hanoi Tower or two Hanoi Towers according to the disk colour. The effects of the different disk arrangements were analyzed using the Hanoi graphs for the Horizon Tower. The analysis shows that different disk arrangement of the Horizon Tower alters the shape of the Hanoi graph. The Hanoi graphs for the Horizon Tower also varies as the number of disks increases. Hence, a comparison between the graphs was made and the results show that there are some similarities between the graphs. However, as the number of disks increases, the dissimilarity between the graphs increases. The graphs become more complicated and more difficult to create. The Hanoi graph for the Horizon Tower was also used in evaluating the fastest way in obtaining the solutions to the problem. This research shows that the Horizon Tower is easier solved as the number of moves required to solve this game is much lesser compared to the Tower of Hanoi.
| Item Type: | Academic Exercise |
|---|---|
| Keyword: | Tower of Hanoi, disk arrangement, number of move, Horizon Tower, game |
| Subjects: | Q Science > QA Mathematics |
| Department: | SCHOOL > School of Science and Technology |
| Depositing User: | SITI AZIZAH BINTI IDRIS - |
| Date Deposited: | 08 Jan 2014 13:55 |
| Last Modified: | 10 Oct 2017 16:27 |
| URI: | https://eprints.ums.edu.my/id/eprint/8003 |
Actions (login required)
 |
View Item |