Wikispaces : chessprogramming - items matching description

AICE

GerdIsenberg — Wed, 29 Nov 2017 09:40:18 GMT

Home * Engines * AICE

		AICE, a free Chess Engine Communication Protocol and UCI compliant chess engine, written by Anastasios Milikas in C++ using the Standard Template Library, with Windows and Linux binaries available ^[1]. AICE is an Arena partner engine ^[2], and able to play Chess960, participated at the two open Livingston Chess960 Computer World Championships, the Chess960CWC 2005 and the Chess960CWC 2006.
AICE Logo ^[3]

Etymology

AICE stands for Artificially Intelligent Chess Engine, as explained by Anastasios, who also remarked "This is probably not a good name, since the engine is not intelligent! But I am working on it…” ^[4]. Anastasios initial intention with AICE was to use neural networks and genetic algorithms in order to optimize its evaluation weights, but he found that this was not productive and suitable for a chess evaluation function. They might be useful in time management, or controlling extentions or reductions ^[5].

Features

AICE is a bitboard based PV searcher with adaptive null move pruning in none PV-Nodes, using SEE, history- and killer heuristic to improve move ordering, and fractional extensions and non recursive reductions based on evaluation and history. In version 0.73, fail-high reductions were implemented in addition to null move pruning, but removed in in 0.97. Beside the transposition table and a smaller hash table for the quiescence search, AICE maintains a pawn hash table to cache once calculated pawn structure related data.

Forum Posts

AICE 0.85 by milix, Winboard Forum, December 21, 2004
AICE 0.86 by milix, Winboard Forum, December 30, 2004
Cycle VI-2005 6. Bundesliga result and games - AICE ! by Karl-Heinz Söntges, CCC, July 24, 2005
Aice 0.96 Linux: confused by a draw offer by Volker Pittlik, Winboard Forum, August 10, 2006
AICE 0.99.2 by milix, Winboard Forum, August 25, 2006

External Links

Chess Engine

milix AICE chess engine for both UCI and Winboard
Interview with the programmer of AICE by Alexander Schmidt and Frank Quisinsky, Arena Chess GUI 3.0 - Archive 8, 118, April 27, 2005
Portrait of Anastasios Mikilas, author of the Chess960 engine AICE by Mark Vogelgesang, July 21, 2005
Arena Chess GUI 3.0 - Aice
Aice 0.99.2 in CCRL 40/40
Aice 0.99.2 in CCRL 40/4 FRC

Misc

References

^ milix AICE chess engine for both UCI and Winboard
^ Arena Chess GUI 3.0 - Aice
^ milix AICE chess engine for both UCI and Winboard
^ Portrait of Anastasios Mikilas, author of the Chess960 engine AICE by Mark Vogelgesang, July 21, 2005
^ Interview with the programmer of AICE by Alexander Schmidt and Frank Quisinsky, Arena Chess GUI 3.0 - Archive 8, 118, April 27, 2005

What links here?

Page	Date Edited
AICE	Nov 29, 2017
Anastasios Milikas	Nov 29, 2017
Arena	Mar 16, 2018
Chess960CWC 2005	Jan 1, 2016
Chess960CWC 2006	Sep 25, 2014
Eigenmann Endgame Test	Jun 1, 2017
Engines	Mar 10, 2018
iCE	Jan 4, 2016

Up one Level

Bionic

GerdIsenberg — Mon, 27 May 2013 09:18:51 GMT

Home * Engines * Bionic

Bionic, (Believe it or not it's checkmate)
a chess program written in Basic by Hans Secelle during the early 90s. Bionic participated at four Dutch Open Computer Chess Championships, 1994, 1995, 1996 and 1997, and three Aegon Tournaments, 1995, 1996 and 1997. While Bionic was a slow searcher, it was an attempt of a knowledgeable program.

Bionic Impakt

Bionic's C-successor Bionic Impakt, which played the DOCCC 1998, was based on Crafty ^[1] with evaluation functions such as piece squares, attack heuristics, root-evaluation, as well as the opening book and time controls incorporated from Bionic ^[2].

External Links

References

^ Re: Chess programming by Gian-Carlo Pascutto, rgcc, June 18, 2002
^ Bionic vs Crafty, once again by Đorđe Vidanović, CCC, January 23, 1999

What links here?

Page	Date Edited
Aegon 1995	Apr 6, 2017
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Bionic	May 27, 2013
Bionic Impakt	Sep 6, 2014
DOCCC 1994	Aug 15, 2015
DOCCC 1995	Jun 7, 2016
DOCCC 1996	Jun 7, 2016
DOCCC 1997	Aug 15, 2015
Engines	Mar 10, 2018
Hans Secelle	Nov 2, 2012
Hector	Nov 11, 2016

Up one level

Bs6676

GerdIsenberg — Thu, 21 Jul 2016 18:33:54 GMT

Home * Engines * Bs6676

		Bs'66'76, a chess program by Barend Swets, developed between 1966 and 1976, written in Fortran ^[1]. It was the first Dutch chess program ^[2] and subject of a thesis supervised by Adriaan de Groot as a knowledge based attempt to simulate a human chessplayer. It had therfor to determine a lot of positional pattern and properties, considering open lines, weak squares, pawn structure, king safety etc., and searched about 150 positions in three minutes.
Schaakbulletin 150 ^[3]

Tournament Play

Bs'66'76 played the ECCC 1976 ^[4], the WCCC 1977, the ACM 1978 and ACM 1979, the unofficial Dutch championship matches in 1979, where it won 2-0 from IGM, and a single game in 1980, also versus IGM, which ended in a draw (see below) ^[5] and the First Dutch Computer Chess Championship in 1981.

Photos & Games

The second unofficial Dutch CC Championship 1980 at the "Open Days" of the Academic Computer Center Utrecht (ACCU) of Utrecht University, a match between Bs'66'76 running on a CDC Cyber 176 (ACCU) and IGM by Peter van Diepen running on a UNIVAC 418 III from Hoogovens ^[6].

Barend Swets in front and Peter van Diepen operating IGM on phone ^[7]

[Event "Dutch CC 1980"]
[Site "Utrecht, NL"]
[Date "1980.??.??"]
[Round "1"]
[White "Bs'66'76"]
[Black "IGM"]
[Result "1/2-1/2"]
 
1.d4 Nf6 2.e4 Nxe4 3.Bf4 Nc6 4.f3 Nf6 5.Bb5 Nb4 6.Ba4 c6 7.c3 Nbd5 8.Be5 Ne3 
9.Qe2 Nfd5 10.Na3 d6 11.Bg3 Bd7 12.Bb3 e6 13.Nh3 Be7 14.Bf4 Bh4+ 15.g3 Nxf4 
16.Nxf4 Nf5 17.Rd1 Nxg3 18.hxg3 Bxg3+ 19.Kf1 Bxf4 20.Kf2 O-O 21.Qe4 Bh6 
22.Rdg1 d5 23.Qe2 Qf6 24.Ba4 Qf4 25.Rg4 Qf6 26.Bb3 Bf4 27.Bc2 h6 28.Qd3 Rfb8 
29.Qh7+ Kf8 30.Qd3 Ke7 31.Qe2 Bd6 32.Rgg1 c5 33.Qd3 c4 34.Qe3 Rf8 35.Ke2 Rad8 
36.Rh5 g5 37.Kf2 Rde8 38.Rg4 Rd8 39.Nxc4 dxc4 40.d5 Rc8 41.Kf1 e5 42.Re4 Rfe8 
43.Kg2 b6 44.Rh1 Red8 45.Rh5 Re8 46.Rh1 Rf8 47.Rh2 Rfe8 48.Rh1 1/2-1/2

Publications

Barend Swets (1977). Computers in de opmars. Schakend Nederland 09-1977 (Dutch), pdf hosted by Hein Veldhuis » WCCC 1977
Max Pam (1980). "Na verloop van tijd ga je weleens denken, dat er een mens in zit" - Barend Swets over het programmeren van menselijk denken, Schaakbulletin nr. 150, mei 1980, hosted by Schaakcomputers en computerschaak - Diversen by Luuk Hofman (Dutch)

External Links

References

^ Peter Jennings (1978). The Second World Computer Chess Championships - Where KAISSA Founders on a Bug and CHESS 4.6 Conquers All. BYTE, Vol. 3, No. 1, Table 2
^ Eerste Nederlands Kampioenschappen Computerschaken - BS'66'76, het eerste schaakprogramma (Dutch)
^ Max Pam (1980). "Na verloop van tijd ga je weleens denken, dat er een mens in zit" - Barend Swets over het programmeren van menselijk denken, Schaakbulletin nr. 150, mei 1980, hosted by Schaakcomputers en computerschaak - Diversen by Luuk Hofman (Dutch)
^ Prehistorie van het Nederlandse Computerschaak (Dutch)
^ Dutch Computer Chess Championships - Complete History of Rankings and Games by Theo van der Storm
^ Prehistorie van het Nederlandse Computerschaak (Dutch) - Computer Chess Match for the 2nd Unofficial Dutch CC Championship 1980
^ Image and game from Max Pam (1980). "Na verloop van tijd ga je weleens denken, dat er een mens in zit" - Barend Swets over het programmeren van menselijk denken, Schaakbulletin nr. 150, mei 1980, hosted by Schaakcomputers en computerschaak - Diversen by Luuk Hofman (Dutch)

What links here?

Page	Date Edited
ACM 1978	Dec 23, 2017
ACM 1979	Apr 3, 2017
Awit	Dec 22, 2017
Barend Swets	Jan 7, 2016
Bs6676	Jul 21, 2016
DOCCC 1981	Nov 14, 2015
ECCC 1976	Sep 6, 2017
ECCC 1979	Sep 9, 2017
Elsa	Sep 6, 2017
Engines	Mar 10, 2018
IBM 370	Jan 20, 2018
IGM	Jul 21, 2016
Jerusalem CC Tournament 1978	Jan 3, 2018
WCCC 1977	Dec 22, 2017

Up one Level

CAPS

GerdIsenberg — Sat, 23 Dec 2017 10:58:14 GMT

Home * Engines * CAPS

		CAPS, (Chess as Problem Solving, CAPS-II) Hans Berliner's experimental chess program which was subject of his 1974 Ph.D. thesis Chess as Problem Solving: The Development of a Tactics Analyser at Carnegie Mellon University ^[1], further eloborated at the Advances in Computer Chess 1 conference ^[2], and, along with B, in a Panel on Computer Game Playing ^[3]. CAPS is a selective, knowledge driven depth-first alpha-beta searcher in the domain of chess tactics. A position is represented as vector of 1040 words of information, including the list of generated pseudo-legal moves, kept on a stack of up to 20 ply. CAPS-II* was tested on many middle-game chess tactics problems from standard textbooks on chess. It played a few complete games of chess. In both these modes it ran with a maximum depth of 10 ply. CAPS-II did not do too well in the games, since it had little positional knowledge, and more importantly the tactics mechanisms were still not completed, causing it to make occasional blunders which would wipe out whatever good it had achieved earlier. However, it did quite well on the tactics problems such as Reinfeld's Win at Chess ^[4].
Spherical Cap ^[5]

Refutation Description

Refutation Description

While visiting a node, CAPS determines attack information, and whether pieces are completely or partial en prise or overprotected, are pinned, or may be source of a discovered attack, and further collects a so called Refutation Description of expandable sets (bitboards and piece-sets) of moving and captured pieces, their source- and target squares, and appropriate paths of sliding pieces involved, associated with the full qualified moves (piece, from, to, captured piece if any) along the current search line. The description of the six sets of the Refutation Description is given from the Advances in Computer Chess 1 paper ^[6]:

RPCS - is a bit-vector which has bits representing names of pieces.
The name bit of the piece that moved to produce this node is set in this vector.
RSQS - is a bit-vector with bits representing squares on the board.
The bit corresponding to the destination square of the move that produced this node is set in RSQS.
RPATH - is a bit-vector with bits representing squares on the board.
The bit for any square across which a sliding piece moved in making the made move is set in RPATH. If the move was a non-capture pawn move, then all squares over which it passed including the destination also have bits set for them.
RTGTS - is a bit-vector with bits representing names of targets.
A comparison is made of BEST for this node with BEST one ply previously. Any squares which are now named as containing material targets, but were not mentioned in the previous BEST, have bits set for the name of the piece on this square to indicate that this threat was created by the last move.
TGTSQS - is a bit-vector with bits representing squares on the board.
For any RTGTS detected as above, bits are set in TGTSQS for the corresponding squares.
TPATH - is a bit-vector with bits representing squares on the board.
For any TGTSQS detected as above, if a piece that has an ATTACKING function on this square is a sliding piece, then all the intervening squares have bits set for them in TPATH.

Causality Facility

While classical depth-first searchers may perform the killer heuristic, or may analyze the backed-up principal variation for refutations, i.e. to move or defend any captured piece, or capture or pin any capturer, or block the path of any moving piece, CAPS' refutation description allows for much more complete understanding of a set of consequences, not only restricted to the PV. The Causality Facility interprets the refutation descriptions and tries to determine tactical causes and goals to control a set of move generators for possible goal transitions, and allows pruning of large sub-trees. The facility may further execute a null move to determine whether a suspected move was responsible for a bad position or not.

Method of Analogies

Once a move was determined as in fact bad, it is possible to posit a Lemma along with its environment of the refutation description — this being knowledge that a certain move will be bad as long as the described environment does not change. With this knowledge, any proposed move may be looked up in the Lemma file and if it has been previously cataloged, the program may determine if the current position contains any essential changes from the Lemma environment which might make the move succeed. It is important to note that should it be decided to try the move, and should it again fail, that it would now be possible to generalize the Lemma to include the union of the two environments, thus making it stronger. In a somewhat similar way, it is possible to generalize about the movements of a single piece, if more than one Lemma exists with respect to its moves. Lemmas are also posited about winning moves. Whenever a move is suggested at some future point in the search, the lemma file is first examined to determine if a lemma exists about this move and if the partial board description matches. If so, the result of the move is assumed known and the search can be foregone. A similar system has been described by Georgy Adelson-Velsky, Vladimir Arlazarov and Mikhail Donskoy ^[7] ^[8].

Quotes

Hans Berliner on CAPS-II in his Oral History, March 2005 ^[9]:

And here we are in 1970 and the Northwestern people have just made a big splash and everybody realized that they were very, very good and that they were not the kind to rest on their laurels, they kept finding things to improve. Now I was at Carnegie-Mellon where I had been admitted at the age of 40, not because of any academic credentials but because I knew how to do chess and I’d already written a computer program and they had hopes that I could push this state of the art doing computer chess, which I tried to do. But my program was not in the style of these modern programs, it was a program based on conceptual things and it was a very - a lot of effort was devoted to structure; in other words every position had a lot of structure and there were programs that delineated the structure ... There was one thing in this dissertation that I’m proud of and that was something that I called ‘the causality facility’ and - this is a dead end though I have to say that ahead of time, it was a dead end but it was a nice one - and the idea was that when, lets say, a human being makes a certain move and then a rook comes down to the back rank and says ‘checkmate’ the human being says ‘oh I gotta do something about that, I can’t make a move over here and he’s gonna give me checkmate.’ And I was once having a conversation with Minsky and he said you know ‘how do humans do this and why don’t machines do this?’ So I started thinking about that and when I did my dissertation I had descriptions - as I said I had a lot of structure - and I dragged descriptions back as one backed up from some terminal node and you backed the value not only do you back the value up, you’re backing up a description and the description said which pieces moved where and - and some other information. So in other words at some point you would arrive at the point where you say ‘oh, this last move must have been a mistake because I got checkmated’ and then you look at this description and see what the opponent did and say ‘oh probably I will lose again the same way unless I do something about that description’ which meant you either had to capture the piece that’s doing the moving or you had to block it or guard the square on which it landed or something like that. And that’s what my program was able to do, and it did so me very nice clever things where something was being threatened and it figured out the only way to block it without trying everything, by just reasoning about what the characteristics of a move would have to be in order to prevent this, so it was doing - it was good Ph.D. work but it didn’t fit into the main scheme <laughing>. Well I think as a knowledge exercise it was good.

Publications

Hans Berliner (1973). Some Necessary Conditions for a Master Chess Program. 3. IJCAI 1973
Hans Berliner (1974). Chess as Problem Solving: The Development of a Tactics Analyser. Ph.D. thesis, Carnegie Mellon University
Hans Berliner (1977). A Representation and Some Mechanisms for a Problem-Solving Chess Program. Advances in Computer Chess 1
Hans Berliner, Richard Greenblatt, Jacques Pitrat, Arthur Samuel, David Slate (1977). Panel on Computer Game Playing. 975-982 5. IJCAI 1977, pdf
Editor (1979). Chess Ratings from Problem Solving. Personal Computing, Vol. 3, No. 12, pp. 77 » Chess Problems, Compositions and Studies

Forum Posts

Re: Method of Analogies?? by Steven J. Edwards, CCC, May 29, 1998
Re: Symbolic: Status Report 2007.04.25 by Steven Edwards, CCC, April 26, 2007 » Symbolic

External Links

Caps

Cap

References

^ Hans Berliner (1974). Chess as Problem Solving: The Development of a Tactics Analyser. Ph.D. thesis, Carnegie Mellon University
^ Hans Berliner (1977). A Representation and Some Mechanisms for a Problem-Solving Chess Program. Advances in Computer Chess 1
^ Hans Berliner, Richard Greenblatt, Jacques Pitrat, Arthur Samuel, David Slate (1977). Panel on Computer Game Playing. 975-982 5. IJCAI 1977, pdf
^ Hans Berliner (1977). A Representation and Some Mechanisms for a Problem-Solving Chess Program. Advances in Computer Chess 1
^ An example of a spherical cap by Pbroks13, October 2008, Spherical cap from Wikipedia
^ Hans Berliner (1977). A Representation and Some Mechanisms for a Problem-Solving Chess Program. Advances in Computer Chess 1
^ Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (1975). Some Methods of Controlling the Tree Search in Chess Programs. Artificial Intelligence, Vol. 6, No. 4, pp. 361-371. ISSN 0004-3702. Reprinted (1988) in Computer Chess Compendium pp. 129-135
^ Method of Analogies?? by Bruce Cleaver, CCC, May 29, 1998
^ Oral History of Hans Berliner, Interviewed by: Gardner Hendrie, Recorded: March 7, 2005, The Computer History Museum, pdf, pp. 25.

What links here?

Page	Date Edited
Advances in Computer Chess 1	Oct 22, 2015
CAPS	Dec 23, 2017
Carnegie Mellon University	Feb 12, 2018
Chess Problems, Compositions and Studies	Feb 19, 2018
Engines	Mar 10, 2018
Hans Berliner	Jun 10, 2017
Herbert Simon	Feb 11, 2016
Paradise	Nov 19, 2014
Personal Computing	Dec 27, 2017
Playing Strength	Mar 31, 2018
Tactics	Jan 12, 2018
Test-Positions	Feb 25, 2018
William Chase	Jan 21, 2016

Up one Level

CCCP

GerdIsenberg — Thu, 10 Jan 2013 10:05:55 GMT

Home * Engines * CCCP

CCCP (Comparatively Complex Chess Program) - a closed source chess engine written by Pawel Koziol, based on TSCP. Some ideas used in evaluation function of the CPW-engine are derived from it. There is also a version of CCCP playing a knightmate chess variant.

Namesake

CCCP the Columbia Computer Chess Program

External Links

CCCP homepage

What links here?

Page	Date Edited
CCCP	Jan 10, 2013
CCCP (US)	Dec 22, 2017
Engines	Mar 10, 2018
Pawel Koziol	Dec 17, 2017
TSCP	Feb 5, 2016

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

CHAOS

GerdIsenberg — Thu, 28 Dec 2017 08:49:00 GMT

Home * Engines * CHAOS

		CHAOS was one of the leading programs since it first appeared at ACM 1973 until the mid 80s. CHAOS, which stands facetiously for Chess Heuristics And Other Stuff, has participated in twelve ACM tournaments ^[1] and four world championships ^[2] , runner up in 1974 behind Kaissa, defeating favorite Chess 4.0. In 1980 at the 3rd WCCC, CHAOS was close to becoming champion but lost the playoff against Belle. Its last tournament was the 16th AMC 1985 when it lost two games in a very strong field.
Boldriaan - CHAOS (2006) ^[3]

Duel on the Chessboard

History

CHAOS started in the late 1960s at RCA Systems Programming division in Cinnaminson, NJ with Ira Ruben, Fred Swartz, Victor Berman, Joe Winograd, and William Toikka as first authors. In January 1972, Sperry Univac (1986 Unisys) officially took over the RCA Computer Systems Division and eventually moved everything to Blue Bell, Pennsylvania. Later the program has been affiliated with the Computing Center of the University of Michigan where most of its programmers were staff members ^[4] .

Knowledge vs Search

CHAOS was written in Fortran and required in excess of 3,000,000 words of memory to execute, using most of it for storing the tree. It examines only about 50 nodes/sec (1985 70 nodes/sec ^[5] ) or about 10,000 per move. The reason why CHAOS evaluated so slowly — their programmers did a better job of evaluation! Because every minimax decision is made based on a single evaluation, it seemed plausible that the more accurate this number is, the better the quality of tree searching. However, that comes at the cost of missing deep combinations from brute force search, but CHAOS's strength/nodes-evaluated ratio was impressive. The program carried out a selective search with iterative widening, a bit different from the others. Its book contains about 10,000 lines.

Quotes

Alex Bell

Alex Bell on the CHAOS - Chess 4.0 game 1974 ^[6] :

CHAOS played 16 NxP!! - a move which has been acclaimed as the finest ever made by a computer. White evaluates that his domination of open lines is compensation for a piece. This judgement is absolutely correct. Of course the piece is not sacrificed entirely and play continues in a very similar fashion to MASTER's sacrifice of a bishop to TELL.

rq2k2r/3n1ppp/p2bpnb1/8/Np1N4/1B3PP1/PP2Q2P/R1BR2K1 w kq - 1 16

Duel on the Chessboard

Quote from Computer vs. computer: Duel on the Chessboard ^[7] on ACM 1979:

The biggest and most powerful computers do that very well. In one second, they can examine thousands of possible moves. The problem is, they stop to consider lousy moves that a human player wouldn't waste a fraction of a second on. On the other side of the fence are the slower but "smarter" computer programs. They can't think about zillions of chess moves, so they need a lot of information about chess plugged into them. CHAOS is one of these latter, pumped with chess information from John J. O’Keefe, one of Michigan's top players.

Authors

1973 ^[8]	1976 ^[9]	1978 ^[10]	1983 ^[11]
	Mike Alexander	Mike Alexander	Mike Alexander
Victor Berman	Victor Berman	Victor Berman	Victor Berman
			Mark Hersey
		Tom McBride
			Jack O’Keefe
Ira Ruben	Ira Ruben
Fred Swartz	Fred Swartz	Fred Swartz	Fred Swartz
William Toikka	William Toikka	William Toikka
Joe Winograd	Joe Winograd	Joe Winograd

Photos & Games

CHAOS Team

CHAOS Team circa 1972 with UNIVAC 1108 Computer in Cinnaminson, NJ
From left, Fred Swartz (rear), Vic Berman (front), Bill Toikka, Ira Ruben (seated), Joe Winograd ^[12]

WCCC 1974

Slate, Swartz, and Berman in CHAOS vs Chess 4.0, WCCC 1974 ^[13] ^[14]

[Event "WCCC 1974"]
[Site "Stockholm, Sweden"]
[Date "1974.08.06"]
[Round "2"]
[White "Chaos"]
[Black "Chess 4.0"]
[Result "1-0"]
 
1.d4 d5 2.c4 dxc4 3.Nf3 Nf6 4.e3 e6 5.Bxc4 c5 6.Qe2 a6 7.O-O b5 8.Bb3 Bb7
9.Rd1 Nbd7 10.Nc3 Bd6 11.e4 cxd4 12.Nxd4 Qb8 13.g3 b4 14.Na4 Bxe4 15.f3 Bg6
16.Nxe6 fxe6 17.Qxe6+ Be7 18.Re1 Qd8 19.Bf4 Kf8 20.Rad1 Ra7 21.Rc1 Ng8 22.Rcd1
a5 23.Bd6 Bxd6 24.Qxd6+ Ne7 25.Nc5 Bf5 26.g4 Qe8 27.Ba4 b3 28.gxf5 bxa2 29.Bxd7
a1=Q 30.Rxa1 Ra6 31.Nxa6 Qd8 32.Kf2 Kf7 33.Qe6+ Kf8 34.Qxe7+ Qxe7 35.Rxe7 Kxe7
36.Nc5 Rb8 37.Rxa5 Rxb2+ 38.Kg3 g6 39.fxg6 hxg6 40.Ra6 Rc2 41.Re6+ Kf8 42.Re5 Rc1
43.Rg5 Kf7 44.Be6+ Kf6 45.h4 Rxc5 46.Rxc5 Kxe6 47.Rg5 Kf6 48.Kg4 Kf7 49.Rc5 Ke6
50.Kg5 Kd6 51.Ra5 Kc6 52.f4 Kb6 53.Ra1 Kc5 54.Rd1 Kb4 55.Kxg6 Kc3 56.Rd8 Kb4
57.Rc8 Kb5 58.h5 Kb6 59.Rc1 Kb5 60.h6 Ka4 61.Rb1 Ka3 62.f5 Ka2 63.Rb8 Ka3 64.f6
Ka4 65.Rb7 Ka5 66.Rb8 Ka4 67.Rb1 Ka3 68.Rb7 Ka4 69.Rb8 Ka5 70.Kg7 Ka4 71.Rb7 Ka5
72.Rb2 Ka4 73.Rb8 Ka5 74.Kg8 Ka4 75.h7 Ka5 76.h8=Q Ka4 77.Qh4+ Ka5 78.Qb4+ Ka6
79.Qa4# 1-0

WCCC 1980

Belle vs CHAOS, WCCC 1980, Thompson, Friedel, Berman ^[15] , Swartz, Donskoy ^[16] ^[17]

[Event "WCCC 1980"]
[Site "Linz, Austria"]
[Date "1980.09.29"]
[Round "5 (playoff)"]
[White "Belle"]
[Black "Chaos"]
[Result "1-0"]
 
1.e4 Nf6 2.e5 Nd5 3.d4 d6 4.Nf3 dxe5 5.Nxe5 g6 6.g3 Bf5 7.c4 Nb4 8.Qa4+ N4c6
9.d5 Bc2 10.Qb5 Qd6 11.Nxc6 Nxc6 12.Nc3 Bg7 13.Qxb7 O-O 14.Qxc6 Qb4 15.Kd2 Be4
16.Rg1 Rfb8 17.Bh3 Bh6+ 18.f4 Qa5 19.Re1 f5 20.Qe6+ Kf8 21.b3 Bg7 22.Bb2 Bd4
23.g4 Rb6 24.Qd7 Rd6 25.Qa4 Qb6 26.Ba3 Bxc3+ 27.Kxc3 Rdd8 28.Rad1 Qf2 29.gxf5
Qc2+ 30.Kd4 gxf5 31.Qc6 Qf2+ 32.Ke5 Kg8 33.Rg1+ Kh8 34.Bxe7 Qb2+ 35.Rd4 Qg2
36.Qf6+ Kg8 37.Bxg2 Rxd5+ 38.Ke6 h6 39.Qxh6 Re5+ 40.fxe5 Rf8 41.Bf3# 1-0

Forum Posts

Old programs CHAOS and USC by Eugene Piercy, CCC, July 11, 2015

External Links

Chess Program

Misc

Chaos in a Miniature by Edward Winter
Chaos (cosmogony) from Wikipedia
Chaos theory from Wikipedia
Sun Ra - Cosmic Chaos, from The Heliocentric Worlds of Sun Ra, Vol. 2 (1965), YouTube Video

References

^ North American Computer-Chess Championships, complete History of Tournament Results and Games, prepared by Theo van der Storm, Nov. 23rd, 2002, secretary of the CSVN
^ Chaos' ICGA Tournaments
^ Schaakkunst van Boldriaan
^ The Eleventh ACM's North American Computer Chess Championship as pdf reprint from The Computer History Museum
^ David .E. Welsh (1986). ACM's Sixteenth North American Computer Chess Championship. ICCA Journal, Vol. 8, No. 4.
^ Alex Bell (1978). MASTER at IFIPS. from Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL), excerpt from A. G. Bell (1978). The Machine Plays Chess. Pergamon Press, ISBN-13: 978-0080212227, from amazon
^ Computer vs. computer: Duel on the Chessboard, Boca Raton News - November 27. 1979 from Google News on ACM 1979
^ Monroe Newborn (1975). Computer Chess. Academic Press, New York, N.Y. Chapter IX. The Fourth United States Computer Chess Championship » ACM 1973
^ pp. 52, Table I. History of the ACM Tournaments from
Ben Mittman, Monroe Newborn (1980). Computer chess at ACM 79: the tournament and the man vs. man and machine match. Communications of the ACM, Vol. 23, Issue 1, pdf from The Computer History Museum » ACM 1976
^ David Levy (1978). ACM '78. ICCA Newsletter, Vol. 1, No. 1 » ACM 1978
^ Chaos' ICGA Tournaments
^ Photo courtesy Joe Winograd
^ Photo by Monroe Newborn from The Computer History Museum
^ Stockholm 1974 - Chess - Round 2 - Game 6 (ICGA Tournaments)
^ Militärischer Wert Der Spiegel 24/1982, pdf (German)
^ Photo by Monroe Newborn from The Computer History Museum
^ Linz 1980 - Chess - Round 5 - Game 1 (ICGA Tournaments)

What links here?

Page	Date Edited
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 1980	Dec 25, 2017
ACM 1981	Jan 19, 2018
ACM 1982	Jul 19, 2016
ACM 1984	Jul 19, 2016
ACM 1985	Jun 21, 2017
AMDAHL 470	Jul 19, 2016
Awit	Dec 22, 2017
Belle	Jan 18, 2018
Carey Bloodworth	Jul 19, 2016
CHAOS	Dec 28, 2017
Ches	Jan 3, 2018
Chess (Program)	Dec 22, 2017
Dart	Jan 19, 2018
David Cahlander	Dec 22, 2017
David Levy	Jan 3, 2017
Duchess	Dec 22, 2017
Engines	Mar 10, 2018
Evaluation Overlap	Jul 19, 2016
Fred Swartz	Jul 19, 2016
Frederic Friedel	Jan 6, 2018
Freedom	Dec 28, 2017
Ira Ruben	Jul 19, 2016
Jack O’Keefe	Jul 19, 2016
Jerusalem CC Tournament 1978	Jan 3, 2018
Joe Winograd	Jul 19, 2016
Mark Hersey	Jul 19, 2016
Mike Alexander	Jul 19, 2016
Nuchess	Apr 3, 2017
Shy	Jul 19, 2016
SPOC	Jun 21, 2017
Tom Truscott	Dec 22, 2017
Type B Strategy	Jul 19, 2016
UNIVAC 1100	Jul 21, 2016
University of Michigan	Jul 19, 2016
Victor Berman	Jul 19, 2016
WCCC 1974	Jan 19, 2018
WCCC 1977	Dec 22, 2017
WCCC 1980	Dec 25, 2017
WCCC 1983	Jan 20, 2018
William Toikka	Aug 12, 2016

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

Chump

GerdIsenberg — Sun, 31 Jan 2016 21:28:08 GMT

Structure of CHUMP

Eye Movements

Discrimination and Familiarization

Home * Engines * CHUMP

CHUMP, (CHUnking of Moves and Patterns)
was an experimental chess program by Fernand Gobet and Peter Jansen that learned to recognize piece patterns and associated move sequences, introduced at the Advances in Computer Chess 7 conference in 1993. The aim was to model human 'computational' mechanisms, not only to understand better those machanisms in human beings, but to yield techniques and algorithms that could lead to valuable additions to competitive game playing programs, for instance in improving move ordering and in learning search control aka selectivity of classical alpha-beta searchers ^[1].

CHUMP is based on CHREST (Chunk Hierarchy and REtrieval STructures), a computer model of human chess memory and perception ^[2]. CHREST was inspired by earlier programs MAPP ^[3] and Perceiver ^[4] by Herbert Simon and colleages. CHREST was not conceived as a component of a game playing program - its knowledge was limited to pattern of chess positions and had no concept of moves, goals and values. In learning about moves and when to make them, CHUMP was the first step towards a game playing, pattern learning chess program. In 1997, Fernand Gobet developed a second simulation of move-selection called SEARCH, which begins to incorporate search processes ^[5].

Structure of CHUMP

CHUMP consists of the following components:

Eye movement simulator module
EPAM like discrimination nets, one for piece patterns, one for move sequences
Short-term memory (STM)
Retrieval structure

Eye Movements

The eye movement simulator is the only part of the system where the rules of the game influence the learning process. It scans the board, and directs its attention to pieces and squares it expects, given the current node in its discrimination net, attack, defense and proximity relations between pieces. It is hoped, that this leads to the formation of meaningful chunks.

Discrimination and Familiarization

The discrimination nets are based o the EPAM model of memory and perception, with some differences in the way uses recursion in encoding chunks and in the nature of the discrimination data structure - EPAM uses a tree, CHUMP a graph. Each node in the net contains the image of the object that lead to its creation, and a list of descendants. There are two different types of learning, depending on whether is new or not. If an objcet is new, that is does not match the image of the chunk found in the discrimination net, a new branch is created - dubbed discrimination. Otherwise, CHUMP extends the image - called familiarization.

Short-term Memory

Short-term memory (STM) is a n-pointer structure (n ≡ 7 for human simulations), in which each pointer refers to a single piece pattern recognized in the position. In CHUMP, to obtain faster learning, an STM size of n = 20 was applied.

Retrieval Structure

The retrieval structure is an intermediate memory structure that, in humans, allows a rapid access to long-term memory. In CHUMP. the retrieval structure consists of an internal board representation - a representation augmented with information about lines, diagonals and directions of movement of the pieces - and the hypothesis - the most information-rich pattern recognized so far, linking for instance to relevant plans.

Learning

CHUMP builds its discrimination nets for pieces and moves based on the patterns it recognizes when scanning the set of training positions. For each position three learning steps take place.

The eye movement recognizes piece pattern, which are discriminated or familiarized inside the piece patterns net.
The move actually played is learned inside its move sequence discrimination net.
The current move (sequence) is associated with those piece patterns that contain the moving piece on its correct from square; a link is created between the piece pattern and the move entry in the move sequence discrimination net. If this move has already been associated with the same pattern earlier, its activation (a counter that keeps track of how often a particular move has been associated with a given pattern) is increased.

Move Proposal

After (or during) learning, CHUMP can use its discrimination nets to suggests moves in certain positions. Again, three steps were applied.

The eye movement simulator iterates over all relevant piece patterns.
The moves associated with every piece pattern are retrieved from the net, along with the number of chunks associating it and its activation.
The move with the greatest number of chunks is prefered, if equal, the move with higher activation is considered best

Experiments

CHUMP's proposed moves were compared with actual moves in several different learning and testing situations, e.g. games by Mikhail Tal and positions from the KQKR domain. The experiments show that CHUMP improves performance with learning in all cases.

Publications

Fernand Gobet, Peter Jansen (1994). Towards a Chess Program Based on a Model of Human Memory. Advances in Computer Chess 7
Roy W. Roring III (2008). Reviewing Expert Chess Performance: A Production-Based Theory of Chess Skill. Ph.D. thesis, advisor Neil Charness, Florida State University
Andrew Cook (2008). Chunk Learning and Move Prompting: Making Moves in Chess. Technical Report CSR-08-12, University of Birmingham

