Binary, Hanoi, and Sierpinski, part 2

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. Thanks to Desmos for their help in supporting this video. They’re hiring, and anyone interested should check out Thanks to all Patreon supporters as well, with a special shoutout to the following patrons: CrypticSwarm, Ali Yahya, Jua