Question

If possible, this tower of hanoi code is written in java. Could anyone make an attempt to write it in python?

package Hanoi;
   import java.util.Scanner;
   private int n,current,r;
   public class Towers {
   private Scanner in;
   private int[] hasItMoved,toDest;
   Towers(){
   this.in=new Scanner(System.in);
   this.current=1;
   System.out.println("Enter the number of disks: ");
   this.n = in.nextInt();
   this.hasItMoved=new int[12];
   this.toDest=new int[12];
   for(int j=0;j<this.toDest.length;j++)
   this.toDest[j]=1;
   for(int i=1;i<=n;i++)
   this.toDest[i]=0;
   r=n;
   hanoiStart(n,"Start","Aux1","Aux3","Aux2","Dest",this.current);}   
  
   public void hanoiStart(int numOfDisks, String Start ,String source, String dest, String aux, String last, int current){
   move(1, Start, source, this.current); this.current++;
   H1(n,"Start","Aux1","Aux3","Aux2","Dest",this.current);
   move(1, dest, last, this.current); this.current++;
   }
     
   public int H1(int numOfDisks, String Start ,String source, String dest, String aux, String last, int current) {
   if (numOfDisks == 1) {
   move(numOfDisks, source, aux, this.current); this.current++;
   move(numOfDisks, aux, dest, this.current); this.current++;
   } else if (numOfDisks == 2) {
   move(numOfDisks-1, source, aux, this.current); this.current++;
   move(numOfDisks-1, aux, dest, this.current); this.current++;
   if(this.current==4)
   { move(numOfDisks, Start, source, this.current); this.current++;}
   move(numOfDisks, source, aux, this.current); this.current++;
   move(numOfDisks-1, dest, aux, this.current); this.current++;
   move(numOfDisks-1, aux, source, this.current); this.current++;
   move(numOfDisks, aux, dest, this.current); this.current++;
   if(this.r==2)
   {move(2, dest, last, this.current); this.current++;}
   move(numOfDisks-1, source, aux, this.current); this.current++;
   move(numOfDisks-1, aux, dest, this.current); this.current++;
  
   } else if (numOfDisks > 2) {   
   this.current = H1(numOfDisks-1, Start, source, dest, aux,last, this.current);
   if(this.hasItMoved[numOfDisks]!=1)
   {move(numOfDisks, Start, source, this.current); this.current++;this.hasItMoved[numOfDisks]=1;}
   move(numOfDisks, source, aux, this.current); this.current++;   
   this.current = H1(numOfDisks-1,Start, dest, source, aux,last, this.current);
   move(numOfDisks, aux, dest, this.current); this.current++;
   if(this.toDest[numOfDisks+1]!=0)
   {move(numOfDisks, dest, last, this.current); this.current++;this.toDest[numOfDisks]=1;}
   if(numOfDisks==r)
   this.r--;
   this.current = H1(numOfDisks-1, Start,source, dest, aux,last, this.current);
   };
   return this.current;
   }
   public void move(int aDisk, String source, String dest, int currentStep) {
   System.out.println("Move " + this.current + ": Move disk " + aDisk + " from " + source + " to " + dest);}

Hanoi.java

package Hanoi;
   public class Hanoi {
   public static void main(String[] args) {
   Towers test=new Towers();}}

Answer 1

Code:

File: hanoi.py

Code as text:

# A class to solve tower of hanoi problem

class Towers:

hasItMoved = []

toDest = []

# constructor or initialiser

def __init__(self):

self.current = 1

self.n = int(input("Enter the number of disks: "))

self.hasItMoved = [None] * 12

self.toDest = [1] * 12

for i in range(self.n):

self.toDest[i] = 0

self.r = self.n

self.hanoiStart(self.n, "Start", "Aux1", "Aux3", "Aux2", "Dest", self.current)

# function to start

def hanoiStart(self, numOfDisks, start, source, dest, aux, last, current):

self.move(1, start, source, self.current)

self.current += 1

self.H1(self.n, "Start", "Aux1", "Aux3", "Aux2", "Dest", self.current)

self.move(1, dest, last, self.current)

self.current += 1

# helper function

def H1(self, numOfDisks, start, source, dest, aux, last, current):

if numOfDisks == 1:

self.move(numOfDisks, source, aux, self.current)

self.current += 1

self.move(numOfDisks, aux, dest, self.current)

self.current += 1

elif numOfDisks == 2:

self.move(numOfDisks-1, source, aux, self.current)

self.current += 1

self.move(numOfDisks-1, aux, dest, self.current)

self.current += 1

if self.current==4:

self.move(numOfDisks, start, source, self.current)

self.current += 1

self.move(numOfDisks, source, aux, self.current)

self.current += 1

self.move(numOfDisks-1, dest, aux, self.current)

self.current += 1

self.move(numOfDisks-1, aux, source, self.current)

self.current += 1

self.move(numOfDisks, aux, dest, self.current)

self.current += 1

#continued

if self.r==2:

self.move(2, dest, last, self.current)

self.current += 1

self.move(numOfDisks-1, source, aux, self.current)

self.current += 1

self.move(numOfDisks-1, aux, dest, self.current)

self.current += 1

elif numOfDisks > 2:

self.current = self.H1(numOfDisks-1, start, source, dest, aux,last, self.current)

if self.hasItMoved[numOfDisks]!=1:

self.move(numOfDisks, start, source, self.current)

self.current += 1

self.hasItMoved[numOfDisks]=1

self.move(numOfDisks, source, aux, self.current)

self.current += 1

self.current = self.H1(numOfDisks-1, start, dest, source, aux,last, self.current)

self.move(numOfDisks, aux, dest, self.current)

self.current += 1

if self.toDest[numOfDisks+1]!=0:

self.move(numOfDisks, dest, last, self.current)

self.current += 1

self.toDest[numOfDisks]=1

if numOfDisks==self.r:

self.r -= 1

self.current = self.H1(numOfDisks-1, start,source, dest, aux,last, self.current)

return self.current;

# function to print the move performed

def move(self, aDisk, source, dest, currentStep):

print("Move ", self.current, ": Move disk ", aDisk, " from ", source, " to ", dest)

File: main.py

Code as text:

import hanoi

if __name__=="__main__":

test = hanoi.Towers()

Sample run:

P.s. Ask any doubts in comments and don't forget to rate the answer.