External Links

Chess Program

CHREST projects - CHUMP

Misc

chump Wiktionary
Chump from Wikipedia
Laurel and Hardy - A Chump at Oxford (1940), YouTube Video

References

^ This article incorporates text from Fernand Gobet, Peter Jansen (1994). Towards a Chess Program Based on a Model of Human Memory. Advances in Computer Chess 7
^ Fernand Gobet (1993). A Computer Model of Chess Memory. Proceedings of the 15th Annual Meeting of the Cognitive Science Society
^ Herbert Simon, Kevin J. Gilmartin (1973). A Simulation of Memory for Chess Positions. Cognitive Psychology, Vol. 5, pp. 29-46, reprinted in Herbert Simon (1979). Models of Thought. Yale University Press
^ Herbert Simon, Michael Barenfeld (1968). Information Processing in the Perception of Chess Positions. Carnegie Mellon University, Paper #127
^ Fernand Gobet (1997). A Pattern-Recognition Theory of Search in Expert Problem Solving. Thinking and Reasoning, Vol. 3, No. 4

What links here?

Page	Date Edited
CHREST	May 6, 2016
Chump	Jan 31, 2016
Chunking	Jun 12, 2017
Cognition	Dec 8, 2017
Engines	Mar 10, 2018
EPAM	Jul 15, 2017
Eye Movements	Jul 22, 2015
Fernand Gobet	May 11, 2017
Learning	Feb 20, 2018
MAPP	Jan 30, 2016
Pattern Recognition	Sep 8, 2017
Peter Jansen	Jan 31, 2016
Peter Lane	Jan 1, 2016
William Chase	Jan 21, 2016

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

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

Doch

GerdIsenberg — Tue, 23 May 2017 13:06:56 GMT

Home * Engines * Doch

Doch,
an UCI compliant chess engine by primary author Don Dailey, supported by chess advisor and evaluation expert and Don's long time collaborator Larry Kaufman. The development started in 2007 ^[1], and it was first released to the public as free engine in fall 2009 ^[2].

Komodo

In January 2010, Doch evolved to Komodo ^[3] to become one of the strongest programs ever.

Etymology

Doch is acronym of Don's Chess. Quote from a Frank Quisinsky interview, December 2009 ^[4]:

Doch was never intended to be the name that would stick. When I first decided to write this program I needed a name and did not want to spend days obsessing over it. I did not want to call it "chess" but it needed a name to give it some personality. Doch stands for DOn's CHess. I never got around to giving it a proper name and I feel a bit immodest calling it after my own name!

Copy-Make

Doch was a 64-bit aka bitboard program, applying a Copy-Make approach with a position state of 192 byte allocated on the stack ^[5] ^[6]

position search( position_state *prev,  ...  )
{
   position_state  new_position;
   ... other stuff
   foreach move in movelist do {
       make( prev, &new_position, move );
   }
}

Forum Posts

Doch 09.980 (uci) by Don Dailey available by Jim Ablett, CCC, November 13, 2009
Doch 1.2 update (uci) by Don Dailey available by Jim Ablett, CCC, December 15, 2009
Doch 1.3.1 by Don Dailey, CCC, January 05, 2010
A New Name for Doch.... by Fernando Villegas, CCC, January 07, 2010

External Links

References

^ About Komodo by Larry Kaufman
^ Doch 09.980 (uci) by Don Dailey available by Jim Ablett, CCC, November 13, 2009
^ Komodo credit by Don Dailey, CCC, January 22, 2010
^ Computerschach, Interview with Don Dailey by Frank Quisinsky, Schachwelt.de, December 18-20, 2009
^ Re: undo move vs. Position Cloning by Don Dailey, CCC, September 16, 2009
^ Re: undo move vs. Position Cloning by Don Dailey, CCC, September 16, 2009

What links here?

Page	Date Edited
Achilles	Dec 31, 2015
Copy-Make	May 23, 2017
Doch	May 23, 2017
Don Dailey	Dec 7, 2016
Engines	Mar 10, 2018
Fernando Villegas	Aug 15, 2016
Harun Taner	May 17, 2015
Incremental Updates	Sep 6, 2017
Komodo	Mar 6, 2018
Larry Kaufman	Jan 28, 2018
Millipawns	Jun 19, 2017
Occam	Jan 21, 2016

Up one Level

Dutch

GerdIsenberg — Thu, 07 Jan 2016 15:17:18 GMT

Home * Engines * Dutch

Dutch,
the Delft University of Technology Chess Program developed by Sito Dekker, Harry Nefkens, Roger Hünen, Jaap van den Herik and Tom Pronk ^[1]. Like its forerunner Pion, Dutch was written in C. It participated at the WCCC 1986 in Cologne with 3 out of 5 ^[2], and further played the DOCCC 1986 and DOCCC 1987.

Selected Games

WCCC 1986, round 5, Dutch - Ostrich ^[3]

[Event "WCCC 1986"]
[Site "Cologne, Germany"]
[Date "1986.06.15"]
[Round "5"]
[White "Dutch"]
[Black "Ostrich"]
[Result "1-0"]
 
1.Nf3 d5 2.g3 Nf6 3.Bg2 Bg4 4.c4 Nbd7 5.cxd5 Nxd5 6.d4 Bxf3 7.Bxf3 e6 
8.O-O Bd6 9.e4 N5b6 10.e5 Bb4 11.Bxb7 Rb8 12.Bg2 O-O 13.Qb3 Be7 14.Rd1 
c5 15.dxc5 Bxc5 16.Nc3 Qc7 17.Nb5 Qxe5 18.Bf4 Qf5 19.Bxb8 Bxf2+ 20.Kh1 
Rxb8 21.Nxa7 Nd5 22.Nb5 Nc5 23.Qa3 Ne3 24.Nd4 Qg4 25.Bf3 Qg5 26.Rdc1 Nd7 
27.Qd6 Rd8 28.Nc6 Nf5 29.Qd3 Nxg3+ 30.hxg3 Qxg3 31.Be4 Qxd3 32.Bxd3 Re8 
33.Kg2 Be3 34.Re1 Bf4 35.b4 g5 36.a4 g4 37.Rf1 e5 38.Rae1 Re6 39.b5 Nf6 
40.Bc4 Re8 41.b6 Kf8 42.Rd1 Nh5 43.b7 e4 44.Rd7 1-0

External Links

References

^ Zevende Nederlands Kampioenschap Computerschaak, Leiden 10, 11, 17 en 18 Oktober 1987.pdf hosted by Hein Veldhuis » DOCCC 1987
^ Jaap van Oosterwijk Bruyn (1986). Het wereldkampioenschap computerschaak 1986 te Keulen. Computerschaak, pagina 3 (Dutch)
^ Cologne 1986 - Chess - Round 5 - Game 5 (ICGA Tournaments)

What links here?

Page	Date Edited
Delft University of Technology	Feb 4, 2018
DOCCC 1986	Dec 9, 2016
DOCCC 1987	Dec 9, 2016
Dutch	Jan 7, 2016
Engines	Mar 10, 2018
Harry Nefkens	Dec 28, 2016
Jaap van den Herik	Sep 18, 2017
Pion	May 22, 2016
Roger Hünen	Apr 1, 2016
Sito Dekker	Apr 25, 2016
Tom Pronk	Jan 7, 2016
WCCC 1986	Jul 27, 2017

Up one level

ECE

GerdIsenberg — Tue, 22 Aug 2017 19:00:34 GMT

Home * Engines * ECE

ECE, (Easy Chess Engine)
an UCI compliant chess engine written by Luigino Viscione in C++, first released in February 2004 ^[1]. ECE played the 3rd Chess Computer Cup 2008 with 4/6.

Forum Posts

Ece 0.2.1 : 1953 by Patrick Buchmann, CCC, February 13, 2008

External Links

Chess Engine

Misc

ECE (disambiguation) from Wikipedia

References

^ ECE from WBEC Ridderkerk

What links here?

Page	Date Edited
CCC 2008	Jan 6, 2014
Dimitri	Aug 22, 2017
ECE	Aug 22, 2017
Engines	Mar 10, 2018
IGWT 2013	Jun 23, 2014
IGWT 2014	Feb 2, 2016
IGWT III	May 15, 2017
IGWT IV	May 17, 2017

Up one level

FCP

GerdIsenberg — Sat, 15 Jun 2013 08:19:59 GMT

Home * Engines * FCP

FCP, (Forth Chess Program)
a derivation of Tom Kerrigan's simple chess program TSCP 1.71 written by Ian Osgood as an exercise in learning the Forth programming language. At the time it was started, there were no other chess programs in Forth which used modern search techniques. FCP retains the values of small footprint (< 64K) and code clarity. Normally, FCP is used from the Forth command line. There are also drivers for working in XBoard and running EPD test suites.

Enhancements

