id: 06512820
dt: j
an: 2016a.00796
au: Metz, James
ti: Twists on the tower of Hanoi.
so: Math. Teach. (Reston) 107, No. 9, 712-715 (2014).
py: 2014
pu: National Council of Teachers of Mathematics (NCTM), Reston, VA
la: EN
cc: I30 K20 A20
ut: puzzles; generalization; sum of powers of 2; binary notation; alternating
colours
ci:
li: http://www.nctm.org/Publications/mathematics-teacher/2014/Vol107/Issue9/Delving-Deeper_-Twists-on-the-Tower-of-Hanoi/
ab: From the text: At a party that I attended, the hosts gave their guests the
Tower of Hanoi puzzle with alternating dark and light discs and a
challenge to move the 7 discs to a new post. (I disqualified myself
because I knew how to solve the challenge.) However, the hosts’ son
and daughter-in-law misunderstood the directions and moved the dark
discs to one side post and the light discs to the other side post. I
immediately wondered, “How many moves did they take, assuming that
they made the most efficient moves? How can their interpretation of the
problem be generalized to $n$ discs?"
rv: