
06512820
j
2016a.00796
Metz, James
Twists on the tower of Hanoi.
Math. Teach. (Reston) 107, No. 9, 712715 (2014).
2014
National Council of Teachers of Mathematics (NCTM), Reston, VA
EN
I30
K20
A20
puzzles
generalization
sum of powers of 2
binary notation
alternating colours
http://www.nctm.org/Publications/mathematicsteacher/2014/Vol107/Issue9/DelvingDeeper_TwistsontheTowerofHanoi/
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 daughterinlaw 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?"