Although FCP started with a nearly identical evaluation function as an aid to detecting bugs when porting from C to Forth, FCP diverged from TSCP in many ways ^[1]:

0x88 ^[2]
Piece lists
Track king positions for faster check detection
Procedural move generation with loop unrolling
Alpha-beta with aspiration windows
Using the open parameter stack allows only passing alpha to search and quiescence (the alpha from the ancestor node is -beta for this node)
Killer heuristic
Null move pruning
Check extensions
Incremental material and pawn evaluation
Opening Book

Future plans

Forum Posts

TSCP enhancements (Re: Short chess programs) by Ian Osgood, CCC, September 19, 2002

External Links

FCP home page
Forth application benchmark suite (ZIP) contains both FCP and another Forth chess program called Brainless by David Kühling ^[3]

References

^ TSCP enhancements (Re: Short chess programs) by Ian Osgood, CCC, September 19, 2002
^ 0x88 is not so smart by Christophe Théron, CCC, June 13, 2000
^ brainless | Free Games software downloads at SourceForge.net

What links here?

Page	Date Edited
Brainless (Forth)	Jun 24, 2017
Engines	Mar 10, 2018
FCP	Jun 15, 2013
Forth	Jun 15, 2013
Ian Osgood	Jun 14, 2013
Open Source Engines	Jul 14, 2015
TSCP	Feb 5, 2016

Up one Level

FUSCsharp

GerdIsenberg — Fri, 07 Jun 2013 19:30:48 GMT

Home * Engines * FUSc#

		FUSc#, an experimental research open source chess engine developed since 2002 by the AI-Game Programming Group ^[1] at the Free University of Berlin, headed by Raúl Rojas. As the name suggests, FUSc# was written in C#. It is compliant to the UCI protocol and able to play online ^[2]. An iterative alpha-beta matrix version gave a promising performance boost, bought by a huge degree of code complexity ^[3].
FUSc# Logo

TD-Leaf(λ)

The engine, then dubbed DarkFUSc#, was subject of research on Temporal Difference Learning using TD-Leaf(λ), as elaborated in Marco Block's thesis ^[4].

Board Representation

While FUSc# originally had an array-representation, a version dubbed Fusch# gained some performance using rotated bitboards ^[5].

Publications

Marco Block (2004). Verwendung von Temporale-Differenz-Methoden im Schachmotor FUSc#. Diplomarbeit, Betreuer: Raúl Rojas, Free University of Berlin, pdf (German)
Marco Block, André Rauschenbach, Johannes Buchner, Frank Jeschke, Raúl Rojas (2005). Das Schachprojekt FUSc#". Technical Report B-05-21, pdf, Free University of Berlin (German)
Johannes Buchner (2005). Rotated bitboards in FUSc#. Free University of Berlin, pdf
Johannes Buchner (2005). Theory and practical strategies for efficient alpha-beta-searches in computer chess. Bachelor thesis, Advisor: Raúl Rojas, Free University of Berlin, pdf

External Links

FUSc# - AG Schachprogrammierung

References

^ AI-Game Programming Group of Free University of Berlin
^ FUSc# - AG Schachprogrammierung
^ Marco Block, André Rauschenbach, Johannes Buchner, Frank Jeschke, Raúl Rojas (2005). Das Schachprojekt FUSc#". Technical Report B-05-21, pdf, Free University of Berlin (German)
^ Marco Block (2004). Verwendung von Temporale-Differenz-Methoden im Schachmotor FUSc#. Diplomarbeit, Betreuer: Prof. Dr. Raúl Rojas, Free University of Berlin, pdf (German)
^ Johannes Buchner (2005). Rotated bitboards in FUSc#. Free University of Berlin, pdf

What links here?

Page	Date Edited
Automated Tuning	Feb 27, 2018
Engines	Mar 10, 2018
Free University of Berlin	Jan 20, 2018
FUSCsharp	Jun 7, 2013
Johannes Buchner	May 26, 2013
Marco Block-Berlitz	May 26, 2013
Rotated Bitboards	Mar 7, 2017
Temporal Difference Learning	Feb 20, 2018

Up one Level

Greko

GerdIsenberg — Tue, 27 Feb 2018 14:03:58 GMT

Home * Engines * GreKo

		GreKo, a Chess Engine Communication Protocol compliant open source engine by Vladimir Medvedev, written in C++ and relying on the Standard Template Library. Starting the development in 2002 ^[1], GreKo was first a classical alpha-beta searcher within an iterative deepening framework, performing an evaluation considering material and various positional aspects such as pawn structure. Checks, recaptures and passers arriving the seventh rank were extended. The opening book utilizes the hash table to recognize transpositions. Over the time, GreKo experienced various changes, applying a 0x88 board with piece lists, a hybrid bitboard-0x88 approach, and in 2008, Magic bitboards. Search has become PVS, null move pruning with R=4, and a lot of new evaluation terms such as mobility and material imbalances were added, and position learning applied. Since version 5.0, GreKo further supports UCI ^[2]. In April 2011, GreKo was ported by Aart Bik for Android using the GUI of his Chess for Android application ^[3]. GreKo 2015 ML, released in July 2016 ^[4], features a command for learning from a PGN file. The algorithm is similar to Texel's Tuning Method, but using evaluation function instead of expensive quiescence search for making predictions of game results ^[5]. GreKo participated at the 1st Computer Chess Championship of CIS Countries, Moscow 2008.
GreKo for Android ^[6]

Etymology

The program's name is dedicated to the Italian historical chess master Gioachino Greco and is acronym of the Great Kombinator ^[7].

Forum Posts

2002...

GreKo chess engine by Vladimir R. Medvedev, rgcc, April 01, 2002

2005 ...

GreKo by Vladimir Medvedev, Winboard Forum, April 05, 2005
GreKo 5.3 : 2256 by Patrick Buchmann, CCC, May 22, 2007
GreKo 5.4 : 2278 by Patrick Buchmann, CCC, July 31, 2007
GreKo 5.5 : 2293 by Patrick Buchmann, CCC, January 02, 2008
GreKo 5.6 : 2282 by Patrick Buchmann, CCC, April 14, 2008
GreKo 5.7 : 2302 by Patrick Buchmann, CCC, May 20, 2008
GreKo 5.7.1 by Vladimir Medvedev, CCC, May 25, 2008
GreKo 5.9 : 2315 by Patrick Buchmann, CCC, August 03, 2008
GreKo 6.0 : 2292 by Patrick Buchmann, CCC, October 01, 2008
GreKo 6.25 : 2295 by Patrick Buchmann, CCC, December 22, 2008
GreKo 6.5 : 2299 by Patrick Buchmann, CCC, June 01, 2009

2010 ...

Test tournament starts: Gaviota, Daydreamer, Greko, Atak by Harun Taner, CCC, January 10, 2010 » Gaviota, Daydreamer, GreKo, Atak
GreKo for Android by Aart Bik, CCC, April 20, 2011
GreKo 9.8 by Vladimir Medvedev, Winboard Forum, December 31, 2012
GreKo 12.0 2002-2014 12 years development, Congrats! by José Mº Velasco, CCC, April 02, 2014
GreKo 12.1 by Vladimir Medvedev, Winboard Forum, October 07, 2014
GreKo 12.1 by Werner Schüle, CCC, October 09, 2014
GreKo 12.5 by Vladimir Medvedev, Winboard Forum, December 21, 2014
GreKo 12.5 by Graham Banks, CCC, December 22, 2014

2015 ...

New site for GreKo by Vladimir Medvedev, Winboard Forum, January 14, 2015
GreKo 12.6 by Vladimir Medvedev, Winboard Forum, April 25, 2015
GreKo 12.8 by Vladimir Medvedev, Winboard Forum, May 19, 2015
GreKo 12.9 by Vladimir Medvedev, Winboard Forum, August 02, 2015
Re: GreKo 12.9 - Updated to 13.0. by Vladimir Medvedev, Winboard Forum, October 01, 2015
GreKo 13.1 by Vladimir Medvedev, Winboard Forum, October 07, 2015
GreKo 2015 by Vladimir Medvedev, Winboard Forum, November 18, 2015
GreKo 2015 by Werner Schüle, CCC, November 22, 2015

2016

GreKo 2015 ML by Vladimir Medvedev, CCC, July 12, 2016
GreKo 2015 ML: tuning evaluation (article in Russian) by Vladimir Medvedev, CCC, July 22, 2016 » Texel's Tuning Method ^[8]
GreKo 2016 by Vladimir Medvedev, Winboard Forum, December 30, 2016
GreKo 2016 released! by Günther Simon, CCC, December 31, 2016

2018

GreKo 2017, fixed by Vladimir Medvedev, CCC, January 08, 2018
GreKo 2018.01 by Vladimir Medvedev, CCC, January 31, 2018
GreKo 2018.02 by Vladimir Medvedev, CCC, February 27, 2018

External Links

