dbc2201/TowerOfHanoi

Tower of Hanoi

Java Programming Course

---

Course 1: Problem-Solving and Computational Thinking using Java

Sprint 7: Implementing Recursion

---

Problem Statement

Write a program in Java to calculate the minimum number of steps required to solve the Tower of Hanoi problem for n disks.

---

Task

1. Open the source code file and complete the code.
2. Open the test case file and run the test cases to check your code.

---

Fun Resource

1. Tower of Hanoi Animation by Y. Daniel Liang
2. Tower of Hanoi - Math is Fun