Steven Minsker

  • Citations Per Year
Learn More
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 additional restriction that rings cannot move directly from(More)
We propose another simple Towers of Hanoi variant, a hybrid between classical Hanoi and linear Hanoi, in which the rules governing movement depend on ring color. An optimal algorithm is presented. The problem and its heavily recursive solution are <i>not</i> difficult; perhaps one of its more interesting facets is that the optimality proof uses simultaneous(More)
The Little Towers of Antwerpen problem is a simple variant of the Towers of Hanoi problem requiring the interchanging of two stacks (black, white) of N rings using the third tower as a spare, subject to the usual rules governing ring movement. An optimal algorithm for the problem is presented and its performance is analyzed.  2005 Elsevier B.V. All rights(More)
f3 real. (See, for instance, [1], p. 224, ex. 4.) We offer the following proof whic h, although it also uses Bieberbach's result, is considerably different. PROOF: Let cP (z) J~ . Then cP sends the open unit disk into itself. Let cP 1= cP and inductively 1 a? define cPn=cP OcPlI t. If cPll(Z)=An,1 z+AIl,z Z2+ . .. ,it is clear that A"'=M' A I ,2= M' AII ,I(More)
  • 1