On this page you can try out the recursive solution for the Towers of Hanoi problem. You can right-click on the page and view the JavaScript source code, which follows the same algorithm as you would code in Java or C++.
Type the number of discs (0-32) in the box below and hit Enter. Or hit the I'm feeling lucky button.
Number of discs: