public class 簡單漢諾塔遞歸實例分析 {
	public static void main(String args[]) {
		int  n =3;
		char a = 'A', b = 'B', c = 'C';
		hanio(n, a, b, c);
	}

	public static void hanio(int  n, char a, char b, char c) {
		if (n == 1)
			System.out.println(n+"號"+ "move " + a + " to " + c);
		else {
			hanio((n - 1), a, c, b);
			System.out.println(n+"號"+"move " + a + " to " + c);
			hanio((n - 1), b, a, c);
		}
	}
}