Skip to main content

The Towers of Hanoi Puzzle in Java | Resit Programming Project | Java Assignments Help

Image
By

The Towers of Hanoi Puzzle

The description of this problem is taken from the book by Douglas Baldwin and Greg W Scragg (2004), Algorithms and Data Structures: The Science of Computing. Hingham MA: Charles River Media. Legend tells of an ageless temple in the city of Hanoi. Within this temple are three poles of diamond piercing 64 golden disks of varying sizes. At the moment of creation, the disks were stacked smaller-on-top-of-larger on the leftmost pole. Since then, the monks of the temple have been moving the disks from the left pole to the right pole, subject to the following rules:

  • The monks only move one disk at a time.
  • Every disk taken off a pole has to be put back on some pole before moving another disk.
  • The monks never put a disk on top of a smaller one.

When all the disks have been moved to the right-hand pole, the purpose of creation will have been fulfilled and the universe will end. It’s not immediately obvious how (or even if) the monks can move the disks to the right-hand pole while obeying all the rules. The Towers of Hanoi puzzle amounts to figuring out a way. It isn’t essential to the puzzle that there are 64 disks, and in fact, a 64-disk tower would be quite unwieldy. Thus, the problem is usually posed without reference to the specific number of disks, as follows:

Given n disks stacked smaller-on-larger on the left-most of three poles, move all the disks to the right-most pole, subject to the rules given above.

Screenshots:


CONTACT DETAILS

For any other questions or other tasks please feel free to contact me
via email: mhassnainjamil@gmail.com
via WhatsApp: +92-324-7042178
via skype: hassnainjamil1
Buy now
Labels:

Comments

Post a Comment

Popular posts from this blog

The Zoo Management System - entity relationship diagram & MS Access Database

By
Zoo Management System - Project Details: You are the employee of a big, worldwide working Zoo Management Company. Your company is responsible for the Zoo management. Your boss thinks it would be a great idea to store all data for each Zoo in a brand new self-developed ZOO Management System. Up to now, the ZOO management company has maps of each ZOO available. Your boss knows that you took a course in introduction on an ERP system, so he asks you if you could help designing such a system. Each ZOO must have the same organizational structure, which should look like this: Each Zoo has a Zoo-Address. Each Zoo has many visitors (Visitor Ticket Process (VTP). Many Zoo-Attractions belong to a Zoo. Module 1: Entity Relationship Diagram Design a ER (entity-relationship) diagram for your ZOO Management System. Use the information provided below with the entities and its attributes. Put the entities in the correct relationship to each other (organizational structure). Module 2: DB Implem...
1 comment
Read more

Human Physiology by Stuart Ira Fox [PDF] (12th edition) free download

By
21 comments
Read more

Sudoku Game Project in Java with full source code including GUI task

By
Introduction The purpose of the project is to try in practice the use of recursion and object-oriented program design. Please make sure to read this entire note before starting your work. Pay close attention to the sections on deadlines, deliverables, and exam rules. The problem Your task in this part of the project is to write a solver for Sudoku puzzles. Sudoku puzzles are a kind of crossword puzzles with numbers where the following two conditions have to be met: In each row or column, the nine numbers have to be from the set [1,2,3,4,5,6,7,8,9] and they must all be different.  For each of the nine non-overlapping 3x3 blocks, the nine numbers have to be from the set [1,2,3,4,5,6,7,8,9] and they ust all be different. The following two figures show a Sudoku puzzle and its solution. The input The input of your program, the Sudoku puzzles, is given in text files. More specifically, they are represented as nine lines of nine characters separated by spaces. The characters can be of two...
Post a Comment
Read more