怎么用递归法编写简单的汉诺塔java程序

package Hanoi;

import java.awt.*;
import java.io.*;
import java.awt.event.*;

public class Hanoi {

public static void main(String args[]) throws IOException {
Hanoi aa = new Hanoi();
aa.go();
}

public void go() throws IOException {
int n;
BufferedReader buf;
buf = new BufferedReader(new InputStreamReader(System.in));
System.out.print("请输入盘数：");
n = Integer.parseInt(buf.readLine());
Hanoi hanoi = new Hanoi();
hanoi.move(n, 'A', 'B', 'C');
}

public void move(int n, char a, char b, char c) {
if (n == 1) {
System.out.println("盘 " + n + " 由 " + a + " 移至 " + c);
} else {
move(n - 1, a, c, b);
System.out.println("盘 " + n + " 由 &q