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 ...
==========
Welcome back! So, in the last part, I showed a way to solve Towers of Hanoi just by counting up in binary, a solution that I learned from computer scientist Keith Schwarz. If somehow you landed here without watching that you probably want to go check it out Here, in this video, I want to describe a constrained variant of that puzzle and how it relates to finding a curve that fills Sierpinski's triangle. The problem variant is that ... you can think these discs are in a line. You're only allowed to move a disk from one spindle to an adjacent one. And, so, now the question is, solve Towers of Hanoi So, for example, in the previous one, we start by moving disc 0 to B, and the next move was to move disc 1 over to C, but you can't do that because you can get 1 straight over to ...
==========
Welcome back! So, in the last part, I showed a way to solve Towers of Hanoi just by counting up in binary, a solution that I learned from computer scientist Keith Schwarz. If somehow you landed here without watching that you probably want to go check it out Here, in this video, I want to describe a constrained variant of that puzzle and how it relates to finding a curve that fills Sierpinski's triangle. The problem variant is that ... you can think these discs are in a line. You're only allowed to move a disk from one spindle to an adjacent one. And, so, now the question is, solve Towers of Hanoi So, for example, in the previous one, we start by moving disc 0 to B, and the next move was to move disc 1 over to C, but you can't do that because you can get 1 straight over to ...
