Java Program to solve Tower of Hanoi problem?

This example displays the way of using method for solving Tower of Hanoi problem( for 3 disks).

public class MainClass {
 public static void main(String[] args) {
 int nDisks = 3;
 doTowers(nDisks, 'A', 'B', 'C');
 }
 public static void doTowers(int topN, char from,
 char inter, char to) {
 if (topN == 1){
 System.out.println("Disk 1 from "
 + from + " to " + to);
 }else {
 doTowers(topN - 1, from, to, inter);
 System.out.println("Disk "
 + topN + " from " + from + " to " + to);
 doTowers(topN - 1, inter, from, to);
 }
 }
}

Output

Disk 1 from A to C
Disk 2 from A to B
Disk 1 from C to B
Disk 3 from A to C
Disk 1 from B to A
Disk 2 from B to C
Disk 1 from A to C

Java Program to solve Tower of Hanoi problem?