Los Alamos chess

























































































a b c d e f
6 a6 black rook b6 black knight c6 black queen d6 black king e6 black knight f6 black rook 6
5 a5 black pawn b5 black pawn c5 black pawn d5 black pawn e5 black pawn f5 black pawn 5
4 a4 b4 c4 d4 e4 f4 4
3 a3 b3 c3 d3 e3 f3 3
2 a2 white pawn b2 white pawn c2 white pawn d2 white pawn e2 white pawn f2 white pawn 2
1 a1 white rook b1 white knight c1 white queen d1 white king e1 white knight f1 white rook 1
a b c d e f


Los Alamos chess setup



Los Alamos chess (or anti-clerical chess[citation needed]) is a chess variant played on a 6×6 board without bishops. This was the first chess-like game played by a computer program. This program was written at Los Alamos Scientific Laboratory by Paul Stein and Mark Wells for the MANIAC I computer[1] in 1956. The reduction of the board size and the number of pieces from standard chess was due to the very limited capacity of computers at the time.


.mw-parser-output .tocleft{float:left;clear:left;width:auto;background:none;padding:.5em .8em 1.4em 0;margin-bottom:.5em}.mw-parser-output .tocleft-clear-left{clear:left}.mw-parser-output .tocleft-clear-both{clear:both}.mw-parser-output .tocleft-clear-none{clear:none}



Contents






  • 1 Game rules


  • 2 Los Alamos trials


    • 2.1 The third game




  • 3 See also


  • 4 References


  • 5 Further reading


  • 6 External links











Game rules


The starting position is illustrated. All rules are as in chess except:



  • there is no pawn double-step move, nor is there en passant capture;


  • pawns may not promote to bishops;

  • there is no castling.



Los Alamos trials


The computer played three games. The first it played against itself. The second one was against a strong human player, who played without a queen. The human player won. In the third game, MANIAC I played against a laboratory assistant who had been taught the rules of chess in the preceding week specifically for the game. The computer won, marking the first time that a computer had beaten a human player in a chess-like game.[1][2]



The third game























































































a b c d e f
6 a6 b6 c6 black king d6 e6 f6 6
5 a5 b5 c5 black knight d5 e5 white knight f5 5
4 a4 black rook b4 c4 black pawn d4 white queen e4 f4 black pawn 4
3 a3 b3 c3 black pawn d3 white pawn e3 f3 3
2 a2 b2 c2 white pawn d2 e2 white pawn f2 2
1 a1 b1 white rook c1 d1 white king e1 f1 white rook 1
a b c d e f

Final position after 23.Ne5#



White: MANIAC I   Black: Beginner
1.d3 b4 2.Nf3 d4 3.b3 e4 4.Ne1 a4 5.bxa4 Nxa4 6.Kd2 Nc3 7.Nxc3 bxc3+ 8.Kd1 f4 9.a3 Rb6 10.a4 Ra6 11.a5 Kd5 12.Qa3 Qb5 13.Qa2+ Ke5 14.Rb1 Rxa5 15.Rxb5 Rxa2 16.Rb1 Ra5 17.f3 Ra4 18.fxe4 c4 19.Nf3+ Kd6 20.e5+ Kd5 21.exf6=Q Nc5 22.Qxd4+ Kc6 23.Ne5# 1–0[3]



See also


  • Minichess


References





  1. ^ ab Pritchard (1994), p. 175


  2. ^ Pritchard (2007), p. 112


  3. ^ Pritchard (1994), p. 176



Bibliography



  • Anderson, H. L. (1986). "Metropolis, Monte Carlo, and the MANIAC", Los Alamos Science, N 14, Fall 1986, pp. 104-05.


  • Pritchard, D. B. (1994). "Los Alamos Chess". The Encyclopedia of Chess Variants. Games & Puzzles Publications. ISBN 0-9524142-0-1..mw-parser-output cite.citation{font-style:inherit}.mw-parser-output .citation q{quotes:"""""""'""'"}.mw-parser-output .citation .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-limited a,.mw-parser-output .citation .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/4/4c/Wikisource-logo.svg/12px-Wikisource-logo.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-maint{display:none;color:#33aa33;margin-left:0.3em}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}


  • Pritchard, D. B. (2007). "Los Alamos Chess". In Beasley, John. The Classified Encyclopedia of Chess Variants. John Beasley. ISBN 978-0-9555168-0-1.



Further reading



  • Chess Review, January 1957


External links




  • Los Alamos Chess by Hans L. Bodlaender, The Chess Variant Pages


  • A short history of computer chess by Frederic Friedel


  • BrainKing.com - internet server to play Los Alamos chess.









Popular posts from this blog

Guess what letter conforming each word

Port of Spain

Run scheduled task as local user group (not BUILTIN)