3Blue1Brown
Binary, Hanoi and Sierpinski, part 1
How couting in binary can solve the famous tower's of hanoi problem.
3Blue1Brown
Binary, Hanoi, and Sierpinski, part 2
How counting in Ternary can solve a variant of the Tower's of Hanoi puzzle, and how this gives rise to a beautiful connection to Sierpinski's triangle.
Massachusetts Institute of Technology
Mit: Blossoms: The Towers of Hanoi: Experiential Recursive Thinking
After viewing video components, students use manipulatives to work with the famous Towers of Hanoi problem. The goal is for learners to begin to understand recursive logic and thinking, relevant to computer scientists, mathematicians,...