The complexity of Scotland Yard

An improved apparatus for the production of chenille wherein a bearing mounted flyer uprightly carries a plurality of spindles thereon and the filler thread spools position on the spindles in stationary relationship to the flyer itself. Each filler thread is continuously monitored by a stop motion device which serves to stop the mechanism upon detection of a broken yarn. Additionally, stop motion devices are provided for the warp threads and for the finished chenille product. The flyer and the finished yarn bobbins are simultaneously rotated by separate motors acting through separate shafts in a manner to relieve yarn tension when starting and stopping the apparatus. This arrangement also permits either clockwise or counter-clockwise rotation of the bobbins as desired. The lower steel band idler wheels are peripherally grooved to receive the outside warp threads to synchronize the speed of the inside warp threads and the outside warp threads. An improved cutter blade mechanism is employed which permits easy vertical adjustment of the blade at the front of the machine, and the blade shaft is reciprocal within a self-aligning type of bearing. A vacuum air cleaning system with intakes directly under the cutting blade and near the finished yarn bobbins provides for a completely self cleaning apparatus.

[1]  Peter J. Cameron,et al.  Some combinatorics of imperfect information , 2001, Journal of Symbolic Logic.

[2]  Journal of the Association for Computing Machinery , 1961, Nature.

[3]  Thomas J. Schaefer,et al.  On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

[4]  J. Reif,et al.  Lower bounds for multiplayer noncooperative games of incomplete information , 2001 .

[5]  A. Waters.  Winning ways. , 2002, Nursing standard (Royal College of Nursing (Great Britain) : 1987).

[6]  Erik D. Demaine,et al.  The Complexity of Clickomania , 2001, ArXiv.

[7]  Wilfrid Hodges,et al.  Compositional Semantics for a Language of Imperfect Information , 1997, Log. J. IGPL.

[8]  D. Koller,et al.  The complexity of two-person zero-sum games in extensive form , 1992 .

[9]  Jouko A. Väänänen,et al.  On the semantics of informational independence , 2002, Log. J. IGPL.

[10]  David S. Johnson,et al.  The complexity of checkers on an N × N board , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[11]  Edward M. Reingold,et al.  The Complexity of Pursuit on a Graph , 1995, Theor. Comput. Sci..

[12]  John H. Reif,et al.  The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..

[13]  Aviezri S. Fraenkel,et al.  Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N , 1981, ICALP.

[14]  Aviezri S. Fraenkel,et al.  Combinatorial Games: selected Bibliography with a Succinct Gourmet Introduction , 2012 .

[15]  David Lichtenstein,et al.  GO Is Polynomial-Space Hard , 1980, JACM.

[16]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[17]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[18]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[19]  R. Kaye.  Minesweeper is NP-complete , 2000 .