Torre de Hanói - Aula 01 - Regras, Como resolver e Fórmula da quantidade de movimentos

This video presents the Tower of Hanoi and its rules. I show how to solve the Tower of Hanoi and how to find the minimum amount of movement to solve it, using a recursive formula. Content studied in the Computational Thinking course at UNIVESP. Video sequence of the Tower of Hanoi: #1 Tower of Hanoi - How to solve and Number of moves    • Torre de Hanói - Aula 01 - Regras, Como re...   #2 Demonstration by induction of the formula for the number of moves of the Tower of Hanoi    • Torre de Hanói - Aula 02 - Demonstração po...   #3 Solving the Tower of Hanoi using a recursive algorithm    • Torre de Hanói - Aula 03 - Resolução da To...   💻📱 Channel Playlists: Pre-Calculus:    • Pré-Cálculo   Calculus I:    • Cálculo I - Limite, Derivada e Integral   Basic Math:    • Matemática Básica - UNIVESP   Instagram: @professordouglasmaioli