Question

Writing in Python. Need help making this program:

Hanoi's tower is an old game that can be solved with a recursive algorithm. Wikipedia contains example implementations of this.
You will write a variant of this implementation that prints the condition of the three stacks of slices after each move. Remember that the different recursive calls will refer to different stacks, so in order to print a status that is comparable between calls, the method that prints the stacks must have its own references to the stacks. One way to do this is to define a class Hanoi, let the three stacks of slices be instance variables, let the print method be an instance method, and let the recursive method itself be an instance method as well.
The driving time to Towers of Hanoi is O (2n) where n is the number of slices in the stack. Analyze their algorithm to find out why.

Answer 1

SOURCE CODE:

*Please follow the comments to better understand the code.

**Please look at the Screenshot below and use this code to copy-paste.

***The code in the below screenshot is neatly indented for better understanding.

# Let us say we want to perform the TowersOfHanoi with 3 disks
NUM_OF_DISKS = 3

class Tower:
"""Create the tower class here ."""

def __init__(self, name, n_disks = 0):
self.name = name
self.disks = []

for i in range(n_disks, 0, -1):
self.push(str(i))

# Push the disk to the tower
def push(self, disk):
self.disks.append(disk)

# Pop the disk to tower
def pop(self):
return self.disks.pop()

# Print the tower here
def __str__(self):
disks = ''.join('{:<2}'.format(d) for d in self.disks)
return '{}: {}'.format(self.name, disks)

class TowersOfHanoi:
"""Represents the Tower of Hanoi's problem and solution."""

def __init__(self, n_disk):
self.n_disk = n_disk
self.n_move = 0
self.prepare_towers()

# Prepare the 3 towers here
def prepare_towers(self):
s = Tower('src', self.n_disk)
d = Tower('dest')
e = Tower('temp')

self.towers = [s, d, e]

# Start the solution here
def start(self):
self.print_the_current_towers()
s, d, e = self.towers
self.move_the_disk(s, d, e, self.n_disk)

# Move the disks here
def move_the_disk(self, s, d, e, n):
if n <= 0:
return

self.move_the_disk(s, e, d, n - 1)

self.n_move += 1
print('move disk-{} from {} to {} ({}).'.format(str(n), s.name, d.name, self.n_move))
disk = s.pop()
d.push(disk)
self.print_the_current_towers()

self.move_the_disk(e, d, s, n - 1)

# Print the current towers here
def print_the_current_towers(self):
for t in self.towers:
print(t)

# START the program here
print('TOH is started.')

towers_of_hanoi = TowersOfHanoi(NUM_OF_DISKS)
towers_of_hanoi.start()

# END HERE
print('TOH is finished.')

======================================

SCREENSHOT:

OUTPUT:

TOH is started.
src: 3 2 1
dest:
temp:
move disk-1 from src to dest (1).
src: 3 2
dest: 1
temp:
move disk-2 from src to temp (2).
src: 3
dest: 1
temp: 2
move disk-1 from dest to temp (3).
src: 3
dest:
temp: 2 1
move disk-3 from src to dest (4).
src:
dest: 3
temp: 2 1
move disk-1 from temp to src (5).
src: 1
dest: 3
temp: 2
move disk-2 from temp to dest (6).
src: 1
dest: 3 2
temp:
move disk-1 from src to dest (7).
src:
dest: 3 2 1
temp:
TOH is finished.