Hanruo Tower game - recursive call classic problem

code
public class hanio {
    public static void hanio(int n, String source, String destination, String helper){
        if (n<1){
            throw new RuntimeException("n must be >=1");
        }
        if (n==1){
            System.out.printf("Move a plate from %s post to %s\n", source, destination);
        }else{
            hanio(n-1, source, auxiliary, destination);
            System.out.printf("Move a plate from %s post to %s\n", source, destination);
            hanio(n-1, auxiliary, target, source);
        }
    }

    public static void main(String[] args) {
        hanio(3,"A","C","B");
    }
}

output result

move a plate from column A to column C move
a plate from column A to column B move
a plate from column C to column B move
a plate from column A to column C move
a plate from column B to column A
Move a plate from pillar B to C, move a plate from pillar
A to C

Related: Hanruo Tower game - recursive call classic problem