YoVDO

Tower of Hanoi in Python

Offered By: Great Learning via YouTube

Tags

Python Courses Dynamic programming Courses Algorithmic Problem Solving Courses Recursion Courses Mathematical Puzzles Courses

Course Description

Overview

Explore the Tower of Hanoi problem in this 44-minute video tutorial, focusing on its implementation using Python and dynamic programming concepts. Learn about solving the puzzle for 3, 4, and n disks, understand the recursive approach, and dive into Python code examples. Discover the complexity analysis of the Tower of Hanoi algorithm and gain insights into applying programming techniques to mathematical puzzles and games. Perfect for computer science enthusiasts and those interested in enhancing their problem-solving skills through practical programming applications.

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

Related Courses

Intro to Theoretical Computer Science
Udacity Power and elegance of computational thinking
The University of Oklahoma via Janux Comparing Genes, Proteins, and Genomes (Bioinformatics III)
University of California, San Diego via Coursera Algoritmi quotidiani
University of Urbino via EMMA Competitive Programmer's Core Skills
Saint Petersburg State University via Coursera