Шахматная программа GreKo ^[9]
Самообучение шахматной программы / Хабрахабр by Vladimir Medvedev, Habrahabr, July 21, 2016 (Russian) translated by Google Translate » Texel's Tuning Method
GreKo chess engine
GreKo - Browse Files at SourceForge.net
GreKo - Download ^[10]
Greko by Vladimir Medvedev, Russia from sdchess.ru (Russian)
Aart's Blog: GreKo Chess Engine, April 20, 2011
GreKo from WBEC Ridderkerk
GreKo 9.7 64-bit in CCRL 40/40

References

^ GreKo chess engine by Vladimir Medvedev, rgcc, April 01, 2002
^ Greko by Vladimir Medvedev, Russia from sdchess.ru (Russian)
^ GreKo for Android by Aart Bik, CCC, April 20, 2011
^ GreKo 2015 ML by Vladimir Medvedev, CCC, July 12, 2016
^ greko-2015-ml.zip/history.txt
^ Aart's Blog: GreKo Chess Engine, April 20, 2011
^ GreKo by Vladimir Medvedev, Winboard Forum, April 05, 2005
^ Самообучение шахматной программы / Хабрахабр by Vladimir Medvedev, Habrahabr, July 21, 2016 (Russian) translated by Google Translate
^ New site for GreKo by Vladimir Medvedev, Winboard Forum, January 14, 2015
^ does not only provide GreKo, but also a Kaissa PC port in Turbo C from 1992, and a listing of the ITEP Chess Program for the M-20 computer

What links here?

Page	Date Edited
Atak	Aug 9, 2016
Automated Tuning	Feb 27, 2018
CCCCISC 2008	Jan 19, 2014
DayDreamer	Aug 22, 2016
Donna	Aug 17, 2017
Eigenmann Endgame Test	Jun 1, 2017
Engine releases	Apr 23, 2018
Engines	Mar 10, 2018
Gaviota	Jan 21, 2018
Gavon	Apr 30, 2018
Greco	Feb 12, 2015
Greko	Feb 27, 2018
Harun Taner	May 17, 2015
Kaissa	Apr 9, 2018
Point Value by Regression Analysis	Aug 26, 2017
Texel's Tuning Method	Dec 2, 2017
Vladimir Medvedev	Jul 22, 2016

Up one Level

IGM

GerdIsenberg — Thu, 21 Jul 2016 18:48:33 GMT

Home * Engines * IGM

IGM, (Ik Ga Mat, I'm Going to be Mated)
a chess program by Peter van Diepen, which competed the Dutch Computer Chess Championships in 1981 and 1983, and the unofficial Dutch championship matches in 1979 and 1980, where IGM lost from Bs6676, and drew Barend Swets' program in 1980 to share the 'title' ^[1] .

1978

In 1978, IGM won the first games played between Dutch chess programs via telephone. IGM ran on a UNIVAC 418 III of Hoogovens. Schak123 ran on a self built system around the Signetics 2650 by the brothers Hans and Henk van der Liet in Amsterdam. Alder, the program by Peter Kouwenhoven, ran on a PDP-11/45 of the Leiden University ^[2]:

IGM - Schak123	1 - 0
Alder - IGM	0 - 1
IGM - Alder	1 - 0

[Event "First Dutch CC Game"]
[Site "Telephone NED"]
[Date "1978.06.23"]
[Round "01"]
[White "IGM"]
[Black "Schak-123"]
[Result "1-0"]
 
1.Nf3 { Van Diepen } e6 { Van der Liet } 2.Ng1 e5 3.d4 f6 4.dxe5 fxe5 5.e4 Nc6
6.Be3 Rb8 7.Bb5 Qe7 8.Bxc6 a6 9.Qh5+ Kd8 10.Bd5 Nf6 11.Qf5 d6 12.Qg5 Bd7
13.Ne2 Rc8 14.Bxb7 a5 15.Bxc8 Kxc8 16.Nd2 Rg8 17.O-O-O c6 18.Rde1 Be6
19.c4 Qf7 20.b3 Be7 21.Qg3 Rf8 22.c5 dxc5 23.Qxe5 Rg8 24.Bxc5 Rf8 25.Bxe7
Qxe7 26.Qxa5 Rg8 27.e5 Nh5 28.Rd1 Rf8 29.f3 Rg8 30.Rde1 Rf8 31.Rd1 Rg8
32.Kb2 Rf8 33.Rhe1 Rg8 34.Rc1 Rf8 35.Rxc6+ Kb8 36.Qb6+ 1-0

External Links

IGM (disambiguation) from Wikipedia

References

What links here?

Page	Date Edited
Alder	May 22, 2016
Bs6676	Jul 21, 2016
DOCCC 1981	Nov 14, 2015
DOCCC 1983	Nov 13, 2015
Engines	Mar 10, 2018
Gambiet	Jan 8, 2016
IGM	Jul 21, 2016
Microtrend	Dec 3, 2012
Peter Kouwenhoven	Jan 7, 2016
Peter van Diepen	Nov 5, 2015
Schak-H	Nov 9, 2015
Storm	Dec 9, 2016
UNIVAC 418	Jul 21, 2016
Wim Rens	Jul 21, 2016

Up one level

J. Biit

GerdIsenberg — Tue, 17 Jan 2017 16:33:56 GMT

Home * Engines * J. Biit

		J. Biit, Hans Berliner's first chess program, written in the late 60s in PL/I to ran on an IBM System/360 mainframe computer ^[1] . It played the First United States Computer Chess Championship 1970 in New York City, and won versus Wita, lost from Chess 3.0 and drew Coko III. Along with Daly CP, J. Biit was one of the first chess programs operated through a Graphical User Interface. The UI was written at Columbia University for the IBM 2250 Display Unit, and later evolved along with J. Biit to become the Columbia Computer Chess Program dubbed CCCP ^[2]. J. Biit is the acronym of "Just Because it is there", probably in dependance of the famous quote ^[3] by English mountaineer George Mallory, having replied to the question "Why do you want to climb Mount Everest?".
Just Because it is there ^[4]

Description

J. Biit was a selective search (Shannon type B) program ^[5] that places considerable emphasis on chess knowledge and restricting the number of positions to be examined, as it scored only 30-100 positions during a search using alpha-beta and incremental board updating. The program was developed in PL/I on the IBM 360/65 at CMU, but was unable to use that system for the 1970 ACM tournament. Since the 360 line was supposedly compatable, Kenneth M. King ^[6] offered the services of Columbia's more powerful IBM 360/91. Unfortunately they discovered that it wasn't as compatable as expected and Berliner and assistants spent two rather frantic weeks making program changes. It used about 200 Kibibyte of memory and was about 3500 PL/I statements. The program searches a very small tree. Berliner claimed that, on average, only 30 nodes were examined for a move that required 65 seconds of computation. It used a "free form of search which terminated in quiescent positions ... (with) the only bound being the absolute depth limit of 14 ply." It searched two plies for begining and middle games, and 4 plies for end games .

Quotes

Hans Berliner in his Oral History, March 2005 ^[7] :

And I wrote a program which actually played chess. And I did it in the way Greenblatt said it ought to be done ^[8] . It wasn’t anywhere’s near as good a Greenblatt’s program and I wasn’t really a very good programmer obviously, since that was the first time I had written a program...

So it played. Let’s see, I’ve got to get the timeline right here. Now this was in 1970. Now in 1970 I had already left IBM. I left IBM in 1969, and went to Carnegie Mellon as a doctoral student.

And, of course, their attraction with Newell and Simon was they would like to find somebody to push their ideas further forward, and that was me. And so I had this program which, in retrospect, was pretty woesome.

Publications

Hans Berliner (1970). Experiences Gained in Constructing and Testing a Chess Program. IEEE Symposium System Science and Cybernetics, reprinted in David Levy (ed.) (1988). Computer Games I.

External Links

Chess Program

Classic Computer Chess - ... The programs of yesteryear by Carey, hosted by the Internet Archive ^[9]

Misc

Michael Hedges - Because It's There ^[10], YouTube Video
July 1986 at the Wolf Trap National Park for the Performing Arts in Vienna, Virginia

References

^ George Atkinson (1998). Chess and Machine Intuition. (Intellect Ltd.) pp 61
^ Recollections of CUCC 1968-70 -The CCCP Chess Program
^ George Mallory - Because it is there - Wikiquote
^ Everest from Kala Patthar in Nepal, Mount Everest from Wikipedia
^ Description based on Classic Computer Chess - ... The programs of yesteryear by Carey, hosted by the Internet Archive
^ The IBM 7090
^ Oral History of Hans Berliner, Interviewed by: Gardner Hendrie, Recorded: March 7, 2005, The Computer History Museum, pdf, pp. 12-13
^ Richard Greenblatt, Donald Eastlake and Stephen D. Crocker (1967). The Greenblatt Chess Program. Proceedings of the AfiPs Fall Joint Computer Conference, Vol. 31, pp. 801-810.
^ Re: Old programs CHAOS and USC by Dann Corbit, CCC, July 11, 2015
^ Naomi Uemura from Wikipedia

What links here?

Page	Date Edited
ACM 1970	Jun 13, 2015
Andrew Koenig	Dec 22, 2017
Aron Eisenpress	Jul 8, 2012
Ben Yalow	Jan 21, 2013
Carnegie Mellon University	Feb 12, 2018
CCCP (US)	Dec 22, 2017
Daly CP	Jul 13, 2015
Engines	Mar 10, 2018
Hans Berliner	Jun 10, 2017
IBM 360	Jan 2, 2016
J. Biit	Jan 17, 2017
PL 1	Jan 20, 2016
Steven M. Bellovin	Dec 14, 2017

Up one Level

Lachex

GerdIsenberg — Thu, 07 Jan 2016 15:19:13 GMT

Home * Engines * Lachex

		Lachex, an Acronym for Los Alamos Chess Experiment, is the chess program developed by Burton Wendroff and Tony Warnock. Lachex was a mainframe program, playing on a Cray X-MP 48, and was written in Fortran and Assembly, performing some kind of full width parallel principal variation search inside an iterative deepening framework. Also, Lachex already implemented presumably none recursive null move pruning, as mentioned in the description from the WCCC 1989 booklet.
Los Alamos ^[1] Chess Experiment

Tournament Play

Lachex played two World Computer Chess Championships ^[2], the WCCC 1986 and WCCC 1992, and four ACM North American Computer Chess Championships, ACM 1985, ACM 1986, ACM 1987 and ACM 1991. It was runner up in 1986 only losing the eventual winner Belle.

Selected Games

WCCC 1986, round 1, Ostrich - Lachex ^[3]

[Event "WCCC 1986"]
[Site "Cologne, Germany"]
[Date "1986.06.11"]
[Round "1"]
[White "Ostrich"]
[Black "Lachex"]
[Result "0-1"]
 
1.e4 e5 2.Nf3 Nc6 3.Bb5 a6 4.Bxc6 dxc6 5.d4 exd4 6.Qxd4 Qxd4 7.Nxd4 Nf6 8.O-O 
Bc5 9.c3 O-O 10.f3 Bd6 11.Bg5 c5 12.Bxf6 gxf6 13.Ne2 Be6 14.Nd2 Rfd8 15.Rfd1 Kh8 
16.a4 b5 17.axb5 axb5 18.Rxa8 Rxa8 19.g3 f5 20.Kf2 Ra2 21.Rb1 Bd7 22.Ke3 Ra8 
23.Re1 Kg8 24.f4 Re8 25.Kd3 fxe4+ 26.Nxe4 Bf5 27.Nc1 Bf8 28.b3 c4+ 29.bxc4 bxc4+ 
30.Kxc4 Bxe4 31.Rd1 c6 32.Rd2 Bd5+ 33.Kd3 Bc5 34.Re2 Rb8 35.c4 Be6 36.Kc3 Bb4+ 
37.Kc2 Bxc4 38.Re5 f6 39.Rf5 Rd8 40.Rxf6 Rd2+ 41.Kb1 Bc3 0-1

Description

from the WCCC 1989 booklet ^[4]:

Lachex is specifically designed for the architecture of the Cray XMP and YMP series of machines. The highly repetitive parts of the program are written in assembly language, the rest in Fortran. Low level parallelism is achieved by extensive use of vector functional units and pipelining. High level parallelism is obtained by means of multiple independent processors splitting up the search using a self-scheduling algorithm and communicating with each other through a large common memory.

The search is basically alpha-beta with iterative deepening. In the initial depth one search each root move is actually scored and the list of moves ordered accordantly. Best moves at subsequent iterations are moved to the top of the list. Scouting is used at ply one only - the first move in the list is scored and the remaining moves are tested with minimal window. Forward pruning is done with a positional estimator at nodes below the horizon and with the null move algorithm above. Moves out of check above the horizon extend the search depth for that path by one, but by two if the check is discovered or double. Selective searches below the horizon include captures, promotions, castling, and some checking moves.

Lachex spends 1/3 of its time generating moves, 1/3 doing bookkeeping, and 1/3 evaluating leaf nodes. The evaluation function is symmetric wherever possible. Mobility, pawn structure, king safety, piece placement and other features make up the evaluation function. Some strategy is incorporated at the root by shifting the minimal window to bias certain types of moves. There is a transposition table which can be a big as 32 million positions, on a 64 million word machine.

Board Representation

Lachex used following piece enumeration scheme from the initial position, which does not change during the cause of the game: the a1-rook was labeled with 1, b1-knight with 2, a2-pawn with 9, the a8-rook with 17 and the h7-pawn with 32. Beside a bitboard board-definition using 12 piece bitboards and occupancy as union set, Lachex used a redundant 8x8 board array, containing those 1..32 piece-codes, but zero for empty squares, and piece-arrays containing squares and associated piece-types or zero if the piece is missing. A so called INC-Array indexed by origin, target square and piece type (excluding color, but white and black pawn as distinct types) was used in direct move generation, similar as described in In Between and Attacked by Piece on Square.

Further, something which reminds on fill algorithms like Dumb7Fill was used as described by Wendroff ^[5] :

There are several methods for generating the moves of the long range pieces. The method we have had the most success with on Cray machines preceding the X-MP/48 finds the to-squares closest to the home square, and then by a complicated sequence of shifts and boolean operations simultaneously continues these moves in the appropriate directions.

BCH Hashing

To index and lock search tables, especially the transposition table, Lachex utilized signatures of chess positions by BCH Hashing based on BCH-Code as used in Error detection and correction, otherwise incrementally updated similar than signatures from Zobrist Hashing. Lachex used a BCH signature length of 81 (or more) bits to protect 16 bits from the full position string of 749 (64*12 - 2*2*8 + 4 + 8 + 1) bits, which is sufficient to avoid collisions within an 8 ply search. In their paper on Search Tables ^[6] , Warnock and Wendroff further elaborate on alpha-beta inconsistencies, and that with the introduction of search tables, depending on the implementation, alpha-beta may not be order-independent. They refer implementations given by Tony Marsland ^[7] and Harry Nelson ^[8].

Publications

Burton Wendroff (1985). Attack Detection and Move Generation on the X-MP/48. ICCA Journal, Vol. 8, No. 2
Tony Warnock, Burton Wendroff (1988). Search Tables in Computer Chess. ICCA Journal, Vol. 11, No. 1

External Links

References

^ Los Alamos National Laboratory from Wikipedia
^ Lachex's ICGA Tournaments
^ Cologne 1986 - Chess - Round 1 - Game 3 (ICGA Tournaments)
^ Kings Move - Welcome to the 1989 AGT World Computer Chess Championship. Edmonton, Alberta, Canada, Courtesy of Peter Jennings, from The Computer History Museum, pdf
^ Burton Wendroff (1985). Attack Detection and Move Generation on the X-MP/48. ICCA Journal, Vol. 8, No. 2
^ Tony Warnock, Burton Wendroff (1988). Search Tables in Computer Chess. ICCA Journal, Vol. 11, No. 1
^ Tony Marsland (1986). A Review of Game-Tree Pruning. ICCA Journal, Vol. 9, No. 1
^ Harry Nelson (1985). Hash Tables in Cray Blitz. ICCA Journal, Vol. 8, No. 1

What links here?

Page	Date Edited
ACM 1985	Jun 21, 2017
ACM 1986	Dec 5, 2017
ACM 1987	Dec 5, 2017
ACM 1991	Nov 25, 2017
BCH Hashing	May 8, 2017
Bebe	Dec 23, 2017
Burton Wendroff	Nov 21, 2017
Cray X-MP	Jul 26, 2017
Delicate Brute	Jun 7, 2016
Engines	Mar 10, 2018
Lachex	Jan 7, 2016
Los Alamos National Laboratory	Sep 16, 2015
Mathematician	Apr 9, 2018
Netherlands-vs-Computers-1989	Mar 10, 2017
Persistent Hash Table	Dec 31, 2017
Pieces	Feb 19, 2018
Promotions	Jun 6, 2017
Singular Extensions	Jan 9, 2018
Tony Warnock	Jan 7, 2016
Vaxchess	Jan 7, 2016
WCCC 1986	Jul 27, 2017
WCCC 1992	Feb 26, 2018
Young Brothers Wait Concept	Apr 22, 2018

Up one level

Wikispaces : chessprogramming - items matching description

AICE

Table of Contents

Etymology

Features

See also

Forum Posts

External Links

Chess Engine

Misc

References

What links here?

Bionic

Table of Contents

Bionic Impakt

See also

External Links

References

What links here?

Bs6676

Table of Contents

Tournament Play

Photos & Games

Publications

External Links

References

What links here?

CAPS

Table of Contents

Refutation Description

Causality Facility

Method of Analogies

Quotes

See also

Publications

Forum Posts

External Links

Caps

Cap

References

What links here?

CCCP

Table of Contents

Namesake

See also

External Links

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?

CHAOS

Table of Contents

History

Knowledge vs Search

Quotes

Alex Bell

Duel on the Chessboard

Authors

Photos & Games

CHAOS Team

WCCC 1974

WCCC 1980

See also

Forum Posts

External Links

Chess Program

Misc

References

What links here?

Charly

Table of Contents

Description

ETH-MIT Match