import java.util.Scanner;
Demonstration of a solution to the classic Tower of Hanoi problem
@author
@version
public class TowerOfHanoi{
public static void towerOfHanoi( int n, String startingTower, String spareTower, String endingTower){
if( n == 0 ){
return;
}
towerOfHanoi( n - 1, startingTower, endingTower, spareTower);
System.out.println("Move 1 disc from " + startingTower + " to " + endingTower);
towerOfHanoi( n - 1, spareTower, startingTower, endingTower);
}
public static void main( String[] args ){
Scanner stdinScanner = new Scanner( System.in );
int numDiscs = 0;
System.out.print( "Please enter the number of discs: " );
numDiscs = stdinScanner.nextInt();
String startingTower = "tower 1";
String spareTower = "tower 2";
String endingTower = "tower 3";
towerOfHanoi( numDiscs, startingTower, spareTower, endingTower );
}
}