Unit 13, Section 1: The Towers of Hanoi and the RECURSIVE function

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.