Re:From Tower of Hanoi to Counting Bits (2011)
by bear8642 on Sunday March 01, 2020 @09:47AM
(#22457027)
Could you explain why that's true? - get that it works but don't understand why
[ Parent
| on HN ]
Re:From Tower of Hanoi to Counting Bits (2011)
by tromp on Monday March 02, 2020 @03:51AM
(#22462757)
I never constructed a proof either, but it would rest on the observation that the i'th smallest disc (i=1..no_of_discs)
moves every 2^i-th step in the same direction (+1 mod 3 for odd i and -1 mod 3 for even i).