汉诺塔游戏求解

HanoiTowers.java

/**
 * 汉诺塔游戏求解
**/
class HanoiTowers{
	public static void main(String[] args){
		solve(3, "A", "B", "C");
	}
	
	//递归方法对汉诺塔游戏求解
	public static void solve(int numberOfDisks, String startPole, String tempPole, String endPole){
		if(numberOfDisks == 1){
			System.out.println("The Disk " + numberOfDisks + " move: " + startPole + " ----> " + endPole);
		}else{
			solve(numberOfDisks-1, startPole, endPole, tempPole);
			System.out.println("The Disk " + numberOfDisks + " move: " + startPole + " ----> " + endPole);
			solve(numberOfDisks-1, tempPole, startPole, endPole);
		}
	}
}