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 versi...