檔名稱: HanoiTower.java

package firststudy;
/**
 * 漢諾塔問題:
 * @author web
 *
 */
public class HanoiTower {
	static int count = 1 ;							//計算移動次數
	public static void main(String[] args) {
		move(3, 'A', 'B', 'C');
	}
	
	public static void move(int level, char a, char b, char c) {		
		if( level == 1) {
			System.out.println("第" + (count++) + "步 :" + "將  盤子 1 從  " + a + " 移動到  " + c);
		} else {
			move(level - 1, a, c, b);
			System.out.println("第" + (count++) + "步 :" + "將  盤子 "+ level + " 從  " + a + " 移動到  " + c);
			move(level - 1, b, a, c);
		}
	}
}
 

執行結果: