About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Unit 13, Section 1: The Towers of Hanoi and the RECURSIVE function
Related Media
This video and others in this unit describe how you can write PL/I code to solve the Towers of Hanoi problem, which is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters, which can slide onto any rod. Through this example, this video shows you how to write the code to make all the moves, the code to make one move, the code to initialize the towers, and more.
- Tags
- Appears In
Loading