Created Tower of Hanoi Algorithm

Java/Algorithms/towerOfHanoi.java

@@ -0,0 +1,24 @@
+// Java recursive program to solve tower of hanoi puzzle
+
+class GFG
+{
+	// Java recursive function to solve tower of hanoi puzzle
+	static void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod)
+	{
+		if (n == 1)
+		{
+			System.out.println("Move disk 1 from rod " + from_rod + " to rod " + to_rod);
+			return;
+		}
+		towerOfHanoi(n-1, from_rod, aux_rod, to_rod);
+		System.out.println("Move disk " + n + " from rod " + from_rod + " to rod " + to_rod);
+		towerOfHanoi(n-1, aux_rod, to_rod, from_rod);
+	}
+
+	// Driver method
+	public static void main(String args[])
+	{
+		int n = 4; // Number of disks
+		towerOfHanoi(n, \'A\', \'C\', \'B\'); // A, B and C are names of rods
+	}
+}