Steven Minsker

Learn 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)
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 continue our study, begun in [3], of the classical/linear Towers of Hanoi "hybrid" problem, in which there are three pegs arranged in a row, and the rules governing ring movement depend on ring color. Whereas [3] dealt with perfect to perfect configuration problems in a very straightforward manner, the current paper discusses deterministic and dynamic(More)
Pick 's th eo re m s tat es that , if/is a univalent analytic function on th e open unit di s k withf (O)= O andf'(O)=l, a nd Ifl~M, then 1f"~O)I~2(1_~). A new proof of th is res ult is given, a nd a comparison with the usual proof is made. Let !F denote the collection of all univalent analytic functions j:6.(0; 1) ~ q: with f(O) = 0 and f' (0) = 1. Such(More)
  • 1