Java program to solve Tower of Hanoi [using recurssion][isc]

Active member

The Tower of Hanoi or Towers of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks neatly stacked in order of size on one rod, the smallest at the top, thus making a conical s

The objective of the puzzle is to move the entire stack to another rod, obeying the following rules:

* Only one disk may be moved at a time.
* Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod.
* No disk may be placed on top of a smaller disk.

import java.io.*;

class toh
{
public static void main(String args[])throws IOException
{
hanoi obj=new hanoi();
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter number of rings");
int N=Integer.parseInt(br.readLine());
obj.ha('A','B','C',N);
}

}

class hanoi
{
void ha(char a,char b,char c,int n)
{
if(n==0)
System.out.println("WRONG INPUT !!!");
if(n==1)
System.out.println("Move from "+a+" to "+c);
if(n>1)
{
ha(a,c,b,n-1);
ha(a,b,c,1);
ha(b,a,c,n-1);
}
}
}