The linear twin Towers of Hanoi problem
β
Minsker, Steven
π
Article
π
2007
π
Association for Computing Machinery
β 543 KB
We propose a simple new variation of the Towers of Hanoi problem, in which there are three pegs arranged in a row and there are two stacks (black, white) of n rings each, initially located on the end pegs. The object is to exchange the stacks in accordance with the usual Hanoi rules, and with the ad