The Tower of Hanoi with a Special Rule

This is the second exercise about the Tower of Hanoi. But this time we have a 3rd rule which states, that a plate can only be moved to its neighbor pole. We will find a recursive formula, proof it and we will also show that during one game, plates are arranged in every possible configuration.

⏰ Timeline 00:00 Exercise 00:29 Finding recursive formula 02:51 Finding closed formula 04:05 Proofing closed formula by induction 05:57 Show that plates are arranged in every possible configuration

🔢 Recursive formula T(n) = 3 * T(n-1) + 2 T(1) = 2

🔢 Closed formula T(n) = 3^n - 1

📜 All Discrete Mathematics Exercises https://www.youtube.com/playlist?list=PLY9Po-aXYcD6LdOzLeBhcHIShPwCQNeSD

📜 All Linear Algebra Exercises https://www.youtube.com/playlist?list=PLY9Po-aXYcD5BnL_9CcYy421JLvwn9XHH

🖼️ Thumbnail icon credits Pyramid icon made by Freepik from www.flaticon.com Curve Arrow made by Freepik from www.flaticon.com

🎵 Music Drops In Mind by Le Gang https://soundcloud.com/thisislegang Creative Commons — Attribution 3.0 Unported — CC BY 3.0 http://creativecommons.org/licenses/by/3.0/ Music promoted by Audio Library https://youtu.be/nRIG-9W2KNA ... https://www.youtube.com/watch?v=ysFy4I8GzuA