Wikispaces : chessprogramming - items matching description

Astro 64

GerdIsenberg — Thu, 21 Dec 2017 20:08:26 GMT

Home * Engines * Astro 64

Astro 64,
the first Romanian chess program, written by Viorel Darie for the Felix C-256 mainframe computer at the Computer Institute of Bucharest ^[1], developed in about two years starting from 1976. Astro 64 searched about 10,000 positions per minute (166 nps) on the Felix C-256, and played a public match of one move per week in 1978/79 against the readers of a Romanian newspaper, also published in Personal Computing ^[2] .

The Match

^[3]

[Event "Public Chess Match"]
[Site "Romania"]
[Date "1978/79"]
[Round "?"]
[White "Newspaper Readers"]
[Black "Astro 64"]
[Result "1-0"]
 
1.e4 e5 2.Nf3 Nc6 3.Bb5 a6 4.Ba4 b5 5.Bb3 Nf6 6.O-O Nxe4 7.Re1 d5 8.
d3 Nf6 9.Nxe5 Nxe5 10.Rxe5+ Be6 11.Bg5 Bd6 12.Re1 O-O 13.Nd2 h6 14.
Bh4 g5 15.Bg3 Bxg3 16.fxg3 Bg4 17.Nf3 Qd7 18.Qd2 Bxf3 19.gxf3 Rfe8 20.
d4 Rxe1+ 21.Rxe1 a5 22.c3 a4 23.Bc2 Re8 24.Re5 c6 25.Bf5 Qd8 26.h4
gxh4 27.Qxh6 Rxe5 28.dxe5 Qb6+ 29.Kg2 hxg3 30.Qg5+ Kf8 31.exf6 Qf2+
32.Kh3 Qh2+ 33.Kg4 c5 34.Qg7+ 1-0

Publications

Ulrich Friedberg (1978). A Roumanian Rhapsody - Computer Felix C-256 Plays Chess. Personal Computing, Vol. 2, No. 10, pp. 76
Editor (1978). Rumbles from Roumania. Personal Computing, Vol. 2, No. 12, pp. 62 » Astro 64
Editor (1979). Romanian Computer Loses to Newspaper Readers. Personal Computing, Vol. 3, No. 3, pp. 45

External Links

References

^ Viorel Darie - Cantec pentru Bucovina - index.html (Romanian)
^ Ulrich Friedberg (1978). A Roumanian Rhapsody - Computer Felix C-256 Plays Chess. Personal Computing, Vol. 2, No. 10, pp. 76
^ Editor (1979). Romanian Computer Loses to Newspaper Readers. Personal Computing, Vol. 3, No. 3, pp. 45

What links here?

Page	Date Edited
Astro 64	Dec 21, 2017
Engines	Mar 10, 2018
Labirint 64	Dec 21, 2017
Personal Computing	Dec 27, 2017
Viorel Darie	Dec 21, 2017

Up one level

Atlas

GerdIsenberg — Sun, 05 Nov 2017 10:23:37 GMT

Home * Engines * Atlas

		Atlas, an early chess program written in 1967 by Alex Bell at Atlas Computer Laboratory, Chilton. It was basically a resurrected, cleaned up Algol version of Bell's and Barricelli's old program from the early 60s to test evolutionary theories, which had an evaluation function based purely on mobility - at that time the first fully legal chess program to run in England ^[1], and likely also the base of Barricelli's WCCC 1974 entry Freedom. Atlas, running on an ICL Atlas computer ^[2], looked three plies ahead with alpha-beta, and would accept almost any captures in that depth with weighting on swaps of the more powerful pieces, i.e. it would always swap a queen for a queen. If no captures were present it prepared to castle or mini-maximised its mobility. A slight modification prevented it from moving its queen in the first 5 moves ^[3]. Atlas played a few sparring games against Lancaster ^[4], John Scott's program, then dubbed "Scott" ^[5], and largely suffered from horizon effect.
Atlas and the Hesperides ^[6]

Move Generation

A description of Atlas' move generation techniques along with a mate-in-two solver is given with Algol source code listing in Games Playing with Computers, 3.1 Chess ^[7]. Atlas uses two distinct 8x8 boards [1:65] and piece lists [O:16] for white and black man with identical piece coding, passing the boards per reference as 'mymanin' or 'opponents' dependent on side to move. Pre-calculated rook and bishop tables contain one vector of direction increments, i.e. east (+1), west (-1), north (+8), and south (-8) for rooks, and further for each square a vector of ray-direction terminal destination squares. The embedded routine 'rookorbishopmove' in scope of the outer move generation routine loops over all four directions, gets increment and terminal target square from the rook or bishop table, and iterates the destination along the ray. Inside the ray-loop it tests whether the target is occupied by an own man, to terminate the ray-loop, otherwise it stores the move, and then tests to break after a capture or even an illegal king capture with an extra exit 'cutoff'.

procedure rookorbishopmove(rookorbishop);
  integer array rookorbishop;
  begin 
    for j := 0 step 1 until 3 do
    begin 
      k := rookorbishop[j]; k is increment:
      l := rookorbishop[4 * square + j]; l is terminal square
      for i := square + k step k until l do 
      begin 
        if mymanin[i] ≠ 0 then goto newdirection;
        c := c+1;
        moves[c] := i;
        if opponents[i] ≠ 0 then 
        begin
          if opponents[i] = 6 then goto cutoff else goto newdirection
        end
      end;
newdirection:
    end
  end of rookorbishopmove;

Master

In the early 70s, Atlas evolved to Master in collaboration with Peter Kent, and later with John Birmingham and chess expert John Waldron, while Alex Bell finally left Chilton.

Namesake

Atlas by Andrés Manzanares Campillo

Publications

Alex Bell (1972). Games Playing with Computers. Allen & Unwin, index
Alex Bell (1978). The Machine Plays Chess? Pergamon Press, amazon

External Links

Chess Program

Games Playing with Computers | Chapter 3: Board Games, in Alex Bell (1972). Games Playing with Computers. Allen & Unwin
MASTER at IFIPS. Excerpt from Alex Bell (1978). The Machine Plays Chess?. Pergamon Press, hosted by Atlas Computer Laboratory from Rutherford Appleton Laboratory (RAL)

Misc

References

^ MASTER at IFIPS. Excerpt from Alex Bell (1978). The Machine Plays Chess?. Pergamon Press, hosted by Atlas Computer Laboratory from Rutherford Appleton Laboratory (RAL)
^ Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)
^ MASTER at IFIPS. Excerpt from Alex Bell (1978). The Machine Plays Chess?. Pergamon Press, hosted by Atlas Computer Laboratory from Rutherford Appleton Laboratory (RAL)
^ John J. Scott (1969). Lancaster vs. Mac Hack. ACM SIGART Bulletin, Vol. 16
^ Chess programs: Scott from Alex Bell (1972). Games Playing with Computers. Allen & Unwin
^ Atlas and the Hesperides by John Singer Sargent, between circa 1922 and circa 1925, current location: Museum of Fine Arts, Boston, Wikimedia Commons
^ Games Playing with Computers | Chapter 3: Board Games, in Alex Bell (1972). Games Playing with Computers. Allen & Unwin

What links here?

Page	Date Edited
Alex Bell	Mar 1, 2017
AtlanChess	Sep 15, 2016
Atlas	Nov 5, 2017
Atlas (ESP)	Jan 28, 2018
Atlas Computer Laboratory	Feb 10, 2015
Engines	Mar 10, 2018
John J. Scott	Aug 30, 2016
Lancaster	Aug 30, 2016
Master	Dec 28, 2017
Move Generation	Jan 29, 2018
Peter Kent	Jan 7, 2016
Table-driven Move Generation	Feb 19, 2017

Up one Level

Awit

GerdIsenberg — Fri, 22 Dec 2017 18:32:00 GMT

Home * Engines * Awit (Wita)

		Awit, a chess program written by Tony Marsland. The original program, which played in the first ACM 1970 in New York was called Wita. The name was derived from Witan, which was for a meeting of wise men. The inspiration for Wita came from the 1966 Fall Joint Computer Conference ^[1] in San Francisco and had been impressed by Richard Greenblatt's talk about Mac Hack. In about 1977, the name was changed to Awit for two reasons. First, to put the program nearer the top of an alphabetical list and second (more importantly) to reflect the program's propensity to play subtle moves that were rife with fatal flaws. Awit-Wita was written in Algol W ^[2] and ran on IBM 370 under the Michigan Terminal System (MTS) ^[3] . Awit is a selective Shannon type B searcher with a lot of chess knowledge implemented, and therefor with 8 Nodes per second ^[4] extremely slow with an impressive strength / nodes-evaluated ratio, despite its inherent tactical flaws up and then.
Anglo-Saxon king with his Witan ^[5]

Quotes

Quote from the ACM 1980 booklet ^[6]

Awit is one of the few programs that carries out extensive forward pruning. During the course of the three minute move, Awit examines about 200 nodes! This might be contrasted with the 30,000,000 - 40,000,000 nodes examined by Belle. Awit is written in Algol W. A moderately large book of 10,000 lines is used.

Achievements

Awit's greatest tournament success was the shared second place at the WCCC 1983 in New York, while almost the same program played its last tournament at WCCC 1986 in Cologne only to serve as a benchmark for other programs ^[7].

Photos & Games

BS6676

A real cliffhanger between Wita and Bs6676 from WCCC 1977, Albin Countergambit ^[8] :

[Event "2nd World Computer Chess Championship"]
[Site "Toronto, Canada"]
[Date "1977.08.08"]
[Round "3"]
[White "Wita"]
[Black "Bs6676"]
[Result "1/2-1/2"]
 
1.d4 d5 2.c4 e5 3.dxe5 d4 4.e4 f5 5.Bd3 Nc6 6.Nf3 Bb4+ 7.Ke2 fxe4 
8.Bxe4 Bg4 9.Qa4 d3+ 10.Kf1 Qd7 11.Bxc6 Qxc6 12.Qxb4 Bxf3 13.gxf3
Qxf3 14.Rg1 d2 15.Bxd2 Qd1+ 16.Be1 Qd3+ 17.Kg2 Qg6+ 18.Kh1 Qe4+ 
19.Rg2 a5 20.Qc3 Qf5 21.Rxg7 O-O-O 22.Qxa5 Qe4+ 23.f3 Qxf3+ 24.Kg1 
Qe3+ 25.Kh1 Qe4+ 26.Kg1 Qe3+ 27.Kh1 Qf3+ 28.Kg1 Qe3+ 1/2-1/2

Ostrich

ACM 1979, Round 4, Monroe Newborn standing, Tony Marsland, Ostrich 80 - Awit ^[9]

[Event "10th North Am.CC (ACM)"]
[Site "Detroit USA"]
[Date "1979.10.30"]
[Round "4"]
[White "Ostrich 80"]
[Black "Awit"]
[Result "1/2-1/2"]
 
1.e4 c5 2.Nf3 d6 3.Bb5+ Nc6 4.O-O Bd7 5.Nc3 Nf6 6.d4 a6 7.Bxc6 Bxc6 8.Be3 Qb6
9.b3 Nxe4 10.Nxe4 Bxe4 11.c3 Qc6 12.Qe2 O-O-O 13.Ng5 Bg6 14.Nf3 Bh5 15.Bg5 Kd7
16.Rad1 Bxf3 17.gxf3 cxd4 18.cxd4 Qd5 19.f4 h6 20.Bh4 g5 21.fxg5 hxg5 22.Bg3 Rc8
23.Rd3 Bg7 24.Rfd1 e6 25.Qe3 b5 26.f4 f6 27.fxg5 Rc2 28.R1d2 Rc1+ 29.Be1 Qxg5+
30.Qxg5 fxg5 31.Re3 Ke7 32.Kg2 g4 33.Ree2 Bf6 34.Bg3 Bg5 35.Rd3 d5 36.a4 bxa4
37.bxa4 Ra1 38.Be5 Rg8 39.Kg3 Bh6 40.Kh4 Rxa4 41.Rg2 a5 42.Rxg4 Rf8 43.Kh5 Bc1
44.Rg7+ Rf7 45.Bd6+ Kxd6 46.Rxf7 Rc4 47.Kg6 Rc2 48.h4 a4 49.Rff3 a3 50.Rb3 a2
51.Rb6+ Kc7 52.Ra6 Kb7 53.Ra4 Kb6 54.Rf6 Kb5 55.Ra8 Be3 56.Rxe6 Bxd4 57.Rb8+ Ka5
58.Ra8+ Kb5 59.Rb8+ Kc4 60.Rc6+ Kd3 61.Rb3+ Bc3 62.Ra6 Rg2+ 63.Kh5 Kc4 64.Rba3 
a1=Q 65.R6a4+ Kd3 66.Rxa1 Bxa1 67.Rxa1 Rg8 68.Rd1+ Ke4 69.Re1+ Kf5 70.Rf1+ Ke4 
71.Re1+ Kf4 72.Rd1 Ke5 73.Re1+ Kd6 74.Rd1 Ke5 75.Re1+ Kd6 76.Rd1 Ke5 1/2-1/2

Phoenix

WCCC 1983, round 5, Phoenix - Awit ^[10]

[Event "WCCC 1983"]
[Site "New York, USA"]
[Date "1983.10.25"]
[Round "5"]
[White "Phoenix"]
[Black "Awit"]
[Result "0-1"]
 
1.d4 Nf6 2.Bg5 Ne4 3.Bh4 d5 4.f3 Nf6 5.Nd2 g6 6.e4 Nbd7 7.e5 Nh5 8.c4 Bh6
9.cxd5 Nb6 10.g4 Nf4 11.g5 Bg7 12.Ne4 Nbxd5 13.Bg3 h6 14.Qd2 hxg5 15.Nxg5
Nh5 16.N1h3 f6 17.exf6 exf6 18.Ne4 Qe7 19.Qe2 Bxh3 20.Bxh3 Nhf4 21.Nxf6+ 
Bxf6 22.Qxe7+ Kxe7 23.Bf1 Bxd4 24.O-O-O Be3+ 25.Kb1 Rad8 26.Bd3 c6 27.Rhe1 
Kf6 28.Be4 g5 29.Rh1 Rh3 30.Rhe1 Nh5 31.Bxd5 Rxd5 32.Rxd5 cxd5 33.Rxe3 Nxg3
34.hxg3 Rxg3 35.Rb3 g4 36.Rxb7 Rxf3 37.Rxa7 g3 38.Ra6+ Kg5 39.Ra8 Rf1+ 
40.Kc2 Rf2+ 41.Kc3 d4+ 42.Kxd4 Rxb2 43.Kc3 Rb6 44.Rd8 Kf5 45.Rd2 Ke4 46.a4
Rc6+ 47.Kb4 Kf3 48.Rd3+ Kf4 49.Rd4+ Ke3 50.Rg4 Kf2 51.Rf4+ Ke2 52.Rf7 Rc8
53.Re7+ Kf2 54.Rf7+ Kg1 55.a5 Rh8 56.a6 g2 57.a7 Kh2 58.a8=Q 0-1

Source Code

Awit source code (pdf)

Publications

Paul Rushton, Tony Marsland (1973). Current Chess Programs: A Summary of their Potential and Limitations. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, pdf
Tony Marsland (1974). A users guide to WITA, a chess program. Technical report, University of Alberta ^[11]
Harry Shershow (1979). A Little Bit is a Little Better. Personal Computing, Vol. 3, No. 4, pp. 61 » Sargon - Awit

Forum Posts

What AWIT(y) chess program. Tony Marsland's, that is.... by Carey, CCC, March 17, 2010
Windows executable and C-sources by Jim Ablett in the same thread

External Links

Chess Program

Misc

Witenagemot from Wikipedia
Awit from Wikipedia (form of Filipino poetry)

References

What links here?

Page	Date Edited
ACM 1970	Jun 13, 2015
ACM 1975	Jan 19, 2018
ACM 1976	Dec 27, 2017
ACM 1977	Dec 22, 2017
ACM 1978	Dec 23, 2017
ACM 1979	Apr 3, 2017
ACM 1980	Dec 25, 2017
ACM 1981	Jan 19, 2018
ACM 1984	Jul 19, 2016
ACM 1985	Jun 21, 2017
Algol	Feb 1, 2014
AMDAHL 470	Jul 19, 2016
Awit	Dec 22, 2017
Canadian Computer Chess Invitational Championship 1984	Mar 2, 2013
Carey Bloodworth	Jul 19, 2016
CHAOS	Dec 28, 2017
Daly CP	Jul 13, 2015
Engines	Mar 10, 2018
Enterprise	Jun 23, 2017
ETAOIN SHRDLU	Jan 6, 2016
Freedom	Dec 28, 2017
Harry Shershow	Dec 27, 2017
IBM 370	Jan 20, 2018
J. Biit	Jan 17, 2017
Mathematician	Apr 9, 2018
Mobility	Jan 17, 2018
Ostrich	Dec 28, 2017
Papa	Jan 11, 2018
Paul Rushton	Jan 12, 2015
Personal Computing	Dec 27, 2017
Rex	Jan 7, 2016
Sargon	Dec 25, 2017
SPOC	Jun 21, 2017
Tony Marsland	Nov 27, 2017
University of Alberta	Feb 20, 2018
University of Michigan	Jul 19, 2016
WCCC 1977	Dec 22, 2017
WCCC 1980	Dec 25, 2017
WCCC 1983	Jan 20, 2018
WCCC 1986	Jul 27, 2017

Up one Level

Beal

GerdIsenberg — Thu, 28 Dec 2017 09:06:57 GMT

Home * Engines * Beal

Beal,
Don Beal's first chess program, which played the First World Computer Chess Championship in Stockholm, running on a CDC 6600 mainframe computer at Queen Mary Collage. It shared a telephone line from Stockholm to London with Master ^[1].

Games

Ostrich

WCCC 1974, round 2, Ostrich - Beal ^[2]

[Event "WCCC 1974"]
[Site "Stockholm, Sweden"]
[Date "1974.08.06"]
[Round "2"]
[White "Ostrich"]
[Black "Beal"]
[Result "1-0"]
 
1. Nf3 Nf6 2. d4 Nc6 3. d5 Nb4 4. Nc3 d6 5. a3 Na6 6. e4 e5 7. Bg5 Nc5 8. b4 Ncd7 
9. Bb5 Be7 10. Bxf6 gxf6 11. O-O O-O 12. Qd3 Kg7 13. Nh4 Re8 14. f4 c5 15. Nf5+ Kg6 
16. Qg3+ Kh5 17. Be2# 1-0

A16chs

WCCC 1974, round 3, Beal - A16chs ^[3]

[Event "WCCC 1974"]
[Site "Stockholm, Sweden"]
[Date "1974.08.07"]
[Round "3"]
[White "Beal"]
[Black "A16chs"]
[Result "1-0"]
 
1. g3 g6 2. Bh3 c5 3. Bg2 Qb6 4. c3 Qc7 5. Kf1 Bg7 6. Bf3 g5 7. e4 Nc6 8. d4 cxd4 
9. Bxg5 d6 10. cxd4 h6 11. Be3 Qb6 12. Nc3 Qa6+ 13. Nge2 Bh3+ 14. Ke1 b5 15. Nd5 Qa5+ 
16. Nec3 b4 17. Nb5 Kf8 18. Qd3 a6 19. Nbc7 Ra7 20. Rc1 Bd7 21. e5 f6 22. e6 Nb8 
23. Qg6 Qa4 24. Qf7# 1-0

External Links

References

^ Jean E. Hayes, David Levy (1976). The world computer chess championship, Stockholm 1974. University Press (Edinburgh) ISBN 0852242859
^ Stockholm 1974 - Chess - Round 2 - Game 1 (ICGA Tournaments)
^ Stockholm 1974 - Chess - Round 3 - Game 5 (ICGA Tournaments)

What links here?

Page	Date Edited
Beal	Dec 28, 2017
CDC 6600	Oct 8, 2014
Don Beal	Jul 27, 2017
ECCC 1976	Sep 6, 2017
Engines	Mar 10, 2018
Queen Mary, University of London	Jul 12, 2017
WCCC 1974	Jan 19, 2018

Up one Level

Black Knight

GerdIsenberg — Mon, 25 Dec 2017 22:59:21 GMT

Home * Engines * Black Knight

		Black Knight, a chess program developed in 1974 by Fred Prouse, Kenn Sogge, Gary Maltzen and Lonny Lebahn affiliated with Sperry Univac, Roseville, Minnesota ^[1] . Black Knight was written in Fortran and ran on the UNIVAC 1100 series of computers, playing four ACM North American Computer Chess Championships, the ACM 1975, ACM 1976, ACM 1977 and ACM 1978, and the 2nd World Computer Chess Championship 1977 in Toronto. It was a selective Shannon Type B program, performing Alpha-Beta search with leaf evaluation.
Black armor ^[2]

Tigran Petrosian

During the 1980 Candidates Match between Viktor Korchnoi and Tigran Petrosian in Velden am Wörther See, Black Knight was used to analyze the games. It further played a short game vs. Petrosian, where a draw offer by Petrosian in a better position was accepted after move 14 ^[3] .

[Event "Test match"]
[Site "Velden am Wörther See"]
[Date "1980.03.25"]
[Round "1"]
[White "Tigran Petrosian"]
[Black "Black Knight"]
[Result "1/2-1/2"]
 
1.d4 Nf6 2.Bg5 d5 3.e3 Nc6 4.Bb5 Bg4 5.f3 Bf5 6.Nd2 Qd7 7.c3 e6 8.Ne2 a6 9.Ba4
Be7 10.O-O O-O 11.Qe1 h6 12.Bxf6 Bxf6 13.e4 Bg6 14.Nf4 Kh7
1/2-1/2 {draw offer by Petrosian accepted}

Namesake

Black Knight Chess by Nirmel Murtic ^[4]

Publications

Monroe Newborn (1979). Ostrich IV meets the Black Knight. Personal Computing, Vol. 3, No. 10, pp. 74 » ACM 1978, Ostrich

External Links

Chess Program

Black Knight's ICGA Tournaments

Misc

References

^ Computer Chess - A Memorial to Brute Force by Louis Kessler
^ Black armor in a Russian museum by George Shuklin
^ Schachcomputer sagt Kortschnojs Sieg voraus:: "Black Knight" gegen Petrossjan unentschieden April 18, 1980, Computerwoche 16/1980 (German)
^ Black Knight Chess - Android Apps on Google Play

What links here?

Page	Date Edited
ACM 1975	Jan 19, 2018
ACM 1976	Dec 27, 2017
ACM 1977	Dec 22, 2017
ACM 1978	Dec 23, 2017
Black Knight	Dec 25, 2017
Computerworld	Sep 9, 2017
Dark Horse	Jul 19, 2016
Elsa	Sep 6, 2017
Engines	Mar 10, 2018
Fred Prouse	Jan 7, 2016
Gary Maltzen	Nov 7, 2014
Influence Quantity of Pieces	Jul 21, 2017
Kenn Sogge	Nov 7, 2014
Lonny Lebahn	Oct 30, 2013
Monroe Newborn	Dec 23, 2017
Ostrich	Dec 28, 2017
Personal Computing	Dec 27, 2017
UNIVAC 1100	Jul 21, 2016
WCCC 1977	Dec 22, 2017
White Knight	Dec 12, 2016
Xenarbor	Sep 6, 2014

Up one Level

Blitz

GerdIsenberg — Sat, 23 Dec 2017 21:22:12 GMT

Home * Engines * Blitz

		Blitz, the first chess program by primary author Robert Hyatt and chess advisor Albert Gower from University of Southern Mississippi. Blitz was a Shannon Type B program written in Fortran. It played the ACM 1976, ACM 1977, the WCCC 1977, ACM 1978, the ACM 1979 (ran on UNIVAC 1100/80), until at the ACM 1980 successor Cray Blitz appeared.
Blitz ^[1]

Description

Bob Hyatt's reply to Christophe Théron on Blitz ^[2]:

Bob, what kind of selection did you use in this early "Blitz"?

It was a forward pruning search. Basically searched roughly 6 moves at each ply, to a depth of 5 ply. There was no capture search after it, just a complex (for the time) static evaluation that also used a Static Exchange Evaluator to make sure the last move was safe.

The most interesting parts were the following: 1. It had about 30,000 lines of code dedicated to analyzing the set of legal moves at any ply and pick out the moves that appeared to be tactically or positionally promising. 2. It had a "causality analysis" procedure that was invoked at any point in the search where the score dropped. Since I found it hard to recognize I was in trouble and to select moves that would defend against threats that were hard to see from the "other side" I let my tactical analysis find good moves, and if it was successful, at the next ply, after searching a couple of moves and finding that the score was too low, this "causality" facility could look at the PV and figure out what was going wrong and then select moves that had a chance of "fixing" things. Worked very well, was tactically very dangerous... but made the typical positional mistakes that forward pruning programs do. Entire program was over 80,000 lines of code, however. *very* big, when considering that Crafty is under 40,000 lines with a huge number of comments...

What do you mean by "not even a real quiescence search"?

I searched 5 plies and *quit*. I did use a static exchange evaluator to determine if the tip moves were safe. This was searching under 100 nodes per second on a machine that was rated at .7 MIPS. This program finished in a 3-way tie for 2nd at the 1976 ACM computer chess tournament, but the following year I was "exhaustive"... :)

Publications

Editor (1979). Will Blitz be next year's champ? Personal Computing, Vol. 3, No. 7, pp. 80, July 1979 » ACM 1978, Blitz 6.5 - Belle, Round 4
Robert Hyatt (1980). A Southern Blitz. Personal Computing, Vol. 4, No. 6, pp. 93

External Links

Chess Program

Blitz' ICGA Tournaments

Misc

Blitz from Wikipedia
The Sweet - The Ballroom Blitz, Top Of The Pops in 1973, YouTube Video

References

^ Intercloud lightnings over Toulouse (France), August 12, 2006, original data by Sebastien D'Arco, Animation by Koba-chan, CC BY-SA 2.5, Wikimedia Commons, Blitz wikipedia.de (German)
^ Re: Square-of-the-pawn by Robert Hyatt, CCC, January 13, 1998

What links here?

Page	Date Edited
ACM 1976	Dec 27, 2017
ACM 1977	Dec 22, 2017
ACM 1978	Dec 23, 2017
ACM 1979	Apr 3, 2017
Albert Gower	Jan 7, 2016
Belle	Jan 18, 2018
Blitz	Dec 23, 2017
Christophe Théron	Jan 7, 2016
Cray Blitz	Dec 25, 2017
Elsa	Sep 6, 2017
Engines	Mar 10, 2018
Joe Condon	Jan 7, 2016
Mathematician	Apr 9, 2018
Personal Computing	Dec 27, 2017
Petir	Jul 21, 2015
Robert Hyatt	Dec 25, 2017
UNIVAC 1100	Jul 21, 2016
University of Alabama at Birmingham	Jul 14, 2014
University of Southern Mississippi	Dec 27, 2017
WCCC 1977	Dec 22, 2017

Up one Level

CCCP (US)

GerdIsenberg — Fri, 22 Dec 2017 08:16:18 GMT

Home * Engines * CCCP

		CCCP, the Columbia Computer Chess Program developed by a group of students at Columbia University, Steven M. Bellovin, Aron Eisenpress, Andrew Koenig, and Ben Yalow, written in PL/I. CCCP played the ACM 1971, where it ran on IBM 360/91 at Columbia University. The project already started during the ACM 1970 in collaboration with Hans Berliner from Carnegie Mellon University, when J. Biit was operated through a chess GUI written at Columbia for the IBM 2250 Display Unit. The four students continued to develop J. Biit, replacing the back end with a much better set of algorithms, evolving into CCCP (a pun on the Cyrillic abbreviation for the official name of the Soviet Union, Сою́з Сове́тских Социалисти́ческих Респу́блик) after one year of effort ^[1] .
Flying USSR flag ^[2]

Selected Games

The Computer Was a Fish

Selected Games

ACM 1971, round 3, CCCP - David ^[3]

[Event "ACM 1971"]
[Site "Chicago USA"]
[Date "1971.08.04"]
[Round "3"]
[White "CCCP"]
[Black "David"]
[Result "1/2-1/2"]
 
1.e4 e6 2.d4 Nc6 3.Nc3 g5 4.Bb5 a6 5.Bxc6 dxc6 6.Be3 b5 7.Qh5 b4
8.Bxg5 Nf6 9.Bxf6 Qxf6 10.e5 Qg7 11.Ne4 Qxg2 12.Qf3 Qxf3 13.Nxf3
Bh6 14.Nf6+ Ke7 15.a3 bxa3 16.Rxa3 Rb8 17.O-O Rxb2 18.c4 a5 19.Rxa5
Rb3 20.Kg2 Rxf3 21.Kxf3 Bd2 22.Rc5 Bc3 23.Rxc6 Bb7 24.Nd5+ exd5
25.Rxc7+ Ke6 26.Rxb7 dxc4 27.Rb6+ Kf5 28.Rf6+ Kg5 29.Rg1+ Kh5
30.Rf5+ Kh6 31.Rf6+ Kh5 32.Rf5+ Kh6 33.Rf6+ Kh5 34.Rf5+ 1/2-1/2

The Computer Was a Fish

		In his essay The Computer Was a Fish, published in Analog Science Fiction and Fact, August 1972 ^[4], George R. R. Martin mentions the ACM 1971 and a computer chess program called CCCP, which had a certain Mr. Benjamin Yalow on the team ^[5]. The essay inspired Charles F. and Charlie Wilkes to write their program The Fox ^[6].
Analog, August 1972 ^[7]

Namesake

CCCP by Pawel Koziol

Publications

Andrew Koenig (1978). Light-Pen used in game. Personal Computing, Vol. 2, No. 5, pp. 112

External Links

References

^ Recollections of CUCC 1968-70 -The CCCP Chess Program
^ Flag of the Soviet Union, file from the Prelinger Archives, which released it explicitly into the public domain, using the Creative Commons Public Domain Dedication, Wikimedia Commons
^ PGN Download NACCC from Computerschaak/Downloads/Games hosted by CSVN
^ George R. R. Martin (1972). The Computer Was a Fish. Analog Science Fiction/Science Fact, August 1972
^ The Drink Tank 319 - Hugo for Best Novel | Chris Garcia - Editors - James Bacon (pdf)
^ Computer Chess Newsletter, Issue 2 1977 by Douglas Penrod, Charles F. Wilkes pp. 6-9, Courtesy of Peter Jennings, pdf reprint from The Computer History Museum
^ Cover art by Frank Kelly Freas, supplied by Visco, Analog Science Fiction/Science Fact, August 1972

What links here?

Page	Date Edited
ACM 1971	Jul 19, 2016
Andrew Koenig	Dec 22, 2017
Aron Eisenpress	Jul 8, 2012
Ben Yalow	Jan 21, 2013
CCCP	Jan 10, 2013
CCCP (US)	Dec 22, 2017
Charles F. Wilkes	Oct 6, 2014
Charlie Wilkes	Oct 6, 2014
Columbia University	Oct 13, 2016
David	Jul 20, 2016
Engines	Mar 10, 2018
IBM 360	Jan 2, 2016
J. Biit	Jan 17, 2017
Personal Computing	Dec 27, 2017
PL 1	Jan 20, 2016
Steven M. Bellovin	Dec 14, 2017
The Fox	Feb 27, 2017

Up one level

Charly

GerdIsenberg — Thu, 10 Jan 2013 10:08:18 GMT

Home * Engines * Charly

		Charly, ("Chess heuristics and algorithms for relaxing lazy yodelers") an early chess program developed in 1967/68 by Gerald Tripard, Gerhard Rudolf and Werner Joho at ETH Zurich, to run on a CDC 1604.
New Glarus yodelers in traditional Swiss garb ^[1]

Description

The main tree search went 4 plies deep, with the final position including an extensive evaluation of all possible exchanges on the square occupied by the piece being moved there on the last ply. This made the program relatively strong tactically but there was not much in the program incorporating strategy. Strategy, besides material advantage, included mobility of the pieces, pawn structure and advancement to queening. It required a considerable amount of time making the program totally move-legal, such as incorporating all of the rules associated with castling, en passant, and stalemate through move repetition. The only thing not included was pawn promotion to something other than a queen. The opening book was programmed by Gerhard Rudolf, the machine language expert, the chess playing algorithm was programmed in Fortran. The library entries were collected from books, mainly, the 10th edition of Larry Evans, Modern Chess Openings ^[2].

ETH-MIT Match

In 1968, Gerald Tripard asked Richard Greenblatt for a match versus Mac Hack VI. Three games were played in October and November 1968 via ham radio ^[3]:

Game 1

^[4] ^[5]

[Event "ETH-MIT Match"]
[Site "Zurich/Cambridge"]
[Date "1968.10.27"]
[Round "1"]
[White "Charly"]
[Black "Mac Hack VI"]
[Result "0-1"]
 
1.e4 e5 2.Nf3 Nf6 3.d4 Nxe4 4.Bd3 d5 5.Nxe5 Bd6 6.O-O O-O 7.c4 Bxe5 8.dxe5 Nc6
9.cxd5 Qxd5 10.Qf3 Bf5 11.Qxf5 Qxd3 12.Nc3 Nc5 13.Qxd3 Nxd3 14.f4 Rfd8 15.Rf3 Rd7
16.Ne4 Rad8 17.b3 R7d4 18.Nc3 Ne1 19.Rg3 Nc2 20.Rb1 Kf8 21.Nb5 R4d1+ 22.Kf2 R8d7
23.Ke2 R1d5 24.a4 N6d4+ 25.Nxd4 Nxd4+ 26.Kf2 Nf5 27.Ba3+ c5 28.Rc3 R5d2+ 29.Kg1 b6
30.g4 Nd4 31.Kh1 Nc2 32.Bc1 Re2 33.Bb2 Ne3 34.h3 Rd1+ 35.Rxd1 Nxd1 36.Ba1 Nxc3
37.Bxc3 Rc2 38.Be1 Rc1 39.g5 Rxe1+ 40.Kg2 Re4 41.b4 cxb4 0-1

Games 2 and 3

^[6]

[Event "ETH-MIT Match"]
[Site "Zurich/Cambridge"]
[Date "1968.11.26"]
[Round "2"]
[White "Mac Hack VI"]
[Black "Charly"]
[Result "1-0"]
 
1.e4 e5 2.Nf3 Nc6 3.Bb5 d6 4.d4 exd4 5.Nxd4 Nge7 6.Nc3 a6 7.Ba4 b5 8.Bb3 Na5
9.Qf3 Nxb3 10.axb3 c5 11.Ndxb5 d5 12.Nxd5 Nxd5 13.exd5 Qe7+ 14.Qe3 Qxe3+ 15.Bxe3 Kd7
16.Nc3 Bd6 17.Na4 Rb8 18.Nxc5+ Bxc5 19.Bxc5 Re8+ 20.Be3 Kd6 21.O-O-O Rb5 22.Bf4+ 1-0
 
[Event "ETH-MIT Match"]
[Site "Zurich/Cambridge"]
[Date "1968.11.26"]
[Round "3"]
[White "Charly"]
[Black "Mac Hack VI"]
[Result "0-1"]
 
1.e4 e5 2.Nf3 Nc6 3.Bb5 Nf6 4.O-O Bc5 5.Nxe5 Qe7 6.Nxc6 dxc6 7.Bc4 Bg4 8.Be2
Bxe2 9.Qxe2 Nxe4 10.d3 Nd6 11.Qxe7+ Kxe7 12.Re1+ Kd7 13.c3 Rae8 14.Rd1 Re2 15.d4 Bb6
16.g4 Rhe8 17.Kg2 f5 18.g5 Nc4 19.b3 Ne3+ 20.Bxe3 R8xe3 21.g6 hxg6 22.d5 R3e4
23.dxc6+ Kxc6 24.Rf1 Rc2 25.a4 Ree2 26.Rd1 Rexf2+  0-1

External Links

References

^ Outdoor group portrait of a group of Swiss yodelers in costume, 1922, Moen Photo Service, La Crosse, WI, Yodeling from Wikipedia
^ Description taken from July 1, 2010 letter from Dr. Gerald Tripard, hosted by Lawrence J. Krakauer
^ Computer chess via ham radio by Lawrence J. Krakauer
^ The first inter-computer chess game via ham radio by Lawrence J. Krakauer
^ October 30, 1968 letter from Richard Greenblatt to G. Tripard
^ Games 2 and 3

What links here?

Page	Date Edited
Charlie	Jan 7, 2015
Charly	Jan 10, 2013
Engines	Mar 10, 2018
ETH Zurich	Jan 9, 2018
Gerald Tripard	Oct 30, 2012
Horizon Effect	Sep 10, 2017
Lawrence J. Krakauer	Oct 9, 2013
Mac Hack	Apr 20, 2018
Mathematician	Apr 9, 2018
Werner Joho	Sep 22, 2013

Up one Level

Chess (Program)

GerdIsenberg — Fri, 22 Dec 2017 10:54:07 GMT

Home * Engines * Chess - The Northwestern University Chess Program

		Chess, the Northwestern University Chess Program by primary authors Larry Atkin and David Slate was the dominating program in the 70s, winning eight times the ACM North American Computer Chess Championships and the second WCCC Toronto 1977. The version Chess 4.0 from 1973 was a complete re-write and paradigm shift from Shannon type B to type A. Chess ran on Control Data Corporation's line of supercomputers, CDC 6600 and CDC Cyber, Chess 4.x was completely written in COMPASS, the CDC assembly language.
Chess 4.6 Chesstor, ACM 1978 ^[1]

Photos

History of Development

Photos



Ruben and Slate, WCCC 1974 ^[2]

Slate and Atkin, ACM 1975 ^[3]

History of Development

Chess 1.0

In spring 1968 Northwestern University engineering students Larry Atkin and Keith Gorlen launched a chess program in their spare time.

Chess 2.0 - 3.6

By mid 1969, physics graduate student David Slate, who already started his own effort of a computer chess program, joined the team to develop Chess 2.0, which was gradually refined to Chess 3.6 during the following years by Slate and Atkin. While Gorlen left the team in 1970, he still contributed a few ideas for some time. The development and architecture of the early program is described in Larry Atkin's Masters Thesis ^[4] .

Chess, until 3.6, was a Shannon Type B kind of program, using a plausible move generator to select "best-n" moves. Due to their early success and obligation to prepare for the annual ACM event, the authors more and more stumbled over their initial design decisions and almost unmaintainable source code, and started a complete redesign and re-write in 1973.

Further quotes from CHESS 4.5 - The Northwestern University Chess Program ^[5] :

We quickly ruled out entering Chess 3.6. If there is anything more useless than yesterday's newspaper, it is last year's chess program. Our interest in the tournament lay in the chance to test something new and different, not to find out whether the other programs had improved enough to smash our old program. We knew, despite our unbeaten record and well-developed myth about the "solidity" of our program, that our luck must soon give out. The bubble would burst, and the gross weakness of Chess 3.6 would suddenly pour out in a series of ridiculous, humiliating blunders. For Chess 3.6 was the latest in a series of evolutionary changes to our original chess program, written in 1968-1969, and it faithfully carried most of the original design deficiencies. Chess 3.6 was, like the dinosaur, a species about to become extinct. Basically a Shannon type B program, it had a depth-first, alpha-beta, more-or-less fixed depth tree search. A primitive position evaluation function scored the endpoints and also doubled as a plausible move generator earlier in the tree by selecting "best-n" moves for further exploration. Rudimentary as they were, Chess 3.6's evaluation and tree search were just adequate to make "reasonable-looking" moves most of the time and not hang pieces to one- or two move threats. Apparently this was enough to play low class C chess and, for a while, to beat other programs.

In terms of organization, Chess 3.6 was a mess. Not only was it difficult to modify the evaluation function - it was difficult even to find it in the listing of the program.

Chess 4.0 - 4.9

Chess 4.0 and it's successors were more simple and modular written Tech style Shannon Type A programs.

Chess 3.6 was a mixture of Fortran and Assembly language (for CDC 6000/Cyber). Although we would have liked to use a high-level language, we felt that neither Fortran nor other languages available at the time offered the right combination of efficiency and power of expression. In writing Chess 4.0, we used assembly language so we could have complete control over the instructions that were generated. For Evalu8, which contains all of the "chess decisions", we used high-level assembly language macros, which give the "illusion" of a higher level language.

Although our plausible-move generator sounded plausible enough, and differed not very much from methods employed in several other chess programs, we had built up profound dissatisfactions with it over the years. A suggestion by Peter W. Frey triggered some thoughts on the matter, and as a result we dumped selective searching in favor of full-width searching, ostensibly a more primitive algorithm.

Several search and evaluation routines were separated in modules (Evalu8, BASE, FULL, MINI), basic data structures were Bitboards and incremental updated square centric attack tables for evaluation and move generation purpose. Chess 4.x used iterative deepening, a sophisticated Transposition Table, and the Killer Heuristic (since 4.5). The basic design and detailed description of Chess 4.5 influenced and motivated a lot of other computer chess programmers and made Chess 4.5 an archetype of generations of computer chess programs. David Slate made the source code of Chess 4.6 available from The Computer History Museum ^[6].

Chess 4.0 from Evaluation Overlap by Mark Watkins
Material in Chess 4.5 at Material Hash Table
Mobility in Chess 4.6 at CDC Cyber

Achievements

Chess 3.x won the first three ACM North American Computer Chess Championships, ACM 1970, ACM 1971 and ACM 1972. Already by August 1973, only a few month after the re-write, and without much testing and tuning, Chess 4.0 won it's first tournament, the ACM 1973, but had less luck during the first World Computer Chess Championship 1974, where it lost against CHAOS in round two.

Despite not winning the title in 1974, Chess 4.x continued domination of CC events. Chess' hardware were the Control Data Corporation (CDC) computers CDC 6600 and CDC Cyber series, and CDC Cyber hardware consultant David Cahlander joined the team. Chess 4.4 won the ACM 1975, Chess 4.5 ACM 1976 and Chess 4.6 ACM 1977 as well the second World Computer Chess Championship 1977 in Toronto. Chess 4.9 won the 10th ACM 1979 with a record of now eight (out of ten) North American Championship titles. Chess 4.9 finally participated at the WCCC 1980 in Linz, Austria, already competing with Slate's new program Nuchess.

Man-Machine

Chess 4.x delivered various man-machine matches, most notably the David Levy versus Chess 4.7 match in 1978, where Levy won his famous bet. In 1979, a Levy versus Chess 4.8 game was introduced to a greater audience in the German television ZDF, featured by Journalists Frederic Friedel and Volker Arzt ^[7].

Chesstor

In 1978, Chess 4.6 was invited to play the Minnesota's Twin Cities Open, won by Chess with a 5-0 score, further winning versus Walter Browne in a simultaneous exhibition. A new electronic chessboard was used for the first time. The micro-processor which controls the board senses the opponent's moves magnetically, transmits the move in algebraic via telephone to the Cyber 176, and then indicates Cyber 176's responses by illuminating small lights on the square of the piece to be moved and the one to which it is to go. Chesstor, as this device was called, also senses the hitting of the chess clock ^[8].

Namesakes

The 1978 program Chess 0.5 by Larry Atkin and Peter W. Frey, as published in Byte Magazine, was a separate program written in Pascal for didactic purposes. Chess 7.0 by Larry Atkin was a commercial program written in 6502 Assembly published in 1982/83 for various home computers. Another namesake was the strong Dutch program Chess 0.5X by Wim Elsenaar in the 80s, winner of DOCCC 1983 and 1984.

Publications

David Slate, Larry Atkin, Keith Gorlen (1971). CHESS 3.5 User Guide. Northwestern University
Paul Rushton, Tony Marsland (1973). Current Chess Programs: A Summary of their Potential and Limitations. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, pdf
Larry Atkin (1975). Chess 3.6: A Chess Playing Computer Program. Masters Thesis, Northwestern University, June 1975
David Slate, Larry Atkin (1977). Chess 4.5 - The Northwestern University Chess Program. Chess Skill in Man and Machine, reprinted (1988) in Computer Chess Compendium
David Slate, Ben Mittman (1978). Chess 4.6 - Where Do We Go From Here? Jerusalem Conference on Information Technology 1978 193-198
Editor (1978). Computer beats U.S. chess champ. Personal Computing, Vol. 2, No. 10, pp. 84 » Chesstor
David Cahlander (1979). Strength of a Chess Playing Computer. ICCA Newsletter, Vol. 2, No. 1

Forum Posts

Chess 4.5 from 1976 by Robert Harrington, rgcc, April 20, 1996
Re: CHESS 4.5 (1973) by Robert Hyatt, rgcc, April 07, 1997 » Bitboards, C++, Evaluation
Chess 4.0 vs Belle 1973 by Joshua Lee, CCC, May 31, 2000 » Belle

External Links

Chess (Northwestern University) from Wikipedia
Chess' ICGA Tournaments
Classic Computer Chess - ... The programs of yesteryear by Carey, hosted by the Internet Archive ^[9]
Description of the computer programme CHESS 4.0, August 10, 1974, IFIP 74 Congress, Andrey Ershov Archive
SCHACH: Computer bald Weltmeister? Der Spiegel 13/1979, March 26, 1979 (German) » Frieder Schwenkel
The Slate/Atkin program and CHESS x.x by Bill Wall, Chess.com, September 23, 2011
Ars Electronica - Die Teilnehmer an der 3. Computerschach-Weltmeisterschaft - CHESS 4.9 (German)

References

^ Chess 4.6 electronic board at ACM 1978, Courtesy of Monroe Newborn, The Computer History Museum
^ Ruben and Slate at 1st World Computer Chess Championship in Stockholm, WCCC 1974, by Monroe Newborn from The Computer History Museum
^ Slate and Atkin at the 6th ACM North American Computer Chess Tournament in Minneapolis, Minnesota, ACM 1975, by Monroe Newborn from The Computer History Museum
^ Larry Atkin (1975). Chess 3.6: A Chess Playing Computer Program. Masters Thesis, Northwestern University, June 1975
^ David Slate and Larry Atkin (1977). CHESS 4.5 - The Northwestern University Chess Program. Chess Skill in Man and Machine, reprinted (1988) in Computer Chess Compendium
^ Chess 4.6 source code, gift of David Slate, from The Computer History Museum, pdf
^ ZDF: IM David Levy 1979 gegen Chess 4.8 from schach-computer wiki
^ Editor (1978). Computer beats U.S. chess champ. Personal Computing, Vol. 2, No. 10, pp. 84
^ Re: Old programs CHAOS and USC by Dann Corbit, CCC, July 11, 2015

What links here?

Page	Date Edited
ACM 1970	Jun 13, 2015
ACM 1971	Jul 19, 2016
ACM 1972	Dec 22, 2017
ACM 1973	Jan 19, 2018
ACM 1974	Jan 19, 2018
ACM 1975	Jan 19, 2018
ACM 1976	Dec 27, 2017
ACM 1977	Dec 22, 2017
ACM 1978	Dec 23, 2017
ACM 1979	Apr 3, 2017
ACM North American Computer Chess Championship	Jun 13, 2015
Assembly	Sep 3, 2017
Attack and Defend Maps	Nov 5, 2016
Bebe	Dec 23, 2017
Belle	Jan 18, 2018
Ben Mittman	Jan 2, 2017
Bitboards	Nov 14, 2017
Brute-Force	Jul 27, 2017
Byte Magazine	Nov 20, 2016
CDC 6600	Oct 8, 2014
CDC Cyber	Dec 22, 2017
CHAOS	Dec 28, 2017
Chess	Jan 21, 2018
Chess (Program)	Dec 22, 2017
Chess 0.5	Nov 20, 2016
Chess 0.5X	Nov 5, 2015
Chess 2013	Nov 6, 2013
Chess 7.0	Jul 13, 2015
Chess Skill in Man and Machine	Nov 12, 2014
Chezzz	Jan 20, 2013
ChipTest	Jun 19, 2016
Classical Approach	Jan 28, 2018
Claude Jarry	Jan 7, 2016
Computer Chess Compendium	Dec 29, 2015
Crafty	Jan 28, 2018
Cyrus	Jul 22, 2014
Daly CP	Jul 13, 2015
Dart	Jan 19, 2018
Dartmouth CP	Jan 19, 2018
David Cahlander	Dec 22, 2017
David Levy	Jan 3, 2017
David Slate	Jul 19, 2016
Duchess	Dec 22, 2017
Edward Fredkin	Oct 27, 2013
Efficient Generation of Sliding Piece Attacks	Nov 5, 2016
Engines	Mar 10, 2018
Evaluation Overlap	Jul 19, 2016
Frederic Friedel	Jan 6, 2018
Frieder Schwenkel	Dec 23, 2017
Genie	Feb 7, 2016
Gerd Isenberg	Apr 4, 2016
Hal Terrie	Feb 19, 2015
History	Jan 2, 2018
Horizon Effect	Sep 10, 2017
ICGA	Jul 8, 2017
IsiChess	Jan 7, 2016
Iterative Deepening	Jun 23, 2017
J. Biit	Jan 17, 2017
Jacques Dutka	Jul 7, 2012
Jerusalem CC Tournament 1978	Jan 3, 2018
Jim Parry	Jan 7, 2016
Kai Himstedt	Jun 28, 2016
Kaissa	Apr 9, 2018
Keith Gorlen	May 23, 2016
L'Excentrique	Jan 7, 2016
L. Stephen Coles	Jan 5, 2017
La Regence	Jul 23, 2015
Larry Atkin	Jan 7, 2016
Levy versus Chess 1978	Apr 1, 2017
Levy versus Deep Thought 1989	Jun 2, 2015
Martin Bryant	Dec 11, 2016
Master	Dec 28, 2017
Material	Mar 31, 2018
Material Hash Table	Apr 3, 2014
Mop-up Evaluation	Nov 26, 2016
Mr. Turk	Feb 21, 2015
Northwestern University	Sep 5, 2017
Nuchess	Apr 3, 2017
Paul Rushton	Jan 12, 2015
Personal Computing	Dec 27, 2017
Peter W. Frey	Dec 25, 2017
Point Value	Mar 31, 2018
Population Count	Sep 3, 2017
Rajah	Sep 12, 2012
Ribbit	Jan 19, 2018
Rival	Jul 30, 2017
Schach	Jan 7, 2016
Sensory Board	Mar 1, 2018
Sortie	Jan 5, 2016
Steven M. Bellovin	Dec 14, 2017
Stobor	Jan 8, 2016
Tech	Apr 20, 2018
The Crazy Bishop	Jan 7, 2016
Tom Likens	Mar 7, 2017
Transposition Table	Apr 19, 2018
Treefrog	Jan 19, 2018
Type B Strategy	Jul 19, 2016
WCCC 1974	Jan 19, 2018
WCCC 1977	Dec 22, 2017
WCCC 1980	Dec 25, 2017
William Blanchard	Aug 12, 2013
Woodpusher	Dec 12, 2016
World Computer Chess Championship	Mar 6, 2018

Up one level

Chute

GerdIsenberg — Thu, 21 Dec 2017 20:33:43 GMT

Experiences with Chute

Home * Engines * Chute

Chute (CHUTE - CHess, University of Toronto, Engineering),
the chess program from the University of Toronto by Michael Valenti and Zvonko Vranesic. Chute was subject of Valenti's Masters Thesis supervised by Vranesic ^[1], later also published in many parts in the Personal Computing magazine. Chute participated at four consecutive ACM North American Computer Chess Championships, ACM 1974, ACM 1975, ACM 1976 and ACM 1977 and the WCCC 1977 in Toronto.

Experiences with Chute

Abstract of Experiences with Chute during the WCCC 1977 in the Proceedings of the 1977 annual ACM conference ^[2] :

This paper describes some of the experiences with CHUTE (CHess, University of Toronto, Engineering), an easily modifiable chess playing program. The basic characteristics of the program are discussed. The game tree look-ahead procedure used in the program does not employ a static position analysis, but selects the best path strictly on the basis of dynamic move analysis.

A brief discussion of heuristics is given, along with some of the problems encountered in their implementation. The program has an opening book designed to take other chess playing programs out of their books.

Selected Games

WCCC 1977, round 4, Tell - Chute 1.2 ^[3]

[Event "WCCC 1977"]
[Site "Toronto, Canada"]
[Date "1977.08.09"]
[Round "4"]
[White "Tell"]
[Black "Chute 1.2"]
[Result "0-1"]
 
1. e4 c5 2. Bc4 d6 3. Qh5 e6 4. Bb5+ Nd7 5. Nc3 Nf6 6. Qh4 a6 7. Be2 d5 
8. exd5 exd5 9. Nf3 b5 10. Nxd5 Nxd5 11. Qe4+ Be7 12. Qxd5 Nb6 13. Qc6+ 
Bd7 14. Qe4 O-O 15. O-O f5 16. Qe5 Rf6 17. Bd3 Bd6 18. Qc3 Nd5 19. Qb3 c4 
20. Bxc4 bxc4 21. Qxc4 Be6 22. Ng5 Rh6 23. h4 Ne3 24. Nxe6 Bh2+ 25. Kh1 
Nxc4 26. Nxd8 Rxh4 27. Ne6 Bf4+ 28. Kg1 Bh2+ 29. Kh1 Be5+ 30. Kg1 Re8 
31. Nc5 Bh2+ 32. Kh1 Bd6+ 33. Kg1 Bxc5 34. d3 Ne5 35. Bg5 Rg4 36. Bc1 Nf3+ 
37. Kh1 Rh4# 0-1

Publications

1974 ...

Michael Valenti (1974). CHUTE I, An Easily Modifiable Chess Playing Program. M.A.Sc. Thesis, Dept. of Electrical Engineering, University of Toronto.
George Hardy (1974). The Enhancement of the Positional Playing Capabilities of F.M. Valenti's Chess Program. BSc. Thesis, Division of Engineering Science Faculty of Applied Science and Engineering, University of Toronto
Michael Valenti, Zvonko Vranesic (1977). Experiences with CHUTE. Proceedings of the ACM 1977 annual conference

1978

Mike Valenti (1978). A program thesis. Personal Computing, Vol. 2, No. 5, pp. 108
Mike Valenti (1978). Valenti's Chess Program - Part II. Personal Computing, Vol. 2, No. 6, pp. 93
Mike Valenti (1978). Computer Chess Programming. Personal Computing, Vol. 2, No. 7, pp. 77
Mike Valenti (1978). Computer-Chess-Program-Thesis: Part III. Personal Computing, Vol. 2, No. 7, pp. 84
Mike Valenti (1978). Part IV of Valenti Thesis on Chess. Personal Computing, Vol. 2, No. 8, pp. 89
Mike Valenti (1978). Part V Chess Program. Personal Computing, Vol. 2, No. 9, pp. 88
Mike Valenti (1978). Valenti's Chess Program. Personal Computing, Vol. 2, No. 10, pp. 82
Mike Valenti (1978). Writing a Chess Program. Personal Computing, Vol. 2, No. 11, pp. 22

1979

Mike Valenti (1979). A Chess Program - Part VIII. Personal Computing, Vol. 3, No. 1, pp. 73
Mike Valenti (1979). Valenti Chess Program - Part IX. Personal Computing, Vol. 3, No. 3, pp. 50
Mike Valenti (1979). A Chess Program - Part X. Personal Computing, Vol. 3, No. 4, pp. 64
Mike Valenti (1979). Chess Program - Part XI. Personal Computing, Vol. 3, No. 5, pp. 56
Mike Valenti (1979). Writing a chess program - Part XII. Personal Computing, Vol. 3, No. 7, pp. 82
Mike Valenti (1979). Writing a chess program - Part XIII. Personal Computing, Vol. 3, No. 8, pp. 75

External Links

Chute's ICGA Tournaments
Chute (disambiguation) from Wikipedia
The Chute from Wikipedia, 45th episode of Star Trek: Voyager

References

^ Michael Valenti (1974). CHUTE I, An Easily Modifiable Chess Playing Program. MSc. Thesis, Dept. of Electrical Engineering, University of Toronto
^ Michael Valenti, Zvonko Vranesic (1977). Experiences with CHUTE. Proceedings of the 1977 annual ACM conference
^ Toronto 1977 - Chess - Round 4 - Game 5 (ICGA Tournaments)

What links here?

Page	Date Edited
ACM 1974	Jan 19, 2018
ACM 1975	Jan 19, 2018
ACM 1976	Dec 27, 2017
ACM 1977	Dec 22, 2017
AMDAHL 470	Jul 19, 2016
Chute	Dec 21, 2017
Engines	Mar 10, 2018
Iron Fish	Sep 8, 2016
Michael Valenti	Dec 21, 2017
Personal Computing	Dec 27, 2017
University of Toronto	Dec 8, 2017
WCCC 1977	Dec 22, 2017
Zvonko Vranesic	Jan 14, 2017

Up one level

Cilkchess

GerdIsenberg — Thu, 21 Jan 2016 16:11:46 GMT

Home * Engines * CilkChess

CilkChess,
a massive parallel chess program written in the C or C++ multithreaded programming extension Cilk. Cilkchess was developed by various authors from MIT and elsewhere headed by Charles Leiserson and programming lead by Don Dailey ^[1]^[2].

Photos & Games

WCCC 1999 - Erdogan Günes, Charles Leiserson (back of head), and Don Dailey ^[3]

WCCC 1999, round 7, Hiarcs - CilkChess ^[4]

[Event "WCCC 1999"]
[Site "Paderborn, Germany"]
[Date "1999.06.19"]
[Round "7"]
[White "Hiarcs"]
[Black "CilkChess"]
[Result "0-1"]
 
1.d4 e6 2.c4 c5 3.Nf3 Nf6 4.e3 cxd4 5.exd4 d5 6.Nc3 Nc6 7.Bg5 Be7 8.c5 O-O 
9.Bb5 Bd7 10.O-O b6 11.Na4 bxc5 12.Bxf6 Bxf6 13.Nxc5 Re8 14.Rc1 Rc8 15.Ba6 
Rb8 16.b3 Qa5 17.a4 Rb4 18.Nd3 Rb6 19.Bb5 Rxb5 20.axb5 Nxd4 21.Nxd4 Bxd4 
22.Qc2 Bxb5 23.Rfd1 Qb6 24.Nc5 Be5 25.Qd2 Qb8 26.g3 Bf6 27.Rc2 Qa8 28.f3 a5 
29.Rdc1 Be7 30.Qd4 Bg5 31.f4 Bf6 32.Qd2 d4 33.Nd3 Be7 34.Rd1 Qf3 35.Ne5 Qe4 
36.Ra2 d3 37.Qg2 Qd4+ 38.Kh1 Bb4 39.Qb7 Qc5 40.Qe4 d2 41.Kg2 Qb6 42.Rc2 Rd8 
43.g4 f6 44.Nc6 Qb7 45.Qxe6+ Kf8 46.Kf2 Re8 47.Qd5 Bxc6 48.Rxc6 Qa7+ 0-1

Cilkchess Team

Quotes

from Awards for Cilk Technology & Research ^[5]:

1996 First Place in the 1996 Dutch Open Computer Chess Championship for Cilkchess
1997 Second Place in the 1997 Dutch Open Computer Chess Championship for Cilkchess

Description

from the WCCC 1999 homepage ^[6]:

Cilkchess is a parallel program which will be running on a 256-processor SGI Origin 2000 at NASA Ames for the WCCC. Cilkchess won First Prize in the 1996 Dutch Open and took Second in both 1997 and 1998. Our earlier program, *Socrates, took Second in the 1995 WCCC, tying the winner Fritz in the main part of the tournament, but losing in the playoff.

CilkChess is programmed in the Cilk multithreaded programming language ^[7], which allows highly irregular programs, such as chess, to be written with ease for parallel computers. The program uses a parallel variant of the MTD(f) search algorithm that incorporates null-move forward pruning, but few extensions. The evaluation function has been tuned from thousands of self-play games using a temporal-coherence learning algorithm. The transposition table is stored in 32 gigabytes of shared memory. In the late middle game, Cilkchess typically looks more than 15 ply (half-moves) ahead and performs 5-11 million make-moves per second.

Publications

Don Dailey, Charles E. Leiserson (2001). Using Cilk to Write Multiprocessor Chess Programs. Advances in Computer Games 9, pdf

Forum Posts

CilkChess question for Don by Robert Hyatt, CCC, January 31, 1999 » Shared Hash Table
Re: CilkChess by Don Dailey, CCC, February 14, 1999 » MTD(f)
MTD is a big win by Don Dailey, CCC, July 19, 1999

External Links

References

^ Cilkchess' ICGA Tournaments
^ The Cilkchess Parallel Chess Program
^ Image captured from Paderborn 1999 1.mp4 by Thorsten Czub hosted by Ed Schröder
^ Paderborn 1999 - Chess - Round 7 - Game 12 (ICGA Tournaments)
^ Awards for Cilk Technology & Research
^ 9th World Computer Chess Championship 1999 Homepage
^ Don Dailey and Charles E. Leiserson (2001). Using Cilk to Write Multiprocessor Chess Programs, Advances in Computer Games 9, pdf

What links here?

Page	Date Edited
Aegon 1997	Apr 7, 2017
Alexs	Dec 7, 2017
Arthur	Jan 7, 2016
Aske Plaat	Jun 26, 2017
Automated Tuning	Feb 27, 2018
BugChess NL	Feb 24, 2013
Centipawns	Aug 9, 2016
Charles Leiserson	Oct 12, 2016
Chris Joerg	Oct 11, 2016
Cilk	Oct 28, 2013
Cilkchess	Jan 21, 2016
DOCCC 1996	Jun 7, 2016
DOCCC 1997	Aug 15, 2015
DOCCC 1998	Feb 25, 2018
Don Beal	Jul 27, 2017
Don Dailey	Dec 7, 2016
Dutch Open Computer Chess Championship	Sep 25, 2014
Engines	Mar 10, 2018
Francesca	Jan 7, 2016
Harald Prokop	Nov 29, 2017
Intel	Aug 29, 2015
Massachusetts Institute of Technology	Jan 24, 2017
Mathematician	Apr 9, 2018
Matteo Frigo	Jan 7, 2016
MTD(f)	Jul 17, 2017
Occam	Jan 21, 2016
Parallel Search	Dec 30, 2017
Phil Lisiecki	Jan 7, 2016
Reid Barton	Jan 7, 2016
Ryan Porter	Jan 7, 2016
Score	Apr 14, 2018
Shared Hash Table	Sep 11, 2017
Star Socrates	Oct 12, 2016
Temporal Difference Learning	Feb 20, 2018
WCCC 1999	Jul 13, 2017
Who's Who	Sep 6, 2017

Up one Level

Coko

GerdIsenberg — Tue, 14 Jul 2015 06:15:09 GMT

Home * Engines * Coko

Coko,
a chess program by Dennis Cooper and Ed Kozdrowicki which competed the first four ACM North American Computer Chess Championships, ACM 1970, ACM 1971, ACM 1972 (Coko III) and ACM 1972 (Coko IV). Coko, the Cooper-Kozdrowicki chess program was written in Fortran as a highly selective tree searcher in the spirit of a Shannon Type B program using a tree pruning system (TPS) consists of a set of commands designed for programming heuristic tree searches ^[1]. As described by Cooper in the 1971 Panel ^[2], Coko III does not use Alpha-Beta:

Although the alpha-beta procedure is a great time saving method, it is unclear at this stage of program development what the full significance of applying such a method to a tactical-strategical game tree would be. Coko III does save the chess tree with periodic pruning to allow for the addition of more branches.

Descriptions

ACM

Communications of the ACM, Vol. 16, 7 ^[3]

COKO III is a chess player written entirely in Fortran. On the IBM 360-65, COKO III plays a minimal chess game at the rate of .2 sec cpu time per move, with a level close to lower chess club play. A selective tree searching procedure controlled by tactical chess logistics allows a deployment of multiple minimal game calculations to achieve some optimal move selection. The tree searching algorithms are the heart of COKO's effectiveness, yet they are conceptually simple. In addition, an interesting phenomenon called a tree searching catastrophe has plagued COKO's entire development just as it troubles a human player. Standard exponential growth is curbed to a large extent by the definition and trimming of the Fisher set. A clear distinction between tree pruning and selective tree searching is also made. Representation of the chess environment is described along with a strategical preanalysis procedure that maps the Lasker regions. Specific chess algorithms are described which could be used as a command structure by anyone desiring to do some chess program experimentation. A comparison is made of some mysterious actions of human players and COKO III.

Man-Machine Studies

International Journal of Man-Machine Studies ^[4]

The performance capabilities of the best computer chess programs are compared with their human counterparts with emphasis being placed on machine behavior limits. A grandmaster usually spends a lifetime collecting knowledge or information about the game. Some of this knowledge is given to COKO in the form of a 12 000-line FORTRAN program. Using this knowledge COKO plays very poorly but at the super rate of approximately one move/see. The use of a brute-force selective tree-searching procedure yields an order of magnitude improvement in performance at the standard rate of 3 min/move. Perhaps three orders of magnitude additional improvement is needed to defeat the world champion, a gap which must be bridged, if ever, by programming more chess knowledge into the machine. This paper discusses the “tree-searching catastrophe” as a natural phenomenon that plagues selective tree searching for both man and machine. In addition so-called “interminimal-game communication” is considered as a natural, powerful procedure frequently used by humans to guide their selective search and as a point of emphasis for future development. It is concluded that COKO's development is just beginning, with no immediate barriers to progress, and no lack of ideas for improvement. At present COKO combines brilliant solutions to individual board position puzzles with unimaginable blunders.

Mate in one?

During the ACM 1971, Coko III offered a pawn versus Genie which, if accepted, would permit a mating sequence 17 plies deep. The pawn was taken, mate was announced, and the predicted line was followed, until ... ^[5]

8/pp6/2p2p2/6p1/1P6/2Q1P3/k1K2PPP/5B1R w - - 0 38

Apparently due to a bug, Coko III found other moves better than mate in one and threw the win ...

38. Kc1 f5 39. Kc2 f4 40. Kc1 g4 41. Kc2 f3 42. Kc1 fxg2 43. Kc2 gxh1=Q 44. Kc1 Qxf1+ 
and resigned later 0-1

Mater

According to Monroe Newborn in 1975, the chess mating combinations program Mater by George Baylor and Herbert Simon, initially written in IPL V, was ported to Fortran and incorporated into Coko ^[6] :

MATER is written by George Baylor and Simon in FORTRAN. It is able to search to great depths for checkmates. MATER is presently part of the Cooper-Kozdrowicki program. While MATER is an interesting program in its own right, the opportunity to checkmate one's opponent plays a relatively small computational part of the game of chess, and its inclusion in the Cooper-Kozdrowicki program does not seem to add measurably to the program's strength.

Publications

Edward W. Kozdrowicki, John S. Licwinko, Dennis W. Cooper (1971). Algorithms for a minimal chess player: A blitz player. International Journal of Man-Machine Studies, Vol 3, 2
Edward W. Kozdrowicki, Dennis W. Cooper (1973). COKO III: the Cooper-Koz chess program, Communications of the ACM, Vol. 16, 7
Edward W. Kozdrowicki, Dennis W. Cooper (1973). COKO III and the future of inter-snap judgment communication. Proceedings of the ACM annual conference
Paul Rushton, Tony Marsland (1973). Current Chess Programs: A Summary of their Potential and Limitations. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, pdf
Edward W. Kozdrowicki, Dennis W. Cooper (1974). COKO III: The Cooper-Kozdrowicki chess program. International Journal of Man-Machine Studies Vol. 6, 6

External Links

ACM COMPUTER CHESS by Bill Wall
Classic Computer Chess - ... The programs of yesteryear by Carey, hosted by the Internet Archive ^[7]

References

^ Edward W. Kozdrowicki (1968). An adaptive tree pruning system: A language for programming heuristic treesearches. Proceedings of the 1968 23rd ACM national conference
^ Ben Mittman (1971). Computer Chess Programs (Panel). pdf from The Computer History Museum
^ Edward W. Kozdrowicki, Dennis W. Cooper (1973). COKO III: the Cooper-Koz chess program. Communications of the ACM, Vol. 16, 7
^ Edward W. Kozdrowicki, Dennis W. Cooper (1974). COKO III: The Cooper-Kozdrowicki chess program. International Journal of Man-Machine Studies Vol. 6, 6
^ George Atkinson (1998). Chess and Machine Intuition. (Intellect Ltd.) pp 63
^ Monroe Newborn (1975). Computer Chess. Academic Press, New York, N.Y. p. 26
^ Re: Old programs CHAOS and USC by Dann Corbit, CCC, July 11, 2015

What links here?

Page	Date Edited
0x88	Nov 28, 2016
ACM 1970	Jun 13, 2015
ACM 1971	Jul 19, 2016
ACM 1972	Dec 22, 2017
ACM 1973	Jan 19, 2018
Coko	Jul 13, 2015
Daly CP	Jul 13, 2015
Dennis Cooper	Aug 18, 2014
Ed Kozdrowicki	Aug 18, 2014
Engine Testing	Feb 1, 2018
Engines	Mar 10, 2018
Genie	Feb 7, 2016
IBM 360	Jan 2, 2016
J. Biit	Jan 17, 2017
Jacques Dutka	Jul 7, 2012
Keith Gorlen	May 23, 2016
Mater	Apr 26, 2016
MSU CP	Jul 19, 2016
Paul Rushton	Jan 12, 2015
SOMA	Mar 25, 2015
Steven M. Bellovin	Dec 14, 2017
Tech	Apr 20, 2018
UNIVAC 1100	Jul 21, 2016

Up one level

Cray Blitz

GerdIsenberg — Mon, 25 Dec 2017 16:56:00 GMT

Home * Engines * Cray Blitz

		Cray Blitz, was the successor of the program Blitz by Robert Hyatt and Albert Gower. With the sponsorship of Cray Research, supported by Dave Darling and Derek Robb ^[1], and later by Cray Assembly expert Harry Nelson from the Lawrence Livermore National Laboratory ^[2], they adopted and optimized Blitz for a Cray-1 supercomputer ^[3], later a Cray X-MP, Cray Y-MP and C916 with up to 16 processors. Cray Blitz initially used root splitting as parallel search algorithm on the two processor Cray X-MP, implemented and tested just before the WCCC 1983 ^[4], later principal variation splitting ^[5], enhanced principal variation splitting ^[6], and in the 90s DTS ^[7], specifically designed for a shared memory multiprocessor architecture of the Crays. Cray Blitz was written in Fortran, time-critical parts in the Cray Assembly Language CAL. Cray Blitz won two times the ACM North American Computer Chess Championships and also was two times winner of the World Computer Chess Championships, the WCCC 1983 in New York ^[8] , and the WCCC 1986 in Cologne ^[9].
The New Champion, Chess Life, February 1984 ^[10]

Photos & Game

WCCC 1983

Harry Nelson, Robert Hyatt and Don Beal, Cray Blitz vs BCP, WCCC 1983 ^[11]

[Event "WCCC 1983"]
[Site "New York, USA"]
[Date "1983.10.22"]
[Round "1"]
[White "Cray Blitz"]
[Black "BCP"]
[Result "1-0"]
 
1. e4 c5 2. Nf3 Nf6 3. e5 Nd5 4. Nc3 e6 5. Nxd5 exd5 6. d4 Nc6 7. dxc5 Bxc5 8. Qxd5 Qb6 
9. Qd2 O-O 10. Bc4 Re8 11. O-O Nxe5 12. Nxe5 Rxe5 13. Qf4 Qf6 14. Qxf6 gxf6 15. Kh1 d5 
16. f4 Rh5 17. Be2 Rh4 18. Bf3 d4 19. g3 Rh3 20. f5 Kg7 21. Kg2 Rh6 22. Bxh6+ Kxh6 
23. Bd5 Kg7 24. Rad1 a5 25. Kh1 Ra6 26. Be4 b5 27. Rfe1 Bd7 28. Rd2 Bc6 29. Bxc6 Rxc6 
30. Re8 Bb6 31. Rb8 b4 32. Rb7 Kf8 33. Re2 Bc7 34. g4 Rc5 35. Ra7 Bb6 36. Ra6 Rc6 
37. Rd2 Rd6 38. Rd3 Kg7 39. c3 Kg8 40. a4 Kg7 41. cxb4 axb4 42. a5 Bc5 43. Rxd6 Bxd6 
44. Rxd4 Bc5 45. Rd5 Be3 46. Rd3 Bc5 47. Rd7 Be3 48. a6 h5 49. gxh5 Kf8 50. Rd3 Bc5 
51. Rg3 Ke8 52. h6 Bd6 53. a7 Ke7 54. Rd3 Bc7 55. a8=Q Bd6 56. h7 b3 57. Qb7+ Ke8 
58. h8=Q+ Bf8 59. Qe4# 1-0

WCCC 1986

Cray Blitz vs. HiTech, WCCC 1986, Photo from Historic Pictures by Ed Schröder

[Event "WCCC 1986"]
[Site "Cologne, Germany"]
[Date "1986.06.15"]
[Round "5"]
[White "Cray Blitz"]
[Black "Hitech"]
[Result "1-0"]
 
1. d4 d5 2. c4 dxc4 3. Nf3 Nf6 4. e3 e6 5. Bxc4 c5 6. Qe2 a6 7. dxc5 Bxc5 8. O-O b5 
9. Rd1 Qe7 10. Bd3 e5 11. e4 Nc6 12. Nc3 Bg4 13. Be3 Rd8 14. h3 Bxe3 15. Qxe3 Bxf3 
16. Qxf3 Nd4 17. Qg3 O-O 18. a4 b4 19. Nd5 Nxd5 20. exd5 Rxd5 21. Bxa6 b3 22. Qe3 Rfd8 
23. Bc4 Nc2 24. Qe2 Rc5 25. Rxd8+ Qxd8 26. Rb1 Nd4 27. Qf1 Qd7 28. Ra1 Qc6 29. Bb5 Nxb5
30. axb5 Qb7 31. Ra3 g6 32. Rxb3 Qd5 33. Rb4 Rc2 34. b3 Qd2 35. Rc4 Rb2 36. Re4 Qd5 
37. Qc4 Qd1+ 38. Kh2 Rxf2 39. Rxe5 Qd6 40. Qc8+ Kg7 41. Qc5 Qd2 42. Rg5 Re2 43. Rg4 Qa2 
44. Qc3+ Kg8 45. b6 Qa8 46. Qc7 Qf8 47. b7 Re8 48. Rc4 Kg7 49. Rc6 Rb8 50. Qc8 Rxc8 
51. bxc8=Q Qb4 52. Qc7 Qxb3 53. Qe5+ Kh6 54. Qf4+ Kg7 55. Qd4+ Kh6 56. Rb6 Qc2 
57. Qf4+ Kg7 58. Qf6+ Kh6 59. Qxf7 Qc8 60. Rd6 1-0

ACM 1988

Nelson, Hyatt, Weiner at the 19th ACM 1988, Orlando ^[12]

Can you find the position from the Photo in the pgn? ^[13]

[Event "ACM 1988"]
[Site "Orlando USA"]
[Date "1988.11.13"]
[Round "2"]
[White "Mephisto"]
[Black "Cray Blitz"]
[Result "1/2-1/2"]
 
1.Nf3 d5 2.d4 Bf5 3.c4 e6 4.Qb3 b6 5.Nc3 dxc4 6.Qxc4 Nf6 7.Bg5 Be7 8.e3 Nbd7 9.Qc6 Bb4 
10.Bxf6 gxf6 11.Rc1 a6 12.Be2 Ra7 13.Nh4 Bxc3+ 14.Rxc3 Bb1 15.Qa4 Be4 16.O-O Qb8 17.Rfc1 
b5 18.Qa5 Nb6 19.f3 Bd5 20.b3 Ba8 21.Rc5 f5 22.g3 Nd5 23.e4 fxe4 24.fxe4 Ne7 25.Bf3 O-O 
26.Rg5+ Ng6 27.Rcc5 Rd8 28.Qc3 Qb6 29.Rg4 Rd7 30.Bg2 Bb7 31.Nf3 Ra8 32.Ne5 Rd6 33.Qe3 Kf8 
34.Nf3 Ke8 35.e5 Rd7 36.Ng5 Bxg2 37.Kxg2 h5 38.Re4 Qb7 39.Qf3 Rad8 40.Qf2 Re7 41.Kg1 Red7 
42.Rc1 Re7 43.Rf1 a5 44.Qf6 Qb6 45.Rd1 Qc6 46.Re2 Qc3 47.Nxf7 Rxd4 48.Rf1 Qd3 49.Ref2 h4
50.Rf3 Qc2 51.R1f2 Qc1+ 52.Kg2 hxg3 53.hxg3 Qb1 54.Nh8 Nxh8 55.Qxh8+ Kd7 56.Rf7 Qe4+ 
57.Kh2 Rxf7 58.Rxf7+ Kc6 59.Qe8+ Kb6 60.Qb8+ Qb7 61.Qxb7+ Kxb7 62.Kg2 Rd5 63.g4 Rxe5 
64.Kf3 Re1 65.Rf4 1/2-1/2

Quote

by Robert Hyatt, September 2008 ^[14]:

It was originally FORTRAN as that was the only choice on the system we had in 1968. I started to convert it to PL/1 several times, but each time I thought about it, portability was an issue as PL/1 was really an IBM language at first, and then when the Cray came along in the mid 70's it was obvious that they were never going to be anything but a FORTRAN machine, so I stuck with FORTRAN.

For speed, we did lots of profiling and rewrote the time-critical parts in cray assembly language. We made sure that the CAL code was functionally equivalent to the FORTRAN code so that we could debug things, but the CAL was pretty wild in that it was really tailored to use the architectural tricks available in the Cray, such as vector operations, tons of registers, etc.

I think I will put the whole mess on my ftp box in case anyone is interested. I played one test game between CB and Crafty last night, one CPU, no pondering since CB can't yet ponder, 10 secs per move. Crafty won handily, typically searching 14-15 plies to CB's 9-10. I even used the nm=2 command to set null-move R=2 in CB. Not quite sure why the depth is so different, other than the checks and things CB does in the q-search might be a bit out of control, and/or the extensions might be "too much". But in any case, it played just fine, although not all compilers are going to be happy compiling it I'd bet...

Publications

1981 ...

Robert Hyatt (1981). The Cray-1 Plays Chess (Part 1). Personal Computing, Vol. 5, No. 1, pp. 83
Robert Hyatt (1981). The Cray-1 Plays Chess (Part 2). Personal Computing, Vol. 5, No. 2, pp. 95 » Cray-1
Robert Hyatt (1981). Checkmate: The Cray-1 Plays Chess. Part 1. Cray Channels, Vol. 3, No. 1. pdf from The Computer History Museum
Robert Hyatt (1981). Checkmate: The Cray-1 Plays Chess. Part 2. Cray Channels, Vol. 3, No. 2. pdf from The Computer History Museum
Robert Hyatt (1983). Cray Blitz - A Computer Chess Playing Program. Master's Thesis, University of Southern Mississippi
Harry Nelson (1984). How We Won The Computer Chess World's Championship. Excerpt from a talk given at he DAS Computer Science Colloquium, pdf from The Computer History Museum » WCCC 1983
Tony Harrington (1984). Blitz on New York - Report of WCCC 1983. Personal Computer World, February 1984 » WCCC 1983

1985 ...

David E. Welsh, Boris Baczynskyj (1985). Computer Chess II. William C Brown Publications, ISBN-13: 978-0697099112 ^[15] ^[16]
Robert Hyatt, Albert Gower, Harry Nelson (1985). Cray Blitz. Advances in Computer Chess 4, reprinted (1988). in Computer Chess Compendium
Harry Nelson (1985). Hash Tables in Cray Blitz. ICCA Journal, Vol. 8, No. 1
Robert Hyatt (1985). Parallel Chess on the Cray X-MP/48. ICCA Journal, Vol. 8, No. 2
Robert Hyatt, Harry Nelson, Albert Gower (1986). Cray Blitz - 1984 Chess Champion. Telematics and Informatics Vol. 2, No. 4, pp. 299-305. Pergammon Press Ltd.
Harry Nelson, Robert Hyatt (1988). The Draw Heuristic of Cray Blitz. ICCA Journal, Vol. 11, No. 1
Harry Nelson (1989). Some Observations about Hash Tables in Cray Blitz. Workshop on New Directions in Game-Tree Search

1990 ...

Robert Hyatt, Albert Gower, Harry Nelson (1990). Cray Blitz. Computers, Chess, and Cognition, pp. 111-130
Robert Hyatt, Harry Nelson (1990). Chess and supercomputers: details about optimizing Cray Blitz. Supercomputing '90, pdf

Forum Posts

1990 ...

Cray Blitz Evaluation by Robert Hyatt, rgc, March 05, 1993 » Evaluation
Re: Did Cray Blitz really have a win? by Robert Hyatt, rec.games.chess.misc, March 12, 1999 » ACM 1985, WCCC 1986, Holes
hardware of Cray Blitz by Leonid, CCC, June 13, 1999 » WCCC 1983
Why did Cray Blitz has a king safety hashtable? by Michel Langeveld, CCC, June 21, 1999
Bob - Question about Cray Blitz and Vector Processing by William Bryant, CCC, August 13, 1999

2000 ...

Cray Blity 1981? by Joshua Lee, CCC, June 02, 2000 » ACM 1981
Cray Blitz source (Carey) by Robert Hyatt, CCC, September 10, 2008

2010 ...

An interesting book with some insights on Bob's Cray Blitz by Julien Marcel, CCC, June 23, 2011
Transposition tables in Cray Blitz by Erin Dame, CCC, September 26, 2016 ^[17] » Transposition Table

External Links

Index of /downloads/crayblitz
Cray Blitz' ICGA Tournaments
Cray Blitz games at chessgames.com
Cray Blitz from Wikipedia
Cray Blitz from The Computer History Museum
Oral History of Harry Nelson - Video, The Computer History Museum
How to beat a chess champion - David Levy vs. computer program CRAY BLITZ, Science News, Feb 16, 1985
Classic Computer Chess - ... The programs of yesteryear by Carey, hosted by the Internet Archive ^[18]
How Far We've Come: 20 Years of Personal Computing by Blake Linton Wilfong, November 05, 2000 » ACM 1981, Sargon, Crafty
The wrong bishop – part two by Frederic Friedel, ChessBase News, May 22, 2016 » Mikhail Botvinnik, Wrong color Bishop and rook pawn, WCCC 1983
Cray-1 – the eight million dollar super-computer by Frederic Friedel, ChessBase News, September 23, 2016 » Cray-1 ^[19]

References

^ The Eleventh ACM's North American Computer Chess Championship, pdf from The Computer History Museum
^ Letter to Robert Hyatt August 5, 1981 (pdf) Courtesy of Harry Nelson from The Computer History Museum
^ Robert Hyatt (1983). Cray Blitz - A Computer Chess Playing Program. Master's Thesis, University of Southern Mississippi
^ Robert Hyatt, Albert Gower, Harry Nelson (1985). Cray Blitz. Advances in Computer Chess 4, reprinted (1988). in Computer Chess Compendium
^ Robert Hyatt (1985). Parallel Chess on the Cray X-MP/48. ICCA Journal, Vol. 8, No. 2
^ Robert Hyatt, Harry Nelson (1990). Chess and Supercomputers, details on optimizing Cray Blitz. Proceedings of Supercomputing '90
^ The DTS high-performance parallel tree search algorithm by Robert Hyatt
^ Harry Nelson (1984). How We Won The Computer Chess World's Championship. Excerpt from a talk given at the DAS Computer Science Colloquium, pdf, Courtesy of Harry Nelson from The Computer History Museum
^ Robert Hyatt, Albert Gower, Harry Nelson (1990). Cray Blitz. Computers, Chess, and Cognition
^ The New Champion by Harold Bogner, Chess Life, February 1984, pdf from The Computer History Museum, Cover Photo: Ken Thompson, Joe Condon, Robert Hyatt, and Albert Gower
^ László Lindner, A SZÁMÍTÓGÉPES SAKK KÉPEKBEN című melléklete - The pictures of the Beginning of Chess Computers
^ Photo from The Computer History Museum (wrong text)
^ Downloads Games Country championships from the CSVN site
^ Re: Cray Blitz source (Carey) by Robert Hyatt, CCC, September 10, 2008
^ An interesting book with some insights on Bob's Cray Blitz by Julien Marcel, CCC, June 23, 2011
^ Transposition tables in Cray Blitz by Erin Dame, CCC, September 26, 2016
^ David E. Welsh, Boris Baczynskyj (1985). Computer Chess II. William C Brown Publications, ISBN-13: 978-0697099112
^ Re: Old programs CHAOS and USC by Dann Corbit, CCC, July 11, 2015
^ How fast was the Cray? by Sean Evans, CCC, September 23, 2016

What links here?

Page	Date Edited
0x88	Nov 28, 2016
ACM 1980	Dec 25, 2017
ACM 1981	Jan 19, 2018
ACM 1982	Jul 19, 2016
ACM 1983	Oct 14, 2014
ACM 1984	Jul 19, 2016
ACM 1985	Jun 21, 2017
ACM 1987	Dec 5, 2017
ACM 1988	Dec 5, 2017
ACM 1989	Jun 7, 2016
ACM 1991	Nov 25, 2017
ACM 1993	Oct 30, 2017
ACM 1994	May 5, 2017
ACM North American Computer Chess Championship	Jun 13, 2015
Advances in Computer Chess 4	Jan 22, 2018
Albert Gower	Jan 7, 2016
Assembly	Sep 3, 2017
BCP	Dec 30, 2015
Bebe	Dec 23, 2017
Blitz	Dec 23, 2017
Bobby	Jan 7, 2016
Boris Baczynskyj	Oct 1, 2016
Carey Bloodworth	Jul 19, 2016
Cartoons	Dec 1, 2017
Chess Challenger	Dec 27, 2017
Chess Game	Mar 28, 2017
ChipTest	Jun 19, 2016
Computer Chess Compendium	Dec 29, 2015
Computers, Chess, and Cognition	Dec 28, 2016
Crafty	Jan 28, 2018
Cray Blitz	Dec 25, 2017
Cray X-MP	Jul 26, 2017
Cray-1	Dec 25, 2017
Cyrus	Jul 22, 2014
David Darling	Aug 23, 2017
David E. Welsh	Dec 25, 2017
Deep Sjeng	Jan 7, 2016
Derek Robb	Aug 23, 2017
Don Dailey	Dec 7, 2016
Draw	Apr 14, 2018
Dynamic Tree Splitting	Apr 10, 2017
Engines	Mar 10, 2018
Erin Dame	Dec 2, 2017
Evaluation	Feb 1, 2018
Frederic Friedel	Jan 6, 2018
Hans Berliner	Jun 10, 2017
Harold Bogner	Oct 12, 2012
Harry Nelson	Jul 26, 2017
Hash Table	Jan 1, 2018
History	Jan 2, 2018
HiTech	Mar 31, 2018
Holes	Oct 16, 2017
ICGA Journal	Dec 21, 2017
Julien Marcel	Oct 19, 2016
La Regence	Jul 23, 2015
Lachex	Jan 7, 2016
Lawrence Livermore National Laboratory	Feb 7, 2017
Leonid Liberman	May 23, 2015
Levy versus Deep Thought 1989	Jun 2, 2015
Mathematician	Apr 9, 2018
Mephisto	Dec 18, 2017
Mephisto Almeria	Sep 1, 2017
Mephisto Portorose	Sep 1, 2017
Mikhail Botvinnik	Jul 15, 2017
Netherlands-vs-Computers-1989	Mar 10, 2017
Node Types	Oct 22, 2017
Nuchess	Apr 3, 2017
Parallel Search	Dec 30, 2017
Personal Computer World	Apr 12, 2013
Personal Computing	Dec 27, 2017
Repetitions	Jan 16, 2018
Rival	Jul 30, 2017
Robert Hyatt	Dec 25, 2017
Rule of the Square	Sep 6, 2014
Sargon	Dec 25, 2017
Score	Apr 14, 2018
Socrates	Jul 3, 2018
Spector	Nov 11, 2016
Time Management	Mar 20, 2018
Titan	Jul 3, 2018
Tony Harrington	Sep 26, 2014
Transposition Table	Apr 19, 2018
University of Alabama at Birmingham	Jul 14, 2014
University of Southern Mississippi	Dec 27, 2017
WCCC 1983	Jan 20, 2018
WCCC 1986	Jul 27, 2017
WCCC 1989	Dec 5, 2017
Who's Who	Sep 6, 2017
World Computer Chess Championship	Mar 6, 2018
Wrong color Bishop and rook pawn	Oct 19, 2017
Young Brothers Wait Concept	Apr 22, 2018
Zarkov	Feb 26, 2018

Up one Level

Cube

GerdIsenberg — Sun, 23 Apr 2017 19:28:24 GMT

Home * Engines * Cube

		Cube, a chess program from the early 80s, written in Fortran IV by Lloyd L. Lank ^[1] and James A. Lank, at that time affiliated with United Computing Inc. ^[2] , Kansas City, Missouri. Cube ran on a Cray-1, participating as Cube 2.0 at the ACM 1980 ^[3] , and as Cube 2.1 the ACM 1981 ^[4] .
Cube ^[5]

Description

A brief description is available from the ACM 1980 tournament booklet ^[6] :

Cray-1, United Computing, Kansas City (512k; 64 bits; 80,000,000 inst/sec)

Cube 2.0 is an updated version of Cube 1.1. It executes on either the Cray-1 or on an Honeywell 60/80 provided by Honeywell in Minneapolis. The program is written in Fortran, uses alpha-beta algorithm and iterative deepening. On the Cray-1, the Lanks say the program examines 4,000 nodes per second. This is its first ACM tournament.

External Links

References

What links here?

Page	Date Edited
ACM 1980	Dec 25, 2017
ACM 1981	Jan 19, 2018
Cray-1	Dec 25, 2017
Cube	Apr 23, 2017
Engines	Mar 10, 2018
James A. Lank	Jun 13, 2015
Lloyd L. Lank	Nov 30, 2017

Up one level

Daja

GerdIsenberg — Wed, 23 Nov 2016 22:04:22 GMT

Home * Engines * Daja

		Daja, an early chess program written in 1974 by Siegfried Jahn and Ludwig Zagler from Technical University of Munich as part of Jahn's Master's thesis. Co-author and thesis supervisor Ludwig Zagler continued the development on Daja, which evolved to Elsa, the program which participated at the WCCC 1977 in Toronto. Daja was written for a Telefunken TR 440 ^[1] from Leibniz-Rechenzentrum. Since the computer was too busy otherwise, Daja was restricted to play test games during the night ^[2] . Daja was runner up at the First GI Computer Chess Tournament 1975 in Dortmund after losing the playoff versus Tell ^[3] ^[4].
Ludwig Zagler with Daja ^[5]

Publications

Erstes Computer-Schachturnier der Gesellschaft für Informatik October 17, 1975, Computerwoche 42/1975 (German)
Schach: Die Zugmaschine Der Spiegel 16/1976, April 12, 1976 (German) pdf hosted by Hein Veldhuis

External Links

Daja (Daya) a character in Lessing's Nathan the Wise ^[6] ^[7]

References

^ Leibniz-Rechenzentrum 1974 by Gerd R. Sapper (German)
^ Karsten Bauermeister (1995). Aufbruchstimmung in Deutschland. Computerschach und Spiele Heft 6, 1995 (German)
^ Tells Geschoß: Schachmatt, October 17, 1975, Computerwoche 42/1975 (German)
^ Monroe Newborn (1979). Recent Progress in Computer Chess. Advances in Computers, Vol. 18, pp. 59-117. Academic Press, New York, N.Y. Reprinted (1988) in Computer Games I (ed. David Levy), pp. 226-324, Springer
^ Schach: Die Zugmaschine Der Spiegel 16/1976, April 12, 1976 (German) pdf hosted by Hein Veldhuis
^ Nathan the Wise; a dramatic poem in five acts by Gotthold Ephraim Lessing at Project Gutenberg (English translation by William Taylor)
^ Gotthold Ephraim Lessing: Nathan der Weise

What links here?

Page	Date Edited
Daja	Nov 23, 2016
ECCC 1976	Sep 6, 2017
Elsa	Sep 6, 2017
Engine Testing	Feb 1, 2018
Engines	Mar 10, 2018
First GI Computer Chess Tournament	Jan 3, 2018
Ludwig Zagler	Sep 6, 2017
Mathematician	Apr 9, 2018
Proscha	May 20, 2015
Siegfried Jahn	May 30, 2016
Technical University of Munich	Jul 26, 2016
TR 440	Aug 28, 2014

Up one level

Dark Horse

GerdIsenberg — Tue, 19 Jul 2016 14:15:21 GMT

Home * Engines * Dark Horse

		Dark Horse, an early chess program witten by Ulf Rathsman in Fortran, running on a CDC 6600 mainframe computer ^[1], and later on a 36-bit one's complement UNIVAC 1100 ^[2]. Dark Horse played the WCCC 1977 in Toronto, the WCCC 1980 in Linz, and was runner-up at the ECCC 1979 ^[3].
Dark Horse Nebula ^[4]

Dark Horses elsewhere

References

What links here?

Publications

Peter Jennings (1978). Microchess 1.5 Versus Dark Horse. BYTE, Vol. 3, No. 3 » MicroChess

External Links

Chess program

Dark Horses elsewhere

References

^ Peter Jennings (1978). Microchess 1.5 Versus Dark Horse. BYTE, Vol. 3, No. 3
^ 3rd World Computer Chess Championship - Linz 1980 (ICGA Tournaments)
^ Barend Swets (1978). Second European Computer Chess Championship, Announcement. ICCA Newsletter, Vol. 1, No. 1
^ Photo of the Great Dark Horse Nebula, March 09, 2006, Dark Horse (astronomy)

What links here?

Page	Date Edited
Black Knight	Dec 25, 2017
Byte Magazine	Nov 20, 2016
CDC 6600	Oct 8, 2014
Dark Horse	Jul 19, 2016
ECCC 1979	Sep 9, 2017
Engines	Mar 10, 2018
European Computer Chess Championship	Sep 1, 2014
MicroChess	Jul 14, 2015
Nebula	Feb 7, 2015
Orion	Oct 15, 2017
Peter Jennings	Mar 18, 2016
Princhess	Sep 3, 2017
Ulf Rathsman	Jan 7, 2016
UNIVAC 1100	Jul 21, 2016
WCCC 1977	Dec 22, 2017
WCCC 1980	Dec 25, 2017

Up one Level

Dart

GerdIsenberg — Fri, 19 Jan 2018 12:11:37 GMT

Home * Engines * Dart

Dart, (Dart 4.1)
a chess program developed at Dartmouth College as successor of Dartmouth CP by a team around Larry Harris and primary author Warren Montgomery, supported by Danny Kopec, Hal Terrie, and David Levner et al. ^[1] ^[2]. Dart was written in GCOS assembly, the language for the GE-635, to run under the Dartmouth Time Sharing System.

ACM 1974

Dart 4.1 played the ACM 1974 in San Diego, where it lost from Chess 4.2 and CHAOS, and won from Xenarbor and Ostrich.

Selected Games

Chess

ACM 1974, round 1, Dart 4.1 - Chess 4.2

[Event "ACM 1974"]
[Site "San Diego USA"]
[Date "1974.11.10"]
[Round "1"]
[White "Dart 4.1"]
[Black "Chess 4.2"]
[Result "0-1"]
 
1.e4 e5 2.f4 exf4 3.Nf3 g5 4.Nc3 g4 5.Ne5 Qh4+ 6.g3 fxg3 7.Qxg4 g2+ 8.Qxh4 
gxh1=Q 9.Qh5 Bb4 10.Nxf7 Nf6 11.Nd6+ Kd8 12.Nf7+ Ke7 13.Nd5+ Nxd5 14.Nxh8 Qxe4+ 
15.Be2 Nf4 16.Qg5+ Kf8 17.Qg4 Bd6 18.Qf3 Qxe2+ 19.Qxe2 Nxe2 20.Kxe2 Bxh2 21.d3 Be5 
22.Bh6+ Ke7 23.Bg5+ Ke6 24.Rf1 Bxh8 25.Rf8 Bxb2 26.Rxc8 Be5 27.Re8+ Kd6 28.Rf8 h5 
29.c4 c6 30.a4 b6 31.Rf7 Na6 32.Ke3 Nc5 33.a5 Rg8 34.Bh4 bxa5 35.Kd2 Rg2+ 36.Ke3 
Bd4+ 37.Kxd4 Rg4+ 38.Kc3 Rxh4 39.Rf6+ Ke5 40.Rf3 a4 41.Re3+ Kd6 42.Kd2 a3 43.Rg3 
a2 44.Rg1 a1=Q 45.Rxa1 Nb3+ 46.Kc3 Nxa1 47.Kb2 Rh1 48.Kc3 Ke5 49.c5 Rh2 50.Kc4 a5 
51.d4+ Ke4 52.Kc3 Rc2# 0-1

Ostrich

ACM 1974, round 3, Dart 4.1 - Ostrich

[Event "ACM 1974"]
[Site "San Diego USA"]
[Date "1974.11.11"]
[Round "3"]
[White "Dart 4.1"]
[Black "Ostrich"]
[Result "1-0"]
 
1.e4 d5 2.Nc3 dxe4 3.Nxe4 Nd7 4.Nf3 e6 5.Be2 Nh6 6.O-O Be7 7.d4 O-O 8.Bxh6 gxh6 
9.c4 Nb6 10.Qc1 f5 11.Nc3 Bg5 12.Qc2 a5 13.Rfe1 Bf6 14.Rad1 Bd7 15.c5 Nc8 16.Bc4 
Qe8 17.Qb3 Kg7 18.Qxb7 Ra7 19.Qb3 Kf7 20.Bxe6+ Bxe6 21.d5 Ra6 22.dxe6+ Kg6 23.Qc4 
Rc6 24.Ne5+ Bxe5 25.Rxe5 Nb6 26.Qd4 Nc8 27.Rde1 Ne7 28.Qa4 Rf6 29.f4 Qa8 30.Qd4 
Qb7 31.Nd5 Rcxe6 32.Rxe6 Nxd5 33.Rxf6+ Nxf6 34.Re6 Qe4 35.Qxf6+ Kh5 36.Rxe4 Kg4 
37.Qg7+ 1-0

External Links

References

^ The Dartmouth Computing Timeline - The 1970s - 1973 - Chess Program in Tournament
^ Danny Kopec (1977). Recent developments in computer chess. Firbush News 7 Edinburgh: Machine Intelligence Research Unit, University of Edinburgh (ed. Donald Michie), pdf - Work at Dartmouth College

What links here?

Page	Date Edited
ACM 1974	Jan 19, 2018
Dart	Jan 19, 2018
Dartmouth College	Dec 16, 2016
Engines	Mar 10, 2018
Honeywell 6000	Jan 19, 2018
Larry Harris	Apr 3, 2013
Warren Montgomery	Feb 19, 2015

Up one Level

Dartmouth CP

GerdIsenberg — Fri, 19 Jan 2018 12:14:54 GMT

Home * Engines * Dartmouth CP

		Dartmouth CP, a chess program developed in the early 70s at Dartmouth College by a team lead by professor Larry Harris. Primary author was Warren Montgomery ^[1], supported by co-authors Danny Kopec, Hal Terrie, David Levner and others ^[2]. Dartmouth CP was written in GCOS assembly, the language for the GE-635, to run under the Dartmouth Time Sharing System. In his 1973 paper on Bandwidth Search ^[3], which was applied successfully to chess and therefor likely to Dartmouth CP, Larry Harris acknowledged professor Steve Garland and the undergraduates Warren Montgomery, Dave Chenerow, Dexter Kozen, and Steve Poulsen for their work on that topic ^[4].
Keggy the Keg ^[5]

Challenging Chess

Excerpt from Danny Kopec's Recent developments in computer chess ^[6]:

Dartmouth's program was the first program to challenge Northwestern's ascendancy in the ACM tournaments. In the ACM U.S. Computer Chess Championship, held in Atlanta, Northwestern's program was lucky to draw against Dartmouth. It only did so because the latter had no repetition check. Particularly encouraging was the fact that in a game of more than 50 moves, Dartmouth was never in a losing position.

[Event "ACM 1973"]
[Site "Atlanta USA"]
[Date "1973.08.26"]
[Round "2"]
[White "Dartmouth CP"]
[Black "Chess 4.0"]
[Result "1/2-1/2"]
 
1.e4 c5 2.Nf3 Nc6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 d6 6.Be3 Nxd4 7.Bxd4 e5 8.Be3 Be7 
9.Bb5+ Bd7 10.Qd3 O-O 11.O-O-O Ng4 12.Bxd7 Qxd7 13.Nd5 Bh4 14.f3 Nf2 15.Bxf2 Bxf2 
16.Rd2 Bc5 17.b4 Bd4 18.c3 Bb6 19.Nxb6 axb6 20.b5 Kh8 21.Qd5 Rfc8 22.Kb2 Rc5 
23.Qxd6 Rxb5+ 24.Ka1 Qc8 25.Qd3 Rba5 26.Rb1 Qc7 27.Rb4 Ra3 28.Rc4 Qe7 29.Rb4 Qf6 
30.Rb5 R3a4 31.Qd5 Qh4 32.Rxb6 R4a5 33.Qd6 Qe1+ 34.Rb1 Qh4 35.Qd7 b5 36.Qxf7 Qxh2 
37.Qd7 Qf4 38.Qd8+ Qf8 39.Qxf8+ Rxf8 40.Kb2 Rfa8 41.Ra1 R5a6 42.Rd5 Rg6 43.g4 Rf6
44.Rxb5 Rxf3 45.Rxe5 Rb8+ 46.Kc2 Rc8 47.Kb3 Rfxc3+ 48.Kb4 Rc2 49.Re7 Rb2+ 50.Ka3 
Rg2 51.e5 Rxg4 52.e6 Rg2 53.Ka4 Rb2 54.Ra7 h5 55.a3 Rc4+ 56.Ka5 Rc5+ 57.Ka4 g5 
58.e7 Rc4+ 59.Ka5 Rb8 60.Re1 Rc5+ 61.Ka4 Rcc8 62.Re5 Ra8 63.Rxa8 Rxa8+ 64.Kb5 Re8 
65.Rxg5 Rxe7 66.Rxh5+ Kg7 67.Kb6 Re6+ 68.Kb5 Re7 69.Kb6 Re6+ 70.Kb5 Re7 71.Kb6 
1/2-1/2

Evaluation

Danny Kopec in Recent developments in computer chess on the Evaluation of Dartmouth CP ^[7]:

The program is divided into two major evaluation functions, ĥ and đ. ĥ is concerned with the "soft", positional features of a given board position, while đ is concerned with the "hard" tactical features of a position. The specific chess concepts which comprise đ and ĥ are called "Detectors". A set of related detectors are assigned various values (weights) and are put into a table. ĥ includes tables such as Centre Control, Piece Mobility, Pawn Structure, King Safety, etc., while đ includes tables such as Pins, Forks, Discovered Attacks, Levers. The program is also divided into modules (Opening, Middle Game, and Endings) which allow greater flexibility in the assignment of weights. For example, in the opening, Piece-development, Centre control and King safety are stressed. A persistent problem which many programs still have is the too early development of the queen, because of its tremendous square control, mobility, and ability to produce threats. By assigning a value of -300 (where 100 = pawn) to every minor piece (B or N) still on the back rank, piece development is given prominence, since the program tries to get rid of these initial negative values. Other examples of tables which employ modular flexibility are Occupation of the Centre, and Rook on 7th. Greater weights are assigned to these in the middle game and ending than in the opening, to avoid moving the same pieces too often, before others have moved at all.

An idea which was never fully implemented was that of an "Attack-Defence Ratio". This is a measure of the difference between the sum of the forces attacking the quarter of the board where the enemy king is located and the sum of those forces which defend the same squares. If this difference in force is greater than a certain threshold value, an "alarm" is set off which results in a higher đ value and an increase in the depth of search. In this manner, long sacrificial variations are more carefully investigated. A benchmark of sacrificial positions would be a good test for its effectiveness.

Dartmouth's most "informed" table was the one on pawn formations, called "PFORM". Among its standard detectors were Isolated Pawns, Backward Pawns, Doubled Pawns, Passed Pawns, and Duos. Detectors such as Chains, Mini-chains, Shielded Backward Pawns, Potential Passed Pawns, and the table, "Levers", were among the more esoteric concepts which were added later. Many of these definitions were taken directly from Hans Kmoch's classic work Pawn Power ^[8]. The concept, Levers, using a modified definition of my own "pawn mover wich improve our formation and hurt our opponent's" - proved useful in the recognition of critical pawn moves. In addition, the levers concept helps to guide the placement of pieces especially in the opening and middle game. It could also help toward plan formation. Some further pawn formational concepts from Pawn Power which were never programmed were Outpost and Weak Square Complexes. The Dartmouth program is probably, in theory, capable of more sophisticated pawn formational evaluations than any other program; however the implementation is rudimentary. The program had at one time approximately 50 detectors in various tables and many others were planned.

Publications

Larry Harris (1973). The bandwidth heuristic search. 3. IJCAI 1973, pdf
Larry Harris (1974). Heuristic Search under Conditions of Error. Artificial Intelligence, Vol. 5, No. 3, pp. 217-234. ISSN 0004-3702. Also published (1977) under the title: The heuristic search: An alternative to the alpha-beta minimax procedure. Chess Skill in Man and Machine (ed. Peter W. Frey), pp. 157-166
Larry Harris (1975) The Heuristic Search And The Game Of Chess - A Study Of Quiescence, Sacrifices, And Plan Oriented Play. 4. IJCAI 1975, 334-339. reprinted in Computer Chess Compendium by David Levy (Editor), pp. 136 - 142
Danny Kopec (1977). Recent developments in computer chess. Firbush News 7 Edinburgh: Machine Intelligence Research Unit, University of Edinburgh (ed. Donald Michie), pdf

External Links

The Dartmouth Computing Timeline - The 1970s - 1973 - Chess Program in Tournament

References

^ The Dartmouth Computing Timeline - The 1970s - 1973 - Chess Program in Tournament
^ Danny Kopec (1977). Recent developments in computer chess. Firbush News 7 Edinburgh: Machine Intelligence Research Unit, University of Edinburgh (ed. Donald Michie), pdf - Work at Dartmouth College
^ Bandwidth search | Variants of A* from Amit’s A* Page
^ Larry Harris (1973). The bandwidth heuristic search. 3. IJCAI 1973, pdf
^ Dartmouth College from Wikipedia
^ Danny Kopec (1977). Recent developments in computer chess. Firbush News 7 Edinburgh: Machine Intelligence Research Unit, University of Edinburgh (ed. Donald Michie), pdf
^ Danny Kopec (1977). Recent developments in computer chess. Firbush News 7 Edinburgh: Machine Intelligence Research Unit, University of Edinburgh (ed. Donald Michie), pdf
^ Hans Kmoch (1959, 1990). Pawn Power in Chess. New York: Dover, 1990. Previous ed.: New York: McKay, 1959. ISBN 0-486-26486-6, Google Books, amazon

What links here?

Page	Date Edited
ACM 1973	Jan 19, 2018
Danny Kopec	Oct 1, 2016
Dart	Jan 19, 2018
Dartmouth College	Dec 16, 2016
Dartmouth CP	Jan 19, 2018
Engines	Mar 10, 2018
Hal Terrie	Feb 19, 2015
Honeywell 6000	Jan 19, 2018
Larry Harris	Apr 3, 2013
Mathematician	Apr 9, 2018
Warren Montgomery	Feb 19, 2015

Up one Level

David

GerdIsenberg — Wed, 20 Jul 2016 15:44:47 GMT

Home * Engines * David

		David, an early chess program by Gerhard Wolf ^[1], in the 70s affiliated with the Graz University of Technology and its computer center Rechenzentrum Graz, Austria. David played the ACM 1971 in Chicago and ran on an UNIVAC 494 at UNIVAC Division, St. Paul, Minnesota, taking 10K 30-bit words of memory ^[2]. David lost from Tech, won versus Schach and drew CCCP.
David ^[3]

Selected Games

ACM 1971, round 2, David - Schach ^[4]

[Event "ACM 1971"]
[Site "Chicago USA"]
[Date "1971.08.03"]
[Round "2"]
[White "David"]
[Black "Schach"]
[Result "1-0"]
 
1.e4 e5 2.Nc3 Nf6 3.d4 d6 4.Nf3 Ng4 5.h3 Nh6 6.dxe5 dxe5 7.Qxd8+ Kxd8
8.Bxh6 gxh6 9.Rd1+ Bd6 10.Nxe5 Nd7 11.Nxf7+ Ke7 12.Nxh8 Be5 13.Nd5+ Kf8
14.f4 Bxh8 15.Nxc7 Bxb2 16.Nxa8 Bc3+ 17.Kf2 1-0

External Links

References

^ Gerhard Wolf (1973). Implementation of a dynamic tree searching algorithm in a chess programme. Proceedings of the ACM annual conference
^ Woodrow W. Bledsoe (1971). Results of Second Annual Computer Chess Championship. ACM SIGART Bulletin, No. 30
^ Michelangelo's statue of the biblical David, Accademia di Belle Arti Firenze
^ PGN Download NACCC from Computerschaak/Downloads/Games hosted by CSVN

What links here?

Page	Date Edited
ACM 1971	Jul 19, 2016
Betsabe	Jul 23, 2017
CCCP (US)	Dec 22, 2017
David	Jul 20, 2016
Engines	Mar 10, 2018
Gerhard Wolf	Jan 7, 2016
Goliath	Apr 5, 2017
UNIVAC 494	Jul 21, 2016

Up one level

Deep Blue

GerdIsenberg — Tue, 01 Aug 2017 20:33:49 GMT

Home * Engines * Deep Blue

		Deep Blue, the IBM sponsored successor of the chess entity Deep Thought. The project was initially started 1985 as ChipTest at Carnegie Mellon University by the computer science doctoral students Feng-hsiung Hsu and Thomas Anantharaman. Murray Campbell, former co-developer of HiTech, joined the ChipTest team a few months later. The program was named Deep Thought after the fictional computer of the same name from The Hitchhiker's Guide to the Galaxy. Hsu and Campbell joined IBM in 1989, Deep Blue was developed out of this. The name is a play on Deep Thought and Big Blue, IBM's nickname. The declared target was to become the strongest chess entity ever and to beat the human world champion.
Deep blue chip ^[1]

WCCC 1995

Kasparov versus Deep Blue

Selected Publications

WCCC 1995

Deep Blue Prototype missed the expected win at the WCCC 1995 by losing the decisive match in round 5 against Fritz after king castling into Fritz's half open g-file. Description given in 1995 from the ICGA site ^[2] :

Deep Blue Prototype consists of an IBM RS/6000 workstation with 14 chess search engines as slave processors. Each processor contains a VLSI chip for move generation, as well as additional hardware for search and evaluation. Each Deep Thought 2 processor searches about 500,000 positions per second standalone, or about 400,000 positions per second as a slave processor. (This is about 1/10th of the projected speed of the Deep Blue single-processor currently in fabrication.) The 14- processor Deep Thought 2 typically searches between 3 and 5 million positions per second. When conducting a search, the search tree near the root position is processed on the host workstation, and includes selective search extension algorithms such as singular extensions. The deepest nodes in the search tree are handled by the slave search engines which usually do 4-ply alpha-beta searches.

Kasparov versus Deep Blue

Main article: Kasparov versus Deep Blue 1996

Deep Blue was the first machine to win a chess game against a reigning world champion Garry Kasparov under regular time controls. This first win occurred on February 10, 1996, Game 1. However, Kasparov won three games and drew two of the following games, beating Deep Blue by a score of 4–2.

The Rematch

Main article: Kasparov versus Deep Blue 1997

In 1997 Deep Blue won the rematch against Kasparov. He did not recover after the shock by Deep Blues' play in game 2. Kasparov resigned a drawn position, since he missed a deep tricky perpetual check, while he wrongly was confident the machine would not have blundered to allow him to draw. In the final decisive game 6 Kasparov was rather indisposed and blundered in the early opening.

The Deep Blue Team

Feng-hsiung Hsu - The man who started the Deep Blue project while still in college
Murray Campbell - A former chess champion who works with Deep Blue's evaluation function
A. Joseph Hoane - Deep Blue's software engineer
C. J. Tan - Senior manager of the Deep Blue development team
Jerry Brody - The project's support engineer
Joel Benjamin - development team chess consultant, opening book author

Photos

The core Deep Blue team, Joe Hoane, Feng-hsiung Hsu, and Murray Campbell ^[3]

Selected Publications

1995 ...

Feng-hsiung Hsu, Murray Campbell, Joe Hoane (1995). Deep Blue System Overview. International Conference on Supercomputing, pp. 240-244.

1996

Paul Hsieh (1996). Deep Blue - Deep Thought 2. Computer Chess Reports, Vol 5, No 3+4, pp. 45
Tony Marsland (1996). The ACM Chess Challenge. pdf from the The Computer History Museum, Courtesy of ACM
Tony Marsland (1996). The Future of Computer Chess. ICCA Journal, Vol. 19, No. 1
Jos Uiterwijk (1996). The Kasparov - Deep Blue Match. ICCA Journal, Vol. 19, No. 1
Yasser Seirawan (1996). The Kasparov - Deep Blue Games. ICCA Journal, Vol. 19, No. 1
Hans Berliner (1996). Why did Kasparov Blink? ICCA Journal, Vol. 19, No. 2
Toshinori Munakata (1996). Thoughts on Deep Blue vs. Kasparov. Communications of the ACM, Vol. 39, No. 7, pdf

1997

Robert Levinson, Jeff Wilkinson (1997). Deep Blue is Still an Infant. AAAI Technical Report WS-97-04 ^[4]
Monroe Newborn (1997). Kasparov versus Deep Blue: Computer Chess Comes of Age. Springer ^[5]
Richard Korf (1997). Does Deep Blue use AI? AAAI Workshop: Deep Blue Versus Kasparov: The Significance for Artificial Intelligence 1997, pdf
Tony Marsland, Yngvi Björnsson. (1997). From MiniMax to Manhattan. AAAI Workshop: Deep Blue Versus Kasparov: The Significance for Artificial Intelligence 1997, pdf
Jonathan Schaeffer, Aske Plaat (1997). Kasparov versus Deep Blue: The Rematch. ICCA Journal, Vol. 20, No. 2
Fernand Gobet (1997). Can Deep Blue make us happy? Reflections on Human and Artificial Expertise. AAAI Workshop: Deep Blue Versus Kasparov: The Significance for Artificial Intelligence 1997
Yasser Seirawan, Herbert Simon, Toshinori Munakata (1997). The Implications of Kasparov vs. Deep Blue. Communications of the ACM, Vol. 40, No. 8, pdf hosted from The Computer History Museum
Daniel C. Dennet (1997). Can Machines Think? Deep Blue and Beyond. ICCA Journal, Vol. 20, No. 4
Thomas Anantharaman (1997). Evaluation Tuning for Computer Chess: Linear Discriminant Methods. ICCA Journal, Vol. 20, No. 4
Richard Korf (1997). Does DEEP BLUE use Artificial Intelligence? ICCA Journal, Vol. 20, No. 4 ^[6]

1998

Hans Berliner (1998). Review of Monty Newborn: Kasparov versus Deep Blue. pdf ^[7]

1999

Feng-hsiung Hsu (1999). IBM’s Deep Blue Chess Grandmaster Chips. IEEE Micro, Vol. 19, No. 2, pdf
Murray Campbell (1999). Knowledge Discovery in Deep Blue. Communications of the ACM, Vol. 42, No. 11

2000 ...

Feng-Hsiung Hsu (2001). Ken Thompson and DEEP BLUE. ICGA Journal, Vol. 24, No. 2
Gerald Tesauro (2001). Comparison Training of Chess Evaluation Functions. In Johannes Fürnkranz, Miroslav Kubat (eds.) (2001). Machines that learn to play games, 117–130, Nova Science Publishers » Automated Tuning, SCP
Murray Campbell, Joe Hoane, Feng-hsiung Hsu (2002). Deep Blue. Artificial Intelligence, Vol. 134, Nos. 1-2
Feng-hsiung Hsu (2002), Behind Deep Blue: Building the Computer that Defeated the World Chess Champion. Princeton University Press
Monroe Newborn (2002). Deep Blue: An Artificial Intelligence Milestone. Springer Verlag
Brian Bloomfield, Theodore Vurdubakis (2008). IBM's Chess Players: On AI and Its Supplements. The Information Society, Vol. 24, No. 2

Forum Posts

1995 ...

Is Computer Chess A Science? by Dr Nancy's Sweetie, rgcc, February 21, 1996

1997

Deep Blue vs Micros by Robert Hyatt, rgcc, February 18, 1997
DB Tweaking Between Games by Mike Gherrity, rgcc, May 13, 1997
Learning necessary for chess champion? by Mike Gherrity, rgcc, May 16, 1997
Deep Blue vs Micros - an interesting result just available by Robert Hyatt, rgcc, May 22, 1997
Deep Blue news by Jonathan Schaeffer, CCC, September 23, 1997
Deep Blue team to disclose their files by Jack van Rijswijck, CCC, October 20, 1997
Meeting M. Campbell and Joe Hoane by Han Schut, rgcc, October 21, 1997

1998

Deep Blue eval function tuning technique by Stuart Cracraft, CCC, January 08, 1998 » Automated Tuning
Deep Blue-Part I by Keith Ian Price, rgcc, May 1, 1998
Deep Blue-Part II by Keith Ian Price, rgcc, May 2, 1998
Deep Blue afterthoughts by Ingo Althöfer, CCC, May 09, 1998
Deep Blue-Part III by Keith Ian Price, rgcc, May 10, 1998
Deep Blue chip talk by David Fotland, CCC, August 19, 1998

2000 ...

DB NPS (anyone know the position used)? by Chris Carson, CCC, January 25, 2000 » Nodes per second
Wanted: Deep Blue vs. today's top programs recap by Mig Greengard, CCC, August 25, 2001
"Deep Blue ..." in 1995 by Ingo Althöfer, CCC, October 14, 2002
DeepBlue && SingularExtensions && !Nullmoving by Vladimir Medvedev, CCC, October 16, 2002 » Singular Extensions, Null Move Pruning
deep blue's automatic tuning of evaluation function by Emerson Tan, CCC, March 22, 2003 » Automated Tuning

2005 ...

Kasparov [HBR interview] : 'IBM committed a crime against science.' by José Antônio Fabiano Mendes, CCC, April 26, 2005 ^[8]
(Obvious troll) Kasparov vs DB-I was a disaster for human chess by Walter Faxon, CCC, May 06, 2005
Adjusting weights the Deep Blue way by Tony van Roon-Werten, Winboard Forum, August 29, 2008 » Automated Tuning

2010 ...

Performancerating of Kasparov and Deep Blue in their matches by Jens Bæk Nielsen, CCC, October 11, 2012
24 February 1993 - a disastrous day for Deep Blue by Jens Bæk Nielsen, CCC, February 24, 2013
4 hours video: B Larsen met Deep Blue in 1993 in Copenhagen by Jens Bæk Nielsen, CCC, June 01, 2014

2015 ...

New Pictures from Kasparov vs. Deep Blue by Steve Maughan, CCC, February 10, 2016 ^[9]
Hash Tables Deep Blue by Gustavo Mallada, CCC, May 18, 2017 » Transposition Table

External Links

IBM Research | Deep Blue | Overview
Deep Blue from The Computer History Museum
Deep Blue from Wikipedia
Games at chessgames.com
Deep Blue Prototype ICGA Tournaments
IBM research: The making of Deep Blue
IBM research: Home on the rematch
"Deep Blue" inspires deep thinking about artificial intelligence by computer scientist by Robert Irion, May 5, 1997 ^[10]
Modern Masters of an Ancient Game (pdf) by Carol McKenna Hamilton and Sara Hedberg AI Magazine Volume 18 Number 4 (1997) (© AAAI)
Searching for Deep Blue, BYTE July 1997 by Tom R. Halfhill
Chess, Deep Blue, Kasparov and Intelligence articles taken from the Archives of the New York Times
Von Kemplen's "The Turk" and IBM's "Deep Blue" Conspiracies of a Hidden Human by Garnet Hertz, November 9, 2005
The Week in Chess Magazine: Open Letter from Feng-hsiung Hsu
ChessBase: Behind Deep Blue A review by James E. DuBois
A Decade After Kasparov's Defeat, Deep Blue Coder Relives Victory Wired News Interview with Murray Campbell 05.11.07
Komodo 8: Deep Blue revisited (part one) by Albert Silver, ChessBase News, December 26, 2014 » Komodo, Kasparov versus Deep Blue 1997 ^[11]
Komodo 8: Deep Blue revisited (part two) by Albert Silver, ChessBase News, December 31, 2014
Komodo 8: Deep Blue revisited (part three) by Albert Silver, ChessBase News, January 09, 2015
20 years ago, a computer first beat a chess world champion - 1996-1997 The Kasparov-Deep Blue chess matches by Alex Q. Arbuckle, February 10, 2016
20 Years after Deep Blue: How AI Has Advanced Since Conquering Chess by Larry Greenemeier, Scientific American, June 2, 2017 ^[12] » Kasparov versus Deep Blue 1997, Murray Campbell

Videos

Chess computer Deep Blue and Bent Larsen in Copenhagen 1993 part 1, YouTube Videos ^[13]
Chess computer Deep Blue and Bent Larsen in Copenhagen 1993 part 2
Chess computer Deep Blue and Bent Larsen in Copenhagen 1993 part 3 (final)
IBM Research scientist Dr. Murray Campbell on Deep Blue, YouTube Video
Checkmate: Members of IBM’s Deep Blue Team Discuss the World of Computer Chess, June 1, 2013 » Computer Chess - A Movie, Murray Campbell
Deep Purple - Highway Star, Machine Head (1972), YouTube Video

References

^ Deep blue chip, International Business Machines (IBM), 1997, Gift of Feng-hsiung Hsu, The Computer History Museum
^ Deep Thought (Chess) (ICGA Tournaments)
^ The core Deep Blue team from The Computer History Museum, Courtesy of IBM Archives
^ "Deep Blue" inspires deep thinking about artificial intelligence by computer scientist by Robert Irion, May 5, 1997
^ Hans Berliner (1998). Review of Monty Newborn: Kasparov versus Deep Blue. pdf
^ Re: ICCA Journal Sinks To A New Low by Amir Ban, CCC, January 25, 1998
^ Monroe Newborn (1997). Kasparov versus Deep Blue: Computer Chess Comes of Age. Springer
^ Strategic Intensity - A Conversation with World Chess Champion Garry Kasparov by Diane L. Coutu, Harvard Business Review, April 2005
^ 20 years ago, a computer first beat a chess world champion - 1996-1997 The Kasparov-Deep Blue chess matches by Alex Q. Arbuckle, February 10, 2016
^ Robert Levinson, Jeff Wilkinson (1997). Deep Blue is Still an Infant. AAAI Technical Report WS-97-04
^ Komodo 8: Deep Blue revisited (1/2) by Graham Banks, CCC, December 27, 2014
^ Scientific American article on Computer Chess by Mark Lefler, CCC, June 03, 2017
^ 4 hours video: B Larsen met Deep Blue in 1993 in Copenhagen by Jens Bæk Nielsen, CCC, June 01, 2014

What links here?

Page	Date Edited
ABDADA	Aug 30, 2017
ACM	May 7, 2017
ACM North American Computer Chess Championship	Jun 13, 2015
Albert Silver	Feb 25, 2018
Alex Bernstein	Jan 2, 2016
Artificial Intelligence	Apr 9, 2018
Automated Tuning	Feb 27, 2018
Belle	Jan 18, 2018
Bob Herschberg	Dec 13, 2016
Brutus	Dec 24, 2016
CGW 2007	Jan 2, 2017
ChipTest	Jun 19, 2016
Dan Heisman	Jun 12, 2013
David Bronstein	Oct 28, 2014
Deep Blue	Aug 1, 2017
Deep Thought	Dec 5, 2016
Diogo R. Ferreira	Sep 4, 2016
Edward Fredkin	Oct 27, 2013
Engines	Mar 10, 2018
Eval Tuning in Deep Thought	Jun 7, 2016
Feng-hsiung Hsu	Dec 27, 2016
Ferret	Jan 7, 2016
FPGA	Jul 9, 2016
Frederic Friedel	Jan 6, 2018
Frenchess	Jan 7, 2016
Fritz	Feb 26, 2018
Gerald Tesauro	Dec 13, 2016
Hardware	Jan 20, 2018
Hiarcs	Feb 25, 2018
History	Jan 2, 2018
Jack van Rijswijck	Dec 22, 2016
Jens Bæk Nielsen	Mar 3, 2015
Joe Hoane	Jan 7, 2016
Jonathan Baxter	Feb 11, 2018
Jonathan Schaeffer	Jan 29, 2018
Jos Uiterwijk	Aug 11, 2017
José Antônio Fabiano Mendes	Feb 25, 2014
Kaissa	Apr 9, 2018
Kasparov versus Deep Blue 1996	Mar 26, 2017
Kasparov versus Deep Blue 1997	Aug 1, 2017
Kasparov versus Deep Thought 1989	Mar 26, 2017
Knowledge	Jul 22, 2017
Komodo	Mar 6, 2018
L. Stephen Coles	Jan 5, 2017
Mathematician	Apr 9, 2018
Michael Valvo	Feb 26, 2018
Michel Gondran	Jan 7, 2016
Mig Greengard	Feb 26, 2017
Milos Tatarevic	Feb 28, 2018
Morph	Dec 7, 2017
Murray Campbell	Jun 2, 2017
Nodes per second	Feb 28, 2018
Omar Syed	Sep 8, 2017
Paul Hsieh	Aug 14, 2015
Peter Gillgasch	May 15, 2016
Playing Strength	Mar 31, 2018
Point Value by Regression Analysis	Aug 26, 2017
PowerPC	Oct 6, 2017
Robert Hyatt	Dec 25, 2017
Scientific American	Jun 5, 2017
SCP	Jun 16, 2016
Stuart Cracraft	May 19, 2017
The Bernstein Chess Program	Jan 2, 2016
Tony van Roon-Werten	Jan 14, 2017
Transposition Table	Apr 19, 2018
Walter Faxon	Mar 6, 2015
Warlord	Apr 15, 2014
WCCC 1995	Jul 12, 2017
Xiphos	Apr 22, 2018
Zappa	Oct 24, 2017

Up one Level

Wikispaces : chessprogramming - items matching description

Astro 64

Table of Contents

The Match

See also

Publications

External Links

References

What links here?

Atlas

Table of Contents

Move Generation

Master

Namesake

See also

Publications

External Links

Chess Program

Misc

References

What links here?

Awit

Table of Contents

Quotes

Achievements

Photos & Games

BS6676

Ostrich

Phoenix

See also

Source Code

Publications

Forum Posts

External Links

Chess Program

Misc

References

What links here?

Beal

Table of Contents

Games

Ostrich

A16chs

External Links

References

What links here?

Black Knight

Table of Contents

Tigran Petrosian

Namesake

See also

Publications

External Links

Chess Program

Misc

References

What links here?

Blitz

Table of Contents

Description

See also

Publications

External Links

Chess Program

Misc

References

What links here?

CCCP (US)

Table of Contents

Selected Games

The Computer Was a Fish

Namesake

See also

Publications

External Links

References

What links here?

Charly

Table of Contents

Description