Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Tower of Hanoi in Python

Great Learning via YouTube

Start learning Write review
Coursera Ad

Learn AI, Data Science & Business — Earn Certificates That Get You Hired

Learn More → Noble Desktop Ad

Live Online Classes in Design, Coding & AI — Small Classes, Free Retakes

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This course explains the Tower of Hanoi puzzle, its recursive solution for three, four, and n disks, and its implementation in Python. It also analyzes the algorithm’s time and space complexity.

Syllabus

Agenda for Tower of Hanoi.
Tower of Hanoi Introduction.
Tower of Hanoi for n Disks.
Tower of Hanoi for 3 Disks.
Tower of Hanoi for 4 Disks.
Tower of Hanoi using recursion.
Tower of Hanoi in Python - Codes.
Complexity Analysis of Tower of Hanoi.
Summary.

Taught by

Great Learning

Reviews

Start your review of Tower of Hanoi in Python

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.