3Blue1Brown
Binary, Hanoi, and Sierpinski, part 2 (2016x22)
Ημερομηνία προβολής: Νοέ 25, 2016
After seeing how binary counting can solve the towers of Hanoi puzzle in the last video, here we see how ternary counting solve a constrained version of the puzzle, and how this gives a way to walk through a Sierpinski triangle graph structure.
- Πρώτη προβολή: Μαρ 2015
- Επεισόδια: 131
- Ακόλουθοι: 0