Tower Of Hanoi by Recursion in Java

README.md

Tower of Hanoi

How's it is solved ?

Long steps ahead

To know more :

TOH.java

// TOH refers to Tower Of Hanoi.
public class TOH{
    // Defining a method which accepts parameters as: no of disks, name of rods (should match according to name of formal arguments passed).
    public void tower(int noOfDisks, String sourceRod, String destinationRod, String auxiliaryRod){
        if(noOfDisks == 1){
            System.out.format("\nRod %d moved from %s to %s",1,sourceRod,destinationRod);
            return ;
        }else{
            // Key Algorithms :
            tower(noOfDisks - 1, "Source Rod","Auxiliary Rod","Destination Rod");
            System.out.format("\nDisk %d moved from %s to %s",noOfDisks,sourceRod,destinationRod);
            tower(noOfDisks - 1, "Auxiliary Rod","Destination Rod","Source Rod");
        }        
    }

}

TOHDemo.java

// TOHDemo refers to Tower Of Hanoi Demo.
class TOHDemo{
    public static void main(String[] args){
        // This accepts the no of disks
        int noOfDisks = 4;
        TOH objectOne = new TOH();
        // Passing the no of disks and rod names to recursive function.
        objectOne.tower(noOfDisks,"Source Rod","Destination Rod","Auxilary Rod");
    }
}