سورس مسئله برج هانوی (Towers Of Hanoi) با جاوا (Java)

public class TowersOfHanoi {
    public static void move(int n, int startPole, int endPole) {
        if (n== 0){
            return;
        }
        int intermediatePole = 6 - startPole - endPole;
        move(n-1, startPole, intermediatePole);
        System.out.println("Move " +n + " from " + startPole + " to " +endPole);
        move(n-1, intermediatePole, endPole);
    }
    public static void main(String[] args) {
        move(5, 1, 3);
    }
}