汉诺塔

有三根相邻的柱子，标号为A，B，C，A柱子上从下到上按金字塔状叠放着n个不同大小的圆盘。
要把所有盘子一个一个移动到柱子B上，并且每次移动同一根柱子上都不能出现大盘子在小盘子上方，请问至少需要多少次移动?

设移动次数为H[n]。
1.首先我们是把A上面n-1个盘子移动到柱子C上，假设需要H[n-1] 次

2.然后把A上最大的一块放在B上，需要1次

3.最后把C上的n-1个盘子移动到B上，需要H[n-1] 次

由此我们得出表达式：

H[n] = 2*H[n-1] +1 (n>1），   H[1]= 1

求解:

java代码  

import java.util.Scanner; 

public class TowersOfHanoi {
  /** Main method */
  public static void main(String[] args) {
    // Create a Scanner
    Scanner input = new Scanner(System.in);
    System.out.print("Enter number of disks: ");
    int n = input.nextInt();

    // Find the solution recursively
    System.out.println("The moves are:");
    moveDisks(n, 'A', 'B', 'C');
  }

  /** The method for finding the solution to move n disks
      from fromTower to toTower with auxTower */
  public static void moveDisks(int n, char fromTower,
      char toTower, char auxTower) {
    if (n == 1) // Stopping condition
      System.out.println("Move disk " + n + " from " +
        fromTower + " to " + toTower);
    else {
      moveDisks(n - 1, fromTower, auxTower, toTower);
      System.out.println("Move disk " + n + " from " +
        fromTower + " to " + toTower);
      moveDisks(n - 1, auxTower, toTower, fromTower);
    }
  }
}

run:
Enter number of disks: 3
The moves are:
Move disk 1 from A to B
Move disk 2 from A to C
Move disk 1 from B to C
Move disk 3 from A to B
Move disk 1 from C to A
Move disk 2 from C to B
Move disk 1 from A to B
成功构建 (总时间: 6 秒)