Scribd
Upload
93 views9 pages

Tower of Hanoi

The document describes the Tower of Hanoi problem and provides an implementation of a recursive solution in Python. The problem involves moving a stack of disks of different sizes between three poles according to rules where only one disk can be moved at a time and no larger disk can be placed on top of a smaller one. A recursive function is developed that calls itself to move the top n-1 disks, move the last disk, and then move the n-1 disks again to solve the problem for any number of disks.

Uploaded by

Shania Jone
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
93 views9 pages

Tower of Hanoi

The document describes the Tower of Hanoi problem and provides an implementation of a recursive solution in Python. The problem involves moving a stack of disks of different sizes between three poles according to rules where only one disk can be moved at a time and no larger disk can be placed on top of a smaller one. A recursive function is developed that calls itself to move the top n-1 disks, move the last disk, and then move the n-1 disks again to solve the problem for any number of disks.

Uploaded by

Shania Jone
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

INTRODUCTION TO PYTHON

PROGRAMMING

ASSIGNMENT-1:
TOWER OF HANOI

Name: I Shania Jone


USN:11NT22CS186-T
SECTION ‘D’
THE TOWER OF HANOI

The Tower of Hanoi is the problem in which there are 3 towers, let’s mark it
with the names Source Pole, Temporary Pole, and Destination Pole. And in
Source Pole, we have n number of disks. And the task is to move all disks
from Source Pole to Destination Pole using Temporary Pole The puzzle
starts with the disks in a neat stack in ascending order of size on one
rod, the smallest at the top, thus making a conical shape. The objective
of the puzzle is to move the entire stack to another rod, obeying the
following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the
stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
Understanding the Problem
Statement
The problem statement for the Tower of Hanoi is straightforward. The
goal is to move the entire stack of disks from the starting rod to the
final rod, adhering to the rules mentioned in the introduction section.
The number of disks in the stack can vary, and thus, the number of
moves required to solve the puzzle also varies.
For example, consider a scenario where we have three disks. In this
case, the minimum number of moves required to solve the puzzle is 7.
This can be calculated using the formula 2^n – 1, where n is the number
of disks. In general, the more disks we have in the stack, the more
moves are required to solve the puzzle.

Implement Tower of Hanoi with a recursive


function
Consider the problem .What is needed to move disk number 3 from
source pole to destination pole? I feel if two disks 1 and 2 are in
temporary pole then disk 3 can be moved to destination pole.
The idea behind the algorithm is to move the top n-1 disks from the source pole to
the temporary pole, and then move the last disk to the destination pole. Finally,
move the n-1 disks from the temporary pole to the destination pole. This can be
repeated until all the disks have been moved to the destination pole.
Here are the steps to create the algorithm:
•Base case: If the number of disks is 1, simply move it from the source pole to the
destination pole.
•Recursive case: If the number of disks is greater than 1, follow the following steps:
a. Move the top n-1 disks from the source pole to the temporary pole.
b. Move the last disk from the source pole to the destination pole.
c. Move the n-1 disks from the temporary pole to the destination pole.

And these n-1 moves are called recursively such that individual function call
is responsible to handle the 1 disk move in each call.
CODE IN PYTHON FOR TOWER OF HANOI:
def moveDisks(N, src, dst, temp):
if N > 0:
moveDisks(N - 1, src, temp, dst)
print('Move disk', N, 'from rod', src, 'to rod', dst)
moveDisks(N- 1, temp, dst, src)

moveDisks(3, 'Source Pole', 'Destination Pole', 'Temp Pole')


Taking example of 3 disks
Tower of Hanoi problem for 3 disks
1)Develop a recursive function for the above problem.
def moveDisks(N, src, dst, temp):
if N > 0:
moveDisks(N - 1, src, temp, dst)
print('Move disk', N, 'from rod', src, 'to rod', dst)
moveDisks(N- 1, temp, dst, src)
2)Call a function with N equals 1,N equals 2 and N equals 4
moveDisks(1, 'Source Pole', 'Destination Pole', 'Temp Pole')

moveDisks(2, 'Source Pole', 'Destination Pole', 'Temp Pole')


moveDisks(4, 'Source Pole', 'Destination Pole', 'Temp Pole')
3)The recursive function call should output the trace as shown above for N equals
4.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy