Skip navigation

Fun fact: Towers of Hanoi

Fun fact: Towers of Hanoi: Java: Recursion
Fun fact: Towers of Hanoi: Java: Recursion

The Towers of Hanoi is a mathematical puzzle whose solution illustrates recursion. Learn about this problem and how to solve for three pegs which can hold stacks of disks of different diameters.

Resume Transcript Auto-Scroll
Skill Level Intermediate
55m 27s
Duration
24,240
Views
Show More Show Less
Skills covered in this course
Developer Programming Languages Java

Continue Assessment

You started this assessment previously and didn't complete it. You can pick up where you left off, or start over.

Start Your Free Trial Now

Start your free trial now, and begin learning software, business and creative skills—anytime, anywhere—with video instruction from recognized industry experts.

Start Your Free Trial Now