Wikispaces : chessprogramming - items matching description

18th Computer Olympiad

GerdIsenberg — Mon, 05 Feb 2018 11:04:29 GMT

Home * Tournaments * Computer Olympiad * 18th Computer Olympiad 2015
< Prev Next >

		18th Computer Olympiad 2015, from June 29, to July 05, 2015, Snellius Building ^[1] ^[2], Leiden University, Leiden, The Netherlands, in conjunction with the WCCC 2015, the WCSC 2015, and the Advances in Computer Games 14 conference ^[3] . The prize giving took place on July 01 and 02 after the official reception and excursion in Museum Boerhaave ^[4] ^[5] in central Leiden, and in the playing rooms of the Snellius Building on the other days. Additional medals for all prize winners were created by Ingo Althöfer with Lego bricks, his socks and his washing machine ^[6] .
Snellius Building ^[7]

EinStein würfelt nicht!

Results

Amazons

< Prev Next > ^[8]

#	Program	CC	Authors	P	Medal
1.	Invader	US	Richard J. Lorentz et al.	6	Gold
2.	8QP	NL	Johan de Koning	4	Silver
3.	Unstoppable	CN	Junyao Zhao et al.	1	Bronze
4.	X+			1

CC Country Codes

| ||

TD Jaap van den Herik, Vance (?), Richard J. Lorentz, ^[9] Johan de Koning ^[10]

Backgammon

< Prev Next > ^[11]

#	Program	CC	Authors	P	Playoff	Medal
1.	Palamedes	GR	Nikolaos Papahristou	3	2	Gold
2.	GNU Backgammon	NL++	Nardy Pillards et al.	3	1	Silver
3.	BGBlitz	DE	Frank Berger	3	0	Bronze

CC Country Codes

Frank Berger, Nikolaos Papahristou, and Nardy Pillards ^[12]

#	Program	CC	Authors	P	Medal
1.	Shiga	TW	Ming-Cheng Cheng, Shi-Jim Yen	10	Gold
2.	Chimo	TW	Wen-Jie Tseng, Bo-Han Lin, Ching-Hua Kuo, Chien-Yu Chen, I-Chen Wu, Jr-Chang Chen, Shun-Chin Hsu	7½	Silver
3.	Shark	TW	Shun-Shii Lin	4½	Bronze
4.	XieXie	FR	Pascal Tang, Eugenio Castillo, Jih Tung Pai	4
	HaQiKi D	NL	Harm Geert Muller	4
6.	SjaakII	NL	Evert Glebbeek	0

Chinese Dark Chess

< Prev Next > ^[15] ^[16]

#	Program	CC	Authors	P12	Medal
1.	DarkKnight	TW	Chu-Hsuan Hsueh, Wen-Jie Tseng, I-Chen Wu	11	Gold
2.	Yahari	TW	Jr-Chang Chen, You-Cheng Syu, Gang-Yu Fan, Ting-Yu Lin, Tsan-Sheng Hsu	9½	Silver
3.	Observer	TW	Ta-Kai Hsu, Shun-Shii Lin	8	Bronze
4.	TuxedoCat	TW	Terry Lao, Chih-Hung Chen, Shun-Shii Lin	6½
5.	Darkness	TW	Kai-Hsiang Chan, Shun-Shii Lin	4
6.	Rainbow	TW	Gang-Yu Fan, Jr-Chang Chen	2½
7.	Homer	FR	Nicolas Jouandeau	½

CC Country Codes

Ta-Kai Hsu (Observer), Chu-Hsuan Hsueh (DarkKnight), and Ting-Yu Lin (Yahari). ^[17]

Clobber

< Prev Next > ^[18]

#	Program	CC	Authors	Medal
1.	PAN	NL	Johan de Koning	Gold
2.	Deep Nikita	US	Andrew Lin	Silver

CC Country Codes

Andrew Lin, Johan de Koning, and TD Jaap van den Herik ^[19]

Draughts

< Prev Next > ^[20] ^[21]

#	Program	CC	Authors	P	Medal
1.	Scan	FR	Fabien Letouzey	18	Gold
2.	Damage	CH	Bert Tuyt	16	Silver
3.	JDraughts	DE	Ron Van Bemmelen	16	Bronze
4.	Sjende Blyn	NL	Jelle Wiersma	15
5.	Dragon Draughts	NL	Michel Grimminck	14
6.	Moby Dam	NL	Harm Jetten	14
7.	TD King	CH	Ton Tillemans	12
8.	Tornado	NL	Frank Mesander	10
9.	Deep Nikita	US	Andrew Lin	7
10.	GWD	NL	Klaas Bor, Gijsbert Wiesenekker	6
11.	Cerberus	NL	Leo Nagels	3
12.	Slagzet.com	NL	Maurits Meijer	1

CC Country Codes

Winners: Bert Tuyt, Fabien Letouzey, Ron Van Bemmelen, and TD Jaap Bus ^[22]

EinStein würfelt nicht!

< Prev Next > ^[23]

#	Program	CC	Authors	Score	Medal
1.	Hanfried	DE	Ingo Althöfer, Jörg Sameith, Stefan Schwarz	+3-0	Gold
2.	Deep Nikita	US	Andrew Lin	+2-1	Silver
3.	Chinese Program	CN	Junyao Zhao	+1-2	Bronze
4.	E-MC2	JP	Yasumasa Tamura	+0-3

CC Country Codes

Junyao Zhao (?), Gold medal for EWN inventor Ingo Althöfer, and Andrew Lin ^[24]

#	Program	CC	Authors	P7	Playoff	Medal
1.	Zen	JP	Yoji Ojima, Hideki Kato	7		Gold
2.	Abakus	DE	Tobias Graf	5	1	Silver
3.	Nomitan	JP	Simon Viennot, Kokolo Ikeda, Junichi Hashimoto et al.	5	0	Bronze
4.	CGI	TW	I-Chen Wu	4
5.	MC_ark	JP	Nobuo Araki	3
6.	Jimmy	TW	Chou Cheng-Wei, Shi-Jim Yen, Shun-Chin Hsu	2
7.	Oakfoam	ZA	Detlef Schmicker, Francois van Niekerk	2

#	Program	CC	Authors	P5	Medal
1.	Zen	JP	Yoji Ojima, Hideki Kato	5	Gold
2.	Nomitan	JP	Simon Viennot, Kokolo Ikeda, Junichi Hashimoto et al.	4	Silver
3.	Abakus	DE	Tobias Graf	3	Bronze
4.	CGI	TW	I-Chen Wu	2
5.	MC_ark	JP	Nobuo Araki	1
6.	Wingo	TW	Hsin-Hung Chou	0

#	Program	CC	Authors	P10	Medal
1.	Zen	JP	Yoji Ojima, Hideki Kato	9.5	Gold
2.	Abakus	DE	Tobias Graf	7.5	Silver
3.	CGI	TW	I-Chen Wu	7.0	Bronze
4.	Nomitan	JP	Simon Viennot, Kokolo Ikeda, Junichi Hashimoto et al.	4.0
5.	MC_ark	JP	Nobuo Araki	2.0
6.	Wingo	TW	Hsin-Hung Chou	0.0

#	Program	CC	Authors	P	Medal
1.	MoHex	CA	Philip Henderson, Broderick Arneson, Ryan Hayward	7	Gold
2.	DeepHex	PL	Jakub Pawlewicz	5	Silver
3.	Ezo	JP	Kei Takada	0	Bronze

#	Program	CC	Authors	P	Playoff	Medal
1.	MoHex	CA	Philip Henderson, Broderick Arneson, Ryan Hayward	6	2	Gold
2.	DeepHex	PL	Jakub Pawlewicz	6	0	Silver
3.	Ezo	JP	Kei Takada	0		Bronze

#	Program	CC	Authors	P	Medal
1.	MC-LOA	NL	Mark Winands	6/6	Gold
2.	Deep Nikita	US	Andrew Lin	4/6	Silver
3.	Lucky Line	CN	Junyao Zhao	0/8	Bronze

#	Program	CC	Authors	P	Medal
1.	Shokidoki	NL	Harm Geert Muller	4	Gold
2.	SjaakII	NL	Evert Glebbeek	0	Silver

#	Program	CC	Authors	P	Medal
1.	Shokidoki	NL	Harm Geert Muller	4	Gold
2.	SjaakII	NL	Evert Glebbeek	2	Silver
3.	EVG	TW	Jr-Chang Chen, Shun-Chin Hsu	0	Bronze

#	Program	CC	Authors	P	Medal
1.	Shokidoki	NL	Harm Geert Muller	4	Gold
2.	SjaakII	NL	Evert Glebbeek	0	Silver

Booklet

The 21st World Computer Chess Championship - The 18th Computer Olympiad (pdf)

Reports

Jaap van den Herik, Walter Kosters, Aske Plaat, Johanna Hellemons (2015). The 18th Computer Olympiad 2015. ICGA Journal, Vol. 38, No. 4
Jaap Bus (2015). SCAN wins Draughts Tournament. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad
Ingo Althöfer (2015). HANFRIED wins EinStein Würfelt Nicht! Tournament. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad
Harm Geert Muller (2015). SHOKIDOKI wins MiniShogi Tournament. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad
Kun-Hao Yeh (2015). 2048-KHYEH wins 2048 Tournament. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad
Chu-Hsuan Hsueh, I-Chen Wu (2015). DARKKNIGHT wins Chinese Dark Chess Tournament. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad
Pascal Tang (2015). SHIGA wins Chinese Chess Tournament. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad
Ryan Hayward, Jakub Pawlewicz, Kei Takada, Tony van der Valk (2017). MOHEX Wins 2015 Hex 11x11 and Hex 13x13 Tournaments. ICGA Journal, Vol. 39, No. 1 » 18th Computer Olympiad

Forum Posts

Computer Olympiad 2015 Leiden by Bert Tuyt, World Draughts Forum, May 01, 2015
Fotos Computer-Olympiade Leiden 2015 by Ingo Althöfer, DGoB-Diskussionsforum, June 29, 2015 (German)
New Shokidoki release by Harm Geert Muller, CCC, July 26, 2015 » 18th Computer Olympiad 2015 - Shogi

External Links

References

^ Snellius Building
^ Willebrord Snellius (1580 - 1626)
^ 14th International Conference Advances in Computer Games 2015 | July 2015
^ Herman Boerhaave (1668 - 1738)
^ Circus Boerhaave, Leiden, Music: Tom Waits - In the Colosseum, 1992, YouTube Video
An exhibition of automata by the Cabaret Mechanical Theatre at the Museum Boerhaave, Leiden, April 29 to September 04, 2011
^ Art Emiele - Old Lego Bricks in Washing Machine Bricks by Ingo Althöfer, June 18 and 29, and July 05, 2013
^ Photo Snellius Building by Gerd Isenberg, July 03, 2015
^ Results | ICGA | Amazons
^ Deep Nikita author Andrew Lin takes an afternoon nap
^ Photo at Museum Boerhaave by Gerd Isenberg, July 01, 2015
^ Results | ICGA | Backgammon
^ 18th Computer Olympiad - Day 6 Photos by Jan Krabbenbos
^ Results | ICGA | Chinese Chess
^ Pascal Tang (2015). SHIGA wins Chinese Chess Tournament. ICGA Journal, Vol. 38, No. 4
^ Results | ICGA | Chinese Dark Chess
^ Chu-Hsuan Hsueh, I-Chen Wu (2015). DARKKNIGHT wins Chinese Dark Chess Tournament. ICGA Journal, Vol. 38, No. 4
^ 18th Computer Olympiad - Day 4 Photos by Jan Krabbenbos
^ Results | ICGA | Clobber
^ 18th Computer Olympiad - Day 4 Photos by Jan Krabbenbos
^ Harm Jetten's draughts program - Performance
^ Computer Olympiad 2015 Leiden by Bert Tuyt, World Draughts Forum, May 01, 2015
^ 18th Computer Olympiad - Day 7 Photos by Jan Krabbenbos
^ Results | ICGA | EinStein würfelt nicht!
^ 18th Computer Olympiad - Day 4 Photos by Jan Krabbenbos
^ 18th Computer Olympiad, Go - Leiden 2015 (ICGA Tournaments)
^ 18th Computer Olympiad - Day 6 Photos by Jan Krabbenbos
^ 18th Computer Olympiad, Go (13x13) - Leiden 2015 (ICGA Tournaments)
^ 18th Computer Olympiad, Go (9x9) - Leiden 2015 (ICGA Tournaments)
^ Results | ICGA | Hex 11×11
^ 18th Computer Olympid - Day 5 Photos by Jan Krabbenbos
^ Results | ICGA | Hex 13×13
^ 18th Computer Olympiad, Lines of Action - Leiden 2015 (ICGA Tournaments)
^ Results | ICGA | Shogi
^ Results | ICGA | Mini Shogi
^ 18th Computer Olympid - Day 5 Photos by Jan Krabbenbos
^ Results | ICGA | Tori Shogi

What links here?

Page	Date Edited
16th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
19th Computer Olympiad	Sep 19, 2017
20th Computer Olympiad	Feb 5, 2018
Advances in Computer Games 14	Aug 11, 2017
Amazons	Aug 12, 2017
Andrew Lin	Jul 9, 2016
Aske Plaat	Jun 26, 2017
Backgammon	Dec 22, 2017
Ben Ruijl	Jan 11, 2016
Chimo	Jul 26, 2017
Chinese Chess	Jan 16, 2018
Chinese Dark Chess	Sep 19, 2017
Chu-Hsuan Hsueh	Jul 19, 2017
Clobber	May 16, 2017
Computer Olympiad	Mar 6, 2018
Draughts	Jul 12, 2017
EinStein würfelt nicht!	Aug 11, 2017
Fabien Letouzey	Feb 5, 2018
Frank Berger	Jan 16, 2017
Go	Jan 24, 2018
HaQiKi D	Jul 26, 2017
Harm Geert Muller	Mar 31, 2018
Hex	Dec 29, 2017
I-Chen Wu	Sep 19, 2017
ICGA Journal	Dec 21, 2017
Ingo Althöfer	May 4, 2017
Jaap van den Herik	Sep 18, 2017
Jakub Pawlewicz	Dec 29, 2017
Johanna Hellemons	Jan 8, 2017
Kei Takada	Jun 10, 2017
Leiden University	Jul 5, 2016
Lines of Action	Feb 5, 2018
Nardy Pillards	Jan 10, 2017
Nikolaos Papahristou	Jan 7, 2017
Pascal Tang	Jul 23, 2017
Ryan Hayward	Dec 29, 2017
Shiga	Jul 26, 2017
Shogi	Feb 19, 2018
Simon Portegies Zwart	Jan 10, 2016
Tobias Graf	Jul 8, 2016
Walter Kosters	Jan 8, 2017
WCCC 2015	Jun 13, 2017
WCSC 2015	Jun 13, 2017
XieXie	Jul 26, 2017

Up one Level

8x8 Board

GerdIsenberg — Tue, 29 Aug 2017 19:47:49 GMT

Home * Board Representation * Mailbox * 8x8 Board

		The 8x8 Board as basic square-centric board representation is either a two-dimensional array of bytes (or integers), containing piece and empty square codes, indexed by file and rank index, or more commonly a one-dimensional array indexed by a square in a 0..63 range which combines rank or file indices in three consecutive bits each ^[1] . Such a board representation is often used redundantly in bitboard programs to answer the question which piece (if any) resides on a square efficiently. It has to deal with square mapping accordantly.
8x8 board with LERF square indices

Alternatives

As lone board representation, the 8x8 board has some efficiency issues with move generation related to off the board test. Therefor more common are approaches dealing with that, that is 10x12 board with surrounding ranks and files, and Vector Attacks with its cheap test and unique square difference property with respect to distance and direction ^[2]. In Games Playing with Computers, 1972 ^[3] , Alex Bell introduced an array of 65 squares, where the purpose of square 65 (always empty) is to detect pawns capturing outside the board by a table driven move generator.

Publications

Claude Shannon (1949). Programming a Computer for Playing Chess. pdf from The Computer History Museum
Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227

Forum Posts

Re: Ferret/Gerbil question by Bruce Moreland, CCC, September 21, 2001 » Ferret, Gerbil, 0x88

External Links

Chapter 3: Board Games - 3.1 CHESS from Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227
8 x 8: A Chess Sonata in 8 Movements (1957) directed by Hans Richter, Marcel Duchamp and Jean Cocteau, YouTube Video
Cast ^[4]: Jean Arp, Paul Bowles, Ceal Bryson, Alexander Calder, Jean Cocteau, Willem de Vogel, Dorothea Tanning
Max Ernst, Richard Huelsenbeck, Frederick Kiesler, Julien Lary, Julien Levy, Jaqueline Matisse, Eugene Pellegrini, Man Ray, Yves Tanguy

References

^ Chess board representations by Robert Hyatt
^ Fritz M.H. Reul (2009). New Architectures in Computer Chess, Ph.D. Thesis, 2 Non-Bitboard Architectures
^ Chapter 3: Board Games - 3.1 CHESS from Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227
^ 8 X 8: A Chess Sonata in 8 Movements (1957) - Full Cast & Crew - IMDb

What links here?

Page	Date Edited
10x12 Board	Feb 19, 2018
8x8 Board	Aug 29, 2017
Alarm	Jun 7, 2017
AlphaZero	Feb 10, 2018
Arasan	Apr 8, 2018
Array	Dec 1, 2016
Atlas	Nov 5, 2017
Averno	Sep 28, 2015
Belofte	Jun 29, 2017
Belzebub	Oct 20, 2015
Bills Bare Bones Chess	Nov 19, 2015
Bismark	Apr 22, 2015
Bitboard Serialization	Dec 24, 2014
Board Representation	Dec 11, 2017
Cheops (Miller)	Jan 13, 2017
Chess 0.5	Nov 20, 2016
Coiled	Mar 12, 2017
Color Flipping	May 17, 2017
Color of a Square	May 24, 2015
Demolito	Mar 1, 2018
Deuterium	Jun 23, 2014
Diagonal Mirroring	Jun 29, 2013
Direction	Oct 6, 2016
Distance	Sep 25, 2015
Dorpsgek	Apr 2, 2018
Ethereal	Mar 20, 2018
EXchess	Jan 21, 2018
Firstchess	Nov 27, 2014
Fixafan	Oct 2, 2015
Floyd	Sep 11, 2016
FUSCsharp	Jun 7, 2013
Green Light Chess	Jan 21, 2018
Hagrid	Apr 12, 2016
HAL	Jun 14, 2016
Horizontal Mirroring	Jun 29, 2013
ISA	Apr 2, 2018
Kholin	Jan 3, 2018
Knight Pattern	Feb 23, 2015
Konrad Zuse	Apr 30, 2015
Lachex	Jan 7, 2016
Little Rook Chess	Sep 1, 2015
LL Chess	May 23, 2015
Mailbox	Apr 14, 2018
Marvin	Feb 10, 2018
Mini Chess	Jun 7, 2013
Myopic	Nov 11, 2016
NoonianChess	Jan 7, 2016
NoraGrace	Nov 23, 2014
Obender	Apr 17, 2016
Ostrich	Dec 28, 2017
Peasant	May 21, 2015
Pieces	Feb 19, 2018
Quad-Bitboards	Jan 30, 2017
Rays	Oct 20, 2016
Rodent	Jan 11, 2018
Ruffian	Jun 6, 2017
RuyDos	Feb 17, 2018
Scidlet	May 31, 2014
Sensor Chess	Jun 7, 2013
Sharp Chess	Jun 6, 2017
Snitch	Apr 7, 2016
Spector	Nov 11, 2016
Stan Arts	Nov 21, 2014
Sungorus	Apr 11, 2014
Sunsetter	Jun 1, 2017
Supra	Jul 24, 2016
Table-driven Move Generation	Feb 19, 2017
Tunguska	Sep 16, 2017
Vector Attacks	Dec 15, 2017
Vertical Flipping	Oct 10, 2013
Vice	Mar 8, 2016
Winter	Jan 23, 2018
WyldChess	Mar 10, 2018
Xadreco	Jul 23, 2017

Up one Level

Alan Kotok

GerdIsenberg — Sun, 21 Sep 2014 11:02:18 GMT

Home * People * Alan Kotok

		Alan Kotok, (November 9, 1941 – May 26, 2006) was an American computer scientist, known for the Kotok-McCarthy-Chess Program ^[1]^[2]^[3], his work at Digital Equipment Corporation, and his contributions on the World Wide Web Consortium (W3C). Between 1959 and 1962, while student under John McCarthy at MIT, Alan Kotok and his fellows Elwyn Berlekamp, Michael A. Lieberman, Charles Niessen and Robert A. Wagner wrote a chess program for the IBM 7090. Based on Alex Bernstein's 1957 program and routines by McCarthy and Paul W. Abrahams, they added alpha-beta pruning to minmax, at McCarthy's suggestion. The Kotok-McCarthy-Program was written in Fortran and FAP, the IBM 7090 macro assembler.
Alan Kotok at CSAIL in 2006 ^[4]

See also

Selected Publications

External Links

References

What links here?

Selected Publications

Alan Kotok (1962). Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program. pdf
Alan Kotok (1962). A Chess Playing Program for the IBM 7090. B.S. Thesis, MIT, AI Project Memo 41, Computation Center, Cambridge MA. pdf
Gordon Bell, Alan Kotok, Thomas N. Hastings, Richard Hill (1978). The Evolution of the DECsystem-10. Communications of the ACM, 21(1): 44-63 » PDP-10

External Links

Alan Kotok from Wikipedia
Welcome to the Web site of Alan Kotok
Tech Model Railroad Club from Wikipedia
Alan Kotok from The Computer History Museum
The Mouse That Roared: PDP-1 Celebration Event Lecture, May 15, 2006, (1:53:44) Mountain View, CA, USA: © 2006, The Computer History Museum. Panel discussion including Alan Kotok (53:50-1:08:40) ^[5] and John McCarthy (1:27:20), moderated by Edward Fredkin from 17:40, YouTube Video

References

^ Alan Kotok (1962). Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program. pdf
^ Forty five years ago by Steven Edwards, CCC, May 01, 2007
^ Competitions, Controversies, and Computer Chess (pdf) by Michael Brudno (May 2000)
^ Alan Kotok at CSAIL in 2006, Alan Kotok from Wikipedia
^ Alan Kotok died at his home in Cambridge, apparently from a heart attack, on May 26, 2006, eleven days after the PDP-1 Celebration Event

What links here?

Page	Date Edited
Alan Kotok	Sep 21, 2014
Charles Niessen	Sep 23, 2011
Chess	Jan 21, 2018
Computer Chess Compendium	Dec 29, 2015
Edward Fredkin	Oct 27, 2013
Elwyn Berlekamp	Jun 25, 2015
History	Jan 2, 2018
IBM 7090	Jan 19, 2018
John McCarthy	Jan 5, 2017
Kotok-McCarthy-Program	Jul 14, 2015
Massachusetts Institute of Technology	Jan 24, 2017
Mater	Apr 26, 2016
Michael A. Lieberman	Jan 9, 2014
Paul W. Abrahams	Oct 9, 2013
PDP-1	Oct 27, 2013
PDP-10	Apr 20, 2018
PDP-6	Jan 19, 2018
People	Feb 28, 2018
Robert A. Wagner	Oct 28, 2013

Up one level

Alan Turing

GerdIsenberg — Wed, 08 Feb 2017 17:00:25 GMT

Home * People * Alan Turing

		Alan Mathison Turing, (23 June 1912–7 June 1954) was an English mathematician, logician, and cryptographer. Alan Turing was based at Bletchley Park ^[1], Bletchley in Buckinghamshire, while acting as the leading cryptanalyst of German ciphers during the World War II. He was the central force in continuing to break the Enigma machine ^[2] ^[3] ^[4] ^[5] ^[6], and to crack the Lorenz cipher (codenamed "Tunny") ^[7]. Alan Turing was one of the pioneers of the information theory and computer science. He was highly influential in its development, giving a formalization of the concepts of "algorithm" and "computation" with the Turing machine, which can be considered a model of a general purpose computer ^[8].
Alan Turing ^[9]

Photos

Ratio Club at Cambridge 1952, Giles Brindley (yellow), Donald MacKay (red), Alan Turing (green) ^[10]

Turing Machine

Turing machines are abstract symbol-manipulating devices which can be adapted to simulate the logic of any computer algorithm, described in 1936 by Alan Turing ^[11] , as thought experiment about the limits of mechanical computation. An example of a concrete Turing machine is the Busy beaver ^[12] .

The Universal Turing machine can simulate an arbitrary Turing machine on arbitrary input, and can be considered as the origin of the John von Neumann architecture. A universal Turing machine can calculate any recursive function, decide any recursive language, and accept any recursively enumerable language. According to the Church-Turing thesis, the problems solvable by a universal Turing machine are exactly those problems solvable by an algorithm or an effective method of computation, for any reasonable definition of those terms. For these reasons a system that can simulate a universal Turing machine is called Turing complete.

Turing Test

Turing addressed the problem of artificial intelligence, and proposed an experiment now known as the Turing test, an attempt to define a standard for a machine to be called "intelligent" ^[13] ^[14] .

Chess and Go

Alan Turing used chess-playing as an example of what a computer could do. Along with David Champernowne he specified a chess playing algorithm, implemented as "paper machine" dubbed Turochamp. Since there was no machine yet that could execute the instructions, he did himself, acting as a human CPU requiring more than half an hour per move. One game is recorded, which Turing's "paper machine" lost to one of his colleagues ^[15], Alick Glennie. At the University of Manchester, Turing began programming Turochamp, as well as Michie's and Wylie's program Machiavelli, to run on a Ferranti Mark 1 computer, but could not complete them ^[16].

Could one make a machine?

In his 1953 paper 'Chess' in Bowden's Faster Than Thought ^[17] , Turing asks some questions, answered and discussed them, mentioning evaluation features, the concepts of minimax strategy, variable look-ahead, quiescence and learning. He does not explicitly mention the name Turochamp, but the 'Machine', and its game versus a human ^[18] ^[19] .

When one is asked 'Could one make a machine to play chess?', there are several possible meanings which might be given to the words. Here are a few:

Could one make a machine which would obey the rules of chess, i.e. one which would play random legal moves, or which could tell one whether a given move is a legal one?
Could one make a machine which would solve chess problems, e.g. tell one whether, in a given position, white has a forced mate in three?
Could one make a machine which would play a reasonable good game of chess, i.e. which, confronted with an ordinary (that i, not particularly unusual) chess position, would after two or three minutes of calculation, indicate a passably good legal move?
Could one make a machine to play chess, and to improve its play, game by game, profiting from its experience?

To these we may add two further questions, unconnected with chess, which are likely to be on the tip of the reader's tongue.

Could one make a machine which would answer questions put to it, in such a way that it would not be possible to distinguish its answers from those of a man?
Could one make a machine which would have feelings like you and I do?

Andrew Hodges

Andrew Hodges in the Alan Turing Scrapbook - the Origins of Artificial Intelligence ^[20] :

Alan Turing talked at Bletchley Park with his younger colleague Jack Good about what we would now call chess-playing programs. They got the idea of searching decision trees for the best move.

Turing knew the game of Go as early as 1936: in fact he explained it to Christopher Morcom's mother shortly before he left for America. At Bletchley Park he showed the game to others including Jack Good. According to the British Go Association's page it was Good who twenty years later popularised the game in Britain.

In the later years of the war, he talked with a young student, Donald Michie, about the prospect of machines 'learning.' In other conversations he talked about 'building a brain.' It seems that it was during the war that he came to the view that anything done by the brain must be a computable operation, and so could be simulated by a Turing machine.

Turing's post-war ideas reflected the discussions he had enjoyed during the wartime period. After 1945 he often used chess-playing as an example of what a computer could do, and in his 1946 report on the possibilities of a computer, made his first reference to machine 'intelligence' in connection with chess-playing. In 1948 he met Donald Michie again and competed with him in writing a simple chess-playing algorithm.

Jack Good

Jack Good in 1998 ^[21]:

In letters to Turing, on September 16 and October 3, 1948, I mentioned the idea of resonance circuits in the brain; especially as a method for noticing analogies... In the postscript I discussed chess-playing machines, which he and I had discussed in 1941, and gave a reasonable definition of a forced variation. I took for granted the need to distinguish between quiescent and non-quiescent positions. Shannon's paper on chess appeared in 1950.

Punishment and Death

Turing was just 41 years old when he committed suicide, two years after undergoing a court-ordered chemical castration. He had been found guilty of gross indecency for having a homosexual relationship. The punishment in 1952 was either a prison sentence or chemical castration. Turing chose the latter. In September 2009 the British government has issued a formal apology for the way Alan Turning was treated ^[22] ^[23] .

Selected Publications

^[24]

1936 ...

Alan Turing (1936). On computable numbers, with an application to the Entscheidungsproblem. pdf

1940 ...

Alan Turing (1949). Alan Turing's Manual for the Ferranti Mk. I. transcribed in 2000 by Robert Thau, pdf from The Computer History Museum

1950 ...

Alan Turing (1950). Computing Machinery and Intelligence. Mind, 59, 433-460. pdf from The Computer History Museum
Alan Turing (1951). Programmers' Handbook for the Manchester Electronic Computer Mark II. 1st edition
Alan Turing (1952). Programmers' Handbook for the Manchester Electronic Computer Mark II. 2nd edition, revised by R.A. Brooker ^[25]
Alan Turing (1953). Chess. part of the collection Digital Computers Applied to Games. in Bertram Vivian Bowden (editor), Faster Than Thought, a symposium on digital computing machines, reprinted 1988 in Computer Chess Compendium, reprinted 2004 in Chapter 16 of The Essential Turing ... ^[26]

1990 ...

Edward Feigenbaum (1996). How the “What“ Becomes the “How“. Communications of the ACM, Vol. 39, No. 5, pdf hosted by The Computer History Museum

2000 ...

Jack Good (2000). Turing’s anticipation of emprical Bayes in connection with the cryptanalysis of the naval enigma. Journal of Statistical Computation and Simulation, Vol. 66, No. 2 ^[27] ^[28] ^[29]
Alan Turing, B. Jack Copeland (editor) (2004). The Essential Turing, Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma. Oxford University Press, amazon, google books

2010 ...

B. Jack Copeland, Diane Proudfoot (2011-2012). Turing, Father of the Modern Computer. The Rutherford Journal - The New Zealand Journal for the History and Philosophy of Science and Technology, Vol. 4 » with photos of Alan Turing, John von Neumann, Dietrich Prinz, Christopher Strachey, Jack Good, Arthur Samuel, Herbert Simon, Allen Newell, ...
Andrew Appel (ed.) (2012). Alan Turing's Systems of Logic: The Princeton Thesis. Princeton University Press
Guy McCrossan Haworth (2013). Turing, Kasparov and the Future. ICGA Journal, Vol. 36, No. 1 » Turochamp
Kieran Greer (2014). Turing: Then, Now and Still Key. arXiv:1403.2541

Forum Posts

How did Alan Turing's program work? by Pete Galati, CCC, April 20, 2000
Finally Science Meets Computer Chess XI (Turing) by Phil Innes, rgcc, November 11, 2001

External Links

Alan Turing from Wikipedia
Alan Turing - Wikiquote
Turing Award from Wikipedia by the ACM
Alan Turing from enigma wiki
The Mind and the Computing Machine edited by B. Jack Copeland, from The Rutherford Journal - The New Zealand Journal for the History and Philosophy of Science and Technology
Alan Turing by Jürgen Schmidhuber
Turing letter to W. Ross Ashby from William Ross Ashby's Digital Archive
Alan Turing from The Computer History Museum
Computer und Schach: "Die goldene Gans, die niemals schnattert" by André Schulz, Spiegel Online, November 12, 2003 (German) ^[30]
Alan Turing by André Schulz, June 07, 2004, ChessBase Nachrichten (German)
Alan Turing: "I am building a brain." Half a century later, its successor beat Kasparov by Professor S. Barry Cooper, The Northerner | UK news, guardian.co.uk
Alan Turing: why the tech world's hero should be a household name by Vint Cerf, BBC News, June 18, 2012
Alan Turing: Inquest's suicide verdict 'not supportable' by Roland Pease, BBC News, June 23, 2012
Spies and Spymasters > Second World War > Alan Turing from Spartacus Educational
Chess and the Code-Breakers by Edward Winter

Turing Machine

Devices and Computers

Turing Test

Turing Archive

Andrew Hodges

Alan Turing: Primary Sources, notes by Andrew Hodges, author of Alan Turing: the Enigma
Alan Turing - Home Page maintained by Andrew Hodges, author of Alan Turing: the Enigma
The Alan Turing Internet Scrapbook maintained by Andrew Hodges, author of Alan Turing: the Enigma

Literature

Turing Year 2012

Alan Turing Year from Wikipedia
The Alan Turing Year - 2012 Turing Centenary
Eminent & enigmatic - 10 aspects of Alan Turing, the Heinz Nixdorf MuseumsForum, Flyer as pdf including abstracts of lectures
Jürg Nievergelt Known or wanted: chess matches between Man and machine.
Raúl Rojas Turing and Zuse.
Turing Jahr 2012 - Alan Turing Year 2012, Gesellschaft für Informatik e.V (German)
Donald Knuth in Alan Turing Year from I Programmer - programming, reviews and projects, January 10, 2012 » Donald Knuth
Alan Turing Year (alanturingyear) at Twitter
ACM A.M. Turing Centenary Celebration
The Alan Turing Centenary Conference Manchester UK, June 22-25, 2012, hosted by the University in Manchester

Movies

The Strange Life and Death of Dr Turing, BBC TV science series Horizon (1992), YouTube Videos ^[31]
featuring Marvin Minsky, Andrew Hodges, Norman Routledge ^[32], Jack Good, Shaun Wylie, Joan Clarke, Robin Gandy et al.
Breaking the Code (1996) (TV)
Codebreaker (2011) - Channel 4, Official Site
The Imitation Game (2014) - Official Trailer - The Weinstein Company, YouTube Video

References

^ Bletchley Park Museum
^ The plugboard-equipped Enigma machine was already solved in 1932 by Marian Rejewski at Biuro Szyfrów, the Polish General Staff's agency, ongoing development of methods and equipment to exploit Enigma decryption was continued before and during World War II by Jerzy Różycki and Henryk Zygalski
^ Marian Rejewski (1981). How Polish Mathematicians Deciphered the Enigma. IEEE Annals of the History of Computing, pdf
^ Polish Enigma double from Wikipedia
^ Alan Turing - Cryptanalysis from Wikipedia
^ Cryptanalysis of the Enigma from Wikipedia
^ Jack Good, Donald Michie, Geoffrey Timms (1945). General Report on Tunny from The Turing Archive for the History of Computing
^ Alan Turing from Wikipedia
^ © National Portrait Gallery - Portrait - NPG x27078; Alan Mathison Turing by Elliott & Fry, March 29, 1951, Given by Ethel Sara Turing (née Stoney), 1956, Alan Turing from Wikipedia
^ Giles Brindley, Part 2 More To Know About Someone You Should Know, November 01, 2006
^ Alan Turing (1936). On computable numbers, with an application to the Entscheidungsproblem. pdf
^ Busy Beaver by Heiner Marxen
^ Alan Turing (1950). Computing Machinery and Intelligence. Mind, 59, 433-460. pdf from The Computer History Museum
^ James H. Moor (2003). The Turing Test: The Elusive Standard of Artificial Intelligence. Kluwer Academic Publishers
^ A short history of computer chess from ChessBase
^ Chronology of Computing compiled by David Singmaster
^ Alan Turing (1953). Chess. part of the collection Digital Computers Applied to Games. in Bertram Vivian Bowden (editor), Faster Than Thought, a symposium on digital computing machines, reprinted 1988 in Computer Chess Compendium, reprinted 2004 in Chapter 16 of Alan Turing, B. Jack Copeland (editor) (2004). The Essential Turing, Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma. Oxford University Press, amazon, google books
^ Anmerkungen zur Programmierung der Turing-Engine by Mathias Feist, ChessBase Spotlights (German, with original article 'Chess' by Alan Turing)
^ Re: How did Alan Turing's program work? by Frederic Friedel, CCC, April 22, 2000
^ Alan Turing Scrapbook - the Origins of Artificial Intelligence by Andrew Hodges
^ Excerpts from Acceptance Speech for the 1998 Computer Pioneers Award from the IEEE - Jack Good hosted by Atlas Computer Laboratory
^ Thousands call for Turing apology, BBC NEWS August 31, 2009
^ Treatment of Alan Turing was “appalling” - PM, Gordon Brown’s statement from Number10.gov.uk, September 10, 2009
^ Janus: The Papers of Alan Mathison Turing
^ Mark 1 Documents from Computer 50 - The University of Manchester Celebrates the Birth of the Modern Computer
^ Anmerkungen zur Programmierung der Turing-Engine by Mathias Feist, ChessBase Spotlights (German, with original article 'Chess' by Alan Turing)
^ Banburismus from Wikipedia
^ Good–Turing frequency estimation from Wikipedia
^ David McAllester, Robert Schapire (2000). On the Convergence Rate of Good-Turing Estimators. COLT 2000, CiteSeerX
^ New Chessbase Engine called "Turing" by Ingo Bauer, CCC, November 12, 2003
^ The Strange Life and Death of Dr Turing from The Computer History Museum
^ Mathematician Norman Routledge on Alan Turing, Scientific Computing, July 09, 2012

What links here?

Page	Date Edited
Alan Turing	Feb 8, 2017
Andrew Appel	Feb 9, 2017
Arthur Guez	Dec 6, 2017
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
Barbara Liskov	Oct 30, 2014
BitScan	Sep 10, 2017
Chess	Jan 21, 2018
Christopher Strachey	May 8, 2017
Computer Chess Compendium	Dec 29, 2015
David Champernowne	Mar 29, 2016
Dietrich Prinz	Oct 14, 2016
Donald Knuth	Aug 29, 2016
Donald Michie	Dec 23, 2017
Edward Feigenbaum	Jan 3, 2016
Eliot Slater	Aug 6, 2016
Enigma	Feb 9, 2015
Evaluation	Feb 1, 2018
Ferranti Mark 1	Jun 2, 2015
Frédéric Prost	Oct 16, 2014
Games	Feb 20, 2018
Georgy Adelson-Velsky	Apr 9, 2018
Guy Haworth	Nov 20, 2017
Heinz Nixdorf MuseumsForum	Sep 6, 2015
History	Jan 2, 2018
ICGA Journal	Dec 21, 2017
Jack Good	Dec 22, 2017
John von Neumann	May 8, 2017
Jos Uiterwijk	Aug 11, 2017
Jürgen Schmidhuber	Feb 3, 2018
Kaissa	Apr 9, 2018
Kathe Spracklen	Dec 25, 2017
Kieran Greer	Nov 7, 2014
Konrad Zuse	Apr 30, 2015
La Dame Blanche	Oct 15, 2015
Learning	Feb 20, 2018
Machiavelli	Jun 2, 2015
Manuela Veloso	Aug 5, 2015
Match Statistics	Mar 31, 2018
Material	Mar 31, 2018
Mathematician	Apr 9, 2018
Mobility	Jan 17, 2018
Neural Networks	Mar 12, 2018
People	Feb 28, 2018
Point Value	Mar 31, 2018
Population Count	Sep 3, 2017
Quote McCarthy	Sep 10, 2013
Shaun Wylie	Jun 2, 2015
SOMA	Mar 25, 2015
Turochamp	Dec 14, 2017
University of Manchester	May 24, 2017

Up one level

Albrecht Heeffer

GerdIsenberg — Tue, 06 Sep 2016 13:31:36 GMT

Home * People * Albrecht Heeffer

		Albrecht Heeffer, a Belgian electrical engineer and philosopher with research interests in the history of algebra ^[1], computational models for scientific discovery ^[2], recreational mathematics, and further in chess, computer chess and shogi. He holds a degree in electrical engineering and a Ph.D. in philosophy from Ghent University in 2006 on the topic of emergence of symbolic algebra during the sixteenth century ^[3], and is post-doctoral fellow of the Research Foundation Flanders (FWO) ^[4] and member of the Center for Logic and Philosophy of Science ^[5] at Ghent University. In 1984, during a three month visit of the Turing Institute in Glasgow, Albrecht Heeffer worked on automated acquisition on concepts for the description of middlegame positions in chess ^[6], supported by Donald Michie, John Roycroft, and Tim Niblett ^[7]. Albrecht Heeffer was member of the Bionic Impakt team with Hans Secelle, and provided the hardware, worked through the test sets, added the endgame databases and did some optimizations ^[8], while they later joined the Ant team around Tom Vijlbrief.
Albrecht Heeffer ^[9]

Photos

Selected Publications

Photos



Albrecht Heeffer, Mathias Feist and Frans Morsch, ICT 2001 ^[10], round 5, Ant - Fritz ^[11]

Boris Spassky, Yoshiharu Habu, Albrecht Heeffer, Paris May 23, 2002 ^[12]

Selected Publications

^[13] ^[14] ^[15]

1984

Albrecht Heeffer (1984). Automated Acquisition on Concepts for the Description of Middle-game Positions in Chess. Turing Institute, Glasgow, Scotland, TIRM-84-005

1985 ...

Albrecht Heeffer (1985). Validating Concepts from Automated Acquisition Systems. IJCAI 85, pdf
Albrecht Heeffer, Marc Leman (1986). Chunking as a Method for Concept Acquisition. Proceedings of the 7th European Conference on Artificial Intelligence
Fernand Vandamme, Albrecht Heeffer (1986). An overview of expert systems. Proceedings of Expert Systems: Available Hard- and Software

1995 ...

Patrick De Causmaecker, Albrecht Heeffer, Greet Vanden Berghe (1997). A Cost Function approach towards Scheduling of Highly Constrained Resources. Proceedings of the International Colloquium on European Cooperation in International Projects, Information Technologies and Environmental Sciences

2000 ...

Albrecht Heeffer (2003). Kepler's near discovery of the sine law: a qualitative computational model. Computer modeling of scientific reasoning, pdf ^[16]
Albrecht Heeffer (2004). Récréations Mathématiques (1624) A Study on its Authorship, Sources and Influence. pdf

2005 ...

Albrecht Heeffer (2006). The Regula Quantitatis or the invention of the second unknown. The 22nd International Conference on the History of Science
Albrecht Heeffer (2006). Van precepten tot vergelijkingen: de conceptuele ontwikkeling van de symbolische algebra in de zestiende eeuw. Ph. D. thesis, Universiteit Gent (Flemish)
Albrecht Heeffer, Harold Heeffer (2007). Near-Optimal Strategies for the Game of Logik. pdf ^[17]
Albrecht Heeffer (2007). Mathematics education through lesson study in the Asia-Pacific region. pdf
Albrecht Heeffer (2007). On the Nature and Origin of Algebraic Symbolism. pdf
Albrecht Heeffer (2007). Humanist Repudiation of Eastern Influences in Early Modern Mathematics. pdf
Albrecht Heeffer (2008). From Problem Solving to Argumentation: Pacioli’s Appropriation of Abbacus Algebra. pdf ^[18]
Albrecht Heeffer (2008). Negative Numbers As An Epistemic Difficult Concept: Some Lessons From History. pdf
Albrecht Heeffer (2008). Text production, reproduction and appropriation within the abbaco tradition: a case study. pdf
Albrecht Heeffer (2008). Estienne de la Roche’s appropriation of Chuquet (1484). pdf ^[19] ^[20]
Albrecht Heeffer (2008). On the interpretation of early Italian bartering problems. pdf
Albrecht Heeffer (2008). A Conceptual Analysis of Early Arabic Algebra. pdf
Albrecht Heeffer (2009). On the curious historical coincidence of algebra and double-entry bookkeeping. To appear in: Karen François, Benedikt Löwe, Thomas Müller, and Bart van Kerkhove (eds.) Foundations of the Formal Sciences. Bringing together Philosophy and Sociology of Science, College Publications, London. pdf
Albrecht Heeffer (2009). The Abbacus Tradition: the Missing Link between Arabic and Early Symbolic Algebra? pdf
Albrecht Heeffer (2009). Algebraic partitioning problems from Luca Pacioli's Perugia manuscript (Vat. Lat. 3129). pdf

2010 ...

Albrecht Heeffer (2010). Regiomontanus and Chinese Mathematics. pdf ^[21]
Albrecht Heeffer (2011). The Rule of Quantity by Chuquet and de la Roche and its Influence on German Cossic Algebra. Archives internationales d'histoire des sciences, pdf
Albrecht Heeffer (2011). Models of scientific discovery: what do they explain?. Third international conference on philosophy and cognitive science, Proceedings ^[22]
Albrecht Heeffer (2011). From problem solving to the teaching of algebra: the genesis of the algebra textbook. 11th international IHPST and 6th Greek history, philosophy and science teaching joint conference, Proceedings
Albrecht Heeffer (2012). The genesis of the algebra textbook: from Pacioli to Euler. Almagest
Albrecht Heeffer (2012). Dutch arithmetic, samurai and warships: teaching of Western mathematics in pre-Meiji Japan. History and Pedagogy of Mathematics, Proceedings ^[23]
Albrecht Heeffer (2012). Sangaku: the mathematics of traditional Japanese votive tablets. Mathematics Today ^[24]
Albrecht Heeffer (2013). Why the quadratic equation has only one root (according to abbaco masters). Mathematics Today
Albrecht Heeffer (2013). Algebraic symbolism as a conceptual barrier in learning mathematics. 6th East Asia Regional Conference on Mathematics Education, Proceedings
Albrecht Heeffer (2013). Was Uncle Tom right that quadratic problems can't be solved with the rule of false position?. The Mathematical Intelligencer
Albrecht Heeffer (2014). Cardano's favorite problem: the Proportio Reflexa. The Mathematical Intelligencer ^[25]

External Links

Albrecht Heeffer | Sarton Centre for History of Science
Albrecht Heeffer | Max Planck Institute for the History of Science
Albrecht Heeffer's homepage
Members - Albrecht Heeffer from Centre for Logic and Philosophy of Science
Albrecht Heeffer - Google Scholar Citations
Albrecht Heeffer - ResearchGate
Albrecht Heeffer - Microsoft Academic Search
European/Worldwide Open Shogi Championship 2002 - Participants
Albrecht Heeffer - The Abbaco mathematical culture (1300 - 1500) , YouTube Video
First Conference on Mathematical Cultures, September 10-12, 2012 at De Morgan House, London

References

^ Sources in the history of algebra by Albrecht Heeffer
^ Centre for History of Science - dr. Albrecht Heeffer
^ Albrecht Heeffer (2006). Van precepten tot vergelijkingen: de conceptuele ontwikkeling van de symbolische algebra in de zestiende eeuw. Ph. D. thesis, Universiteit Gent
^ Research Foundation Flanders
^ Center for Logic and Philosophy of Science
^ Albrecht Heeffer (1984). Automated Acquisition on Concepts for the Description of Middle-game Positions in Chess. Turing Institute, Glasgow, Scotland, TIRM-85-005
^ Albrecht Heeffer (1985). Validating Concepts from Automated Acquisition Systems. IJCAI 85, pdf, This work was carried out during a three month visit at the Turing Institute. Financial support was provided by the Belgian NFWO and the ICIWO. I would like to express my thank s to Prof. F. Vandamme of the University of Ghent, and to Prof. Donald Michie, Mr John Roycroft and Dr Tim Niblett of the Turing Institute, for their helpful suggestions
^ Re: Bionic Vs Crafty Debate: some data required by Albrecht Heeffer, CCC, January 25, 1999 » Crafty
^ Albrecht Heeffer | Sarton Centre for History of Science
^ Leiden 2001 by László Szalai
^ ICT Leiden 2001 - download
^ Albrecht Heeffer - My game against Habu
^ Preprints from 1995 on
^ Albrecht Heeffer - Publications
^ dblp: Albrecht Heeffer
^ Johannes Kepler from Wikipedia
^ Mastermind (board game) from Wikipedia
^ Luca Pacioli from Wikipedia
^ Estienne de la Roche from Wikipedia
^ Nicolas Chuquet from Wikipedia
^ Regiomontanus from Wikipedia
^ Knowledge extraction from Wikipedia
^ Emperor Meiji from Wikipedia
^ Sangaku from Wikipedia
^ Gerolamo Cardano from Wikipedia

What links here?

Page	Date Edited
Albrecht Heeffer	Sep 6, 2016
Ant	Jun 1, 2015
Bionic Impakt	Sep 6, 2014
Chunking	Jun 12, 2017
DOCCC 2000	Aug 15, 2015
Hans Secelle	Nov 2, 2012
Knowledge	Jul 22, 2017
Learning	Feb 20, 2018
Mathematician	Apr 9, 2018
Middlegame	Sep 6, 2016
People	Feb 28, 2018

Up one level

AlphaZero

GerdIsenberg — Sat, 10 Feb 2018 08:23:53 GMT

Home * Engines * AlphaZero

		AlphaZero, a chess and Go playing entity by Google DeepMind based on a general reinforcement learning algorithm with the same name. On December 5, 2017, the DeepMind team around David Silver, Thomas Hubert, and Julian Schrittwieser along with former Giraffe author Matthew Lai, reported on their generalized algorithm, combining Deep learning with Monte-Carlo Tree Search (MCTS) ^[1] . A 100 game match versus Stockfish 8 using 64 threads and a transposition table size of 1GiB, was won by AlphaZero using a single machine with 4 Tensor processing units (TPUs) with +28=72-0. Despite a possible hardware advantage of AlphaZero and criticized playing conditions ^[2], this seems a tremendous achievement.
The Krampus has come ^[3] ^[4]

Description

Starting from random play, and given no domain knowledge except the game rules, AlphaZero achieved a superhuman level of play in the games of chess and Shogi as well as in Go. The algorithm is a more generic version of the AlphaGo Zero algorithm that was first introduced in the domain of Go ^[5] . AlphaZero evaluates positions using non-linear function approximation based on a deep neural network, rather than the linear function approximation as used in classical chess programs. This neural network takes the board position as input and outputs a vector of move probabilities. The MCTS consists of a series of simulated games of self-play whose move selection is controlled by the neural network. The search returns a vector representing a probability distribution over moves, either proportionally or greedily with respect to the visit counts at the root state.

Network Architecture

The network is a deep residual convolutional neural network ^[6] ^[7] with many layers of spatial NxN planes - 8x8 board arrays for chess. The input describes the chess position from side's to move point of view - that is color flipped for black to move. Each square cell consists of 12 piece-type and color bits, e.g. from the current bitboard board definition, and to address graph history and path-dependency - times eight, that is up to seven predecessor positions as well - so that en passant, immediate repetitions, or some sense of progress is implicit. Additional inputs, redundant inside each square cell to be conform to the convolution net, consider castling rights, halfmove clock, total move count and side to move.

The deep hidden layers connect the pieces on different squares to each other due to consecutive 3x3 convolutions, where a cell of a layer is connected to the correspondent 3x3 receptive field of the previous layer, so that after 4 layers, each square is connected to every other cell in the original input layer ^[8]. The output of the neural network is finally represented as an 8x8 board array as well, for every origin square up to 73 target square possibilities (NRayDirs x MaxRayLength + NKnightDirs + NPawnDirs * NMinorPromotions), encoding a probability distribution over 64x73 = 4,672 possible moves, where illegal moves were masked out by setting their probabilities to zero, re-normalising the probabilities for remaining moves.

Training

AlphaZero was trained in 700,000 steps or mini-batches of size 4096 each, starting from randomly initialized parameters, using 5,000 first-generation TPUs ^[9] to generate self-play games and 64 second-generation TPUs ^[10] ^[11] ^[12] to train the neural networks ^[13] .

Publications

David Silver, Julian Schrittwieser, Karen Simonyan, Ioannis Antonoglou, Aja Huang, Arthur Guez, Thomas Hubert, Lucas Baker, Matthew Lai, Adrian Bolton, Yutian Chen, Timothy Lillicrap, Fan Hui, Laurent Sifre, George van den Driessche, Thore Graepel, Demis Hassabis (2017). Mastering the game of Go without human knowledge. Nature, Vol. 550, pdf
David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, Timothy Lillicrap, Karen Simonyan, Demis Hassabis (2017). Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm. arXiv:1712.01815

Forum Posts

2017

Google's AlphaGo team has been working on chess by Peter Kappler, CCC, December 06, 2017
Historic Milestone: AlphaZero by Miguel Castanuela, CCC, December 06, 2017
AlphaZero beats AlphaGo Zero, Stockfish, and Elmo by Carl Lumma, CCC, December 06, 2017
AlphaZero vs Stockfish by Bigler, CCC, December 06, 2017
Deepmind drops the bomb by Leebot, FishCooking, December 06, 2017
AlphaZero beats Stockfish 8 by 64-36 by Venator, Rybka Forum, December 06, 2017
Alpha Zero by BB+, OpenChess Forum, December 06, 2017
AlphaGo Zero And AlphaZero, RomiChess done better by Michael Sherwin, CCC, December 07, 2017 » RomiChess
BBC News; 'Google's ... DeepMind AI claims chess crown' by pennine22, Hiarcs Forum, December 07, 2017
Press Release Stockfish vs. AlphaZero by Michael Whiteley, FishCooking, December 08, 2017
AlphaZero reinvents mobility and romanticism by Chris Whittington, Rybka Forum, December 08, 2017 » Alpha Zero's "Immortal Zugzwang Game"
Reactions about AlphaZero from top GMs... by Norman Schmidt, CCC, December 08, 2017 » Reactions From Top GMs, Stockfish Author
AlphaZero is not like other chess programs by Dann Corbit, CCC, December 08, 2017
Re: AlphaZero is not like other chess programs by Rein Halbersma, CCC, December 09, 2017
Photo of Google Cloud TPU cluster by Norman Schmidt, CCC, December 09, 2017
Cerebellum analysis of the AlphaZero - Stockfish Games by Thomas Zipproth, CCC, December 11, 2017 » Cerebellum
Open letter to Google DeepMind by Michael Stembera, FishCooking, December 12, 2017
recent article on alphazero ... 12/11/2017 ... by Dan Ellwein, CCC, December 14, 2017
An AlphaZero inspired project by Truls Edvard Stokke, CCC, December 14, 2017
AlphaZero - Tactical Abilities by David Rasmussen, CCC, December 16, 2017
In chess,AlphaZero outperformed Stockfish after just 4 hours by Ed Schroder, CCC, December 18, 2017
AlphaZero - Youtube Videos by Christoph Fieberg, CSS Forum, December 18, 2017
AlphaZero Chess is not that strong ... by Vincent Lejeune, CCC, December 19, 2017
David Silver (Deepmind) inaccuracies by Ed Schroder, CCC, December 21, 2017
AZ vs SF - game 99 by Rebel, Rybka Forum, December 23, 2017
AlphaZero performance by Martin Sedlak, CCC, December 25, 2017
A Simple Alpha(Go) Zero Tutorial by Oliver Roese, CCC, December 30, 2017
AlphaZero: The 10 Top Shots by Walter Eigenmann, CCC, December 30, 2017

2018

SF was more seriously handicapped than I thought by Kai Laskos, CCC, January 02, 2018
Chess World to Google Deep Mind..Prove You beat Stockfish 8! by AA Ross, CCC, January 11, 2018
Article:"How Alpha Zero Sees/Wins" by AA Ross, CCC, January 17, 2018 » How AlphaZero Wins
Connect 4 AlphaZero implemented using Python... by Steve Maughan, CCC, January 29, 2018 » Connect Four, Python
Seeing Alphazero in perspective ... by Dan Ellwein, CCC, February 10, 2018

External Links

AlphaZero from Wikipedia
AlphaGo Zero - AlphaZero from Wikipedia
Keynote David Silver NIPS 2017 Deep Reinforcement Learning Symposium AlphaZero, December 06, 2017, YouTube Video ^[14]
A Simple Alpha(Go) Zero Tutorial by Surag Nair, Stanford University, December 29, 2017 ^[15]
GitHub - suragnair/alpha-zero-general: A clean and simple implementation of a self-play learning algorithm based on AlphaGo Zero (any game, any framework!)

Reports

DeepMind’s AI became a superhuman chess player in a few hours, just for fun by James Vincent, The Verge, December 06, 2017
Entire human chess knowledge learned and surpassed by DeepMind's AlphaZero in four hours by Sarah Knapton, and Leon Watson, The Telegraph, December 06, 2017
Google's 'superhuman' DeepMind AI claims chess crown, BBC News, December 06, 2017 ^[16]
DeepMind’s AlphaZero crushes chess by Colin McGourty, Chess24.com, December 06, 2017
One Small Step for Computers, One Giant Leap for Mankind by Dana Mackenzie, Dana Blogs Chess, December 06, 2017
Google's AlphaZero Destroys Stockfish In 100-Game Match by Mike Klein, Chess.com, December 06, 2017
The future is here – AlphaZero learns chess by Albert Silver, ChessBase News, December 06, 2017
AlphaZero: Reactions From Top GMs, Stockfish Author by Peter Doggers, Chess.com, December 08, 2017 » Stockfish, Tord Romstad ^[17]
Is AlphaZero really a scientific breakthrough in AI? by Jose Camacho Collados, Medium, December 11, 2017 ^[18]
Alpha Zero: Comparing "Orangutans and Apples" by André Schulz, ChessBase News, December 13, 2017
Kasparov on Deep Learning in chess by Frederic Friedel, ChessBase News, December 13, 2017

Stockfish Match

AlphaZero vs Stockfish Games • lichess.org
The chess games of AlphaZero (Computer) from chessgames.com
Cerebellum AlphaZero Analysis » Cerebellum ^[19]
Deep Mind Alpha Zero's "Immortal Zugzwang Game" against Stockfish by Antonio Radic, December 07, 2017, YouTube Video ^[20] ^[21] » Zugzwang
Deep Mind AI Alpha Zero Dismantles Stockfish's French Defense by Antonio Radic, December 08, 2017, YouTube Video
How AlphaZero Wins by Dana Mackenzie, Dana Blogs Chess, December 15, 2017 ^[22]

Misc

How to build your own AlphaZero AI using Python and Keras by David Foster, January 26, 2018 » Connect Four, Python ^[23]
Can - Halleluwah, from Tago Mago 1971, YouTube Video
lineup: Irmin Schmidt, Michael Karoli, Holger Czukay, Damo Suzuki, Jaki Liebezeit

References

^ David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, Timothy Lillicrap, Karen Simonyan, Demis Hassabis (2017). Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm. arXiv:1712.01815
^ Alpha Zero by BB+, OpenChess Forum, December 06, 2017
^ Krampus at Perchtenlauf in Klagenfurt, Image by Anita Martinz, December 02, 2006, CC BY 2.0, Wikimedia Commons
^ "5th of December - The Krampus has come" was suggested by Michael Scheidl in AlphaZero by Peter Martan, CSS Forum, December 06, 2017, with further comments by Ingo Althöfer
^ AlphaGo Zero: Learning from scratch by Demis Hassabis and David Silver, DeepMind, October 18, 2017
^ The principle of residual nets is to add the input of the layer to the output of each layer. With this simple modification training is faster and enables deeper networks, see Tristan Cazenave (2017). Residual Networks for Computer Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. PP, No. 99, pdf
^ Residual Networks for Computer Go by Brahim Hamadicharef, CCC, December 07, 2017
^ Re: AlphaZero is not like other chess programs by Rein Halbersma, CCC, December 09, 2017
^ First In-Depth Look at Google’s TPU Architecture by Nicole Hemsoth, The Next Platform, April 05, 2017
^ Photo of Google Cloud TPU cluster by Norman Schmidt, CCC, December 09, 2017
^ First In-Depth Look at Google’s New Second-Generation TPU by Nicole Hemsoth, The Next Platform, May 17, 2017
^ Under The Hood Of Google’s TPU2 Machine Learning Clusters by Paul Teich, The Next Platform, May 22, 2017
^ David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, Timothy Lillicrap, Karen Simonyan, Demis Hassabis (2017). Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm. arXiv:1712.01815
^ AlphaZero explained by one creator by Mario Carbonell Martinez, CCC, December 19, 2017
^ A Simple Alpha(Go) Zero Tutorial by Oliver Roese, CCC, December 30, 2017
^ BBC News; 'Google's ... DeepMind AI claims chess crown' by pennine22, Hiarcs Forum, December 07, 2017
^ Reactions about AlphaZero from top GMs... by Norman Schmidt, CCC, December 08, 2017
^ recent article on alphazero ... 12/11/2017 ... by Dan Ellwein, CCC, December 14, 2017
^ Cerebellum analysis of the AlphaZero - Stockfish Games by Thomas Zipproth, CCC, December 11, 2017
^ AlphaZero reinvents mobility and romanticism by Chris Whittington, Rybka Forum, December 08, 2017
^ Immortal Zugzwang Game from Wikipedia
^ Article:"How Alpha Zero Sees/Wins" by AA Ross, CCC, January 17, 2018
^ Connect 4 AlphaZero implemented using Python... by Steve Maughan, CCC, January 29, 2018

What links here?

Page	Date Edited
Albert Silver	Feb 25, 2018
Alpha I	Dec 6, 2017
AlphaZero	Feb 10, 2018
Arthur Guez	Dec 6, 2017
Chess	Jan 21, 2018
Chris Whittington	Dec 9, 2017
Connect Four	Jan 31, 2018
Dana Mackenzie	Jan 18, 2018
Dann Corbit	Dec 9, 2017
David Rasmussen	Dec 16, 2017
David Silver	Feb 11, 2018
Deep Learning	Feb 12, 2018
DeepMind	Dec 9, 2017
Demis Hassabis	Dec 8, 2017
Dharshan Kumaran	Dec 9, 2017
Engines	Mar 10, 2018
Frederic Friedel	Jan 6, 2018
Go	Jan 24, 2018
Ioannis Antonoglou	Dec 6, 2017
Julian Schrittwieser	Dec 7, 2017
Karen Simonyan	Dec 10, 2017
Laurent Sifre	Dec 7, 2017
LCZero	Apr 18, 2018
Learning	Feb 20, 2018
Marc Lanctot	Jan 10, 2018
Mark Watkins	Dec 6, 2017
Martin Sedlak	Dec 25, 2017
Mathematician	Apr 9, 2018
Matthew Lai	Dec 6, 2017
Michael Sherwin	Dec 18, 2017
Monte-Carlo Tree Search	Apr 26, 2018
Neural Networks	Mar 12, 2018
Othello	Jan 4, 2018
Peter Kappler	Feb 4, 2018
Python	Jan 31, 2018
Reinforcement Learning	Feb 12, 2018
RomiChess	Jan 2, 2018
Shogi	Feb 19, 2018
Steve Maughan	Jan 31, 2018
Stockfish	Apr 7, 2018
Test-Positions	Feb 25, 2018
Thomas Hubert	Dec 7, 2017
Thore Graepel	Jan 10, 2018
Timothy Lillicrap	Dec 9, 2017
Tord Romstad	Dec 9, 2017
University of Toronto	Dec 8, 2017
Zugzwang	Dec 8, 2017

Up one Level

Alvaro Cardoso

GerdIsenberg — Fri, 12 Jan 2018 09:31:35 GMT

Home * People * Alvaro Cardoso

Alvaro Jose Povoa Cardoso,
a Portuguese checkers programmer, and author of the Portuguese checkers (Spanish checkers, classical checkers, Jogo de Damas Clássicas ^[1]) engine Profound, initially written in Powerbasic 2.1 augmented with many assembler instructions ^[2], considered as one of the strongest classical checkers engines ^[3] ^[4]. Alvaro is long term member in CCC.

Forum Posts

2000 ...

Using just Upperbounds and Lowerbounds by Alvaro Jose Povoa Cardoso, CCC, February 01, 2001 » Bound, Upper Bound, Lower Bound
Iterative deepening deep increment by Alvaro Jose Povoa Cardoso, CCC, February 27, 2001 » Iterative Deepening
Non power of two hash table sizes by Alvaro Jose Povoa Cardoso, CCC, February 18, 2002 Hash Table, Transposition Table
ALL node definition by Alvaro Jose Povoa Cardoso, CCC, February 21, 2003 » Node Types

2005 ...

DTC EGTB algorithms needed by Alvaro Jose Povoa Cardoso, CCC, August 12, 2005
History based pruning question by Alvaro Jose Povoa Cardoso, CCC, August 26, 2005 » Late Move Reductions
Counter move heuristic by Alvaro Jose Povoa Cardoso, CCC, August 30, 2005 » Countermove Heuristic
Wu / Beal retrograde analisys algorithm by Alvaro Jose Povoa Cardoso, Winboard Forum, March 10, 2007 » Retrograde Analysis ^[5]
A simple book learning method by Alvaro Cardoso, CCC, June 12, 2008 » Book Learning, Persistent Hash Table
Extensions: everywhere or near the tips? by Alvaro Cardoso, CCC, March 15, 2009 » Extensions

2010 ...

Re: questão do profound by Alvaro Cardoso, Google Groups, July 11, 2010
Extended Null-Move Reductions by Alvaro Cardoso, CCC, August 20, 2010 » Null Move Pruning, Null Move Reductions
File size for files > 4Gb by Alvaro Cardoso, CCC, May 11, 2012
MEM_LARGE_PAGES by Alvaro Cardoso, CCC, September 18, 2013 » Memory
Multithreaded LRU by Alvaro Cardoso, CCC, October 06, 2013 » Endgame Tablebases, Memory, Thread
evaluating color agnostic terms by Alvaro Cardoso, CCC, October 15, 2013 » Asymmetric evaluation

2015 ...

crafty eval cache by Alvaro Cardoso, CCC, January 01, 2016 » Crafty, Evaluation Hash Table
Neural networks for Spanish checkers and beyond by Alvaro, Game-AI Forum, January 01, 2016 » Neural Networks
AlphaGo by Alvaro, Game-AI Forum, January 29, 2016 » AlphaGo
LMR problems by Alvaro Cardoso, CCC, May 16, 2016 » Late Move Reductions
Unordered moves phenomenon by Alvaro Cardoso, CCC, October 03, 2017 » Move Ordering
Is chess still 99% tactics? by Alvaro Cardoso, CCC, January 11, 2018 » Tactics

External Links

Alvaro Cardoso - YouTube
Apresentação de Profound, software para jogar damas classicas, YouTube Video

References

^ Jogo de Damas Clássicas - Checkers & Draughts Wiki
^ Re: Board Representation. Any strong chess engine uses this method? by Alvaro Jose Povoa Cardoso, CCC, March 08, 2006
^ João Guerra (2011). Classical Checkers. Masters thesis, Technical University of Lisbon, pdf, pp. 5
^ Programas de Damas Clásicas (Galician)
^ Ren Wu, Don Beal (2001). Fast, Memory-efficient Retrograde Algorithms. ICGA Journal, Vol. 24, No. 3

What links here?

Page	Date Edited
Alvaro Cardoso	Jan 12, 2018
Asymmetric evaluation	Nov 17, 2016
Book Learning	Jan 1, 2017
Bound	Jan 25, 2017
Checkers	Dec 23, 2017
Chess	Jan 21, 2018
Countermove Heuristic	Oct 1, 2017
Crafty	Jan 28, 2018
Don Beal	Jul 27, 2017
Endgame Tablebases	Mar 6, 2018
Evaluation Hash Table	Dec 4, 2016
Extensions	Apr 19, 2018
Go	Jan 24, 2018
Hash Table	Jan 1, 2018
Iterative Deepening	Jun 23, 2017
Knowledge	Jul 22, 2017
Late Move Reductions	Sep 25, 2017
Lower Bound	Jan 24, 2017
Memory	Dec 8, 2017
Move Ordering	Feb 27, 2018
Neural Networks	Mar 12, 2018
Node	Jul 20, 2015
Node Types	Oct 22, 2017
Null Move Pruning	Dec 2, 2017
Null Move Pruning Test Results	May 16, 2015
Null Move Reductions	Jun 22, 2015
People	Feb 28, 2018
Persistent Hash Table	Dec 31, 2017
Ren Wu	Jul 23, 2017
Retrograde Analysis	Mar 21, 2017
Tactics	Jan 12, 2018
Thread	Apr 22, 2018
Transposition Table	Apr 19, 2018
Upper Bound	Jan 24, 2017
Zobrist Hashing	Jan 22, 2018

Up one level

Arduino

GerdIsenberg — Wed, 21 Feb 2018 15:03:53 GMT

Home * Hardware * Arduino

		Arduino, (due to a legal dispute, since 2015 it is known as Genuino outside the United States ^[1]) a family of open-source hardware single-board microcontrollers based on the Atmel 8-bit AVR RISC chips ^[2] . An important aspect of the Arduino is the standard way that connectors are exposed, allowing the CPU board to be connected to a variety of interchangeable add-on modules known as shields ^[3] . Some shields communicate with the Arduino board directly over various pins, but many shields are individually addressable via an I²C serial bus, allowing many shields to be stacked and used in parallel ^[4] . This page focuses on two boards with concrete computer chess applications.
Arduino Mega ^[5]

Arduino Uno

The Arduino Uno is based on the 8-bit ATmega328 running at 16 MHz with 32 KiB ISP Flash memory with read-while-write capabilities, 1 KiB EEPROM, and 2 KiB SRAM. It has 14 digital input/output pins and six analog inputs and USB connection.

Arduino Mega

The 2009 released Arduino Mega uses the 8-bit ATmega1280 ^[6] , also running at 16 MHz, but with 128 KiB of Flash memory which 4 KiB used by bootloader, 8 KiB SRAM, and 4 KiB EEPROM. Arduino Mega has 54 digital input/output pins, 16 analog inputs, 4 UARTs, and USB connection. Its 2010 successor, the Arduino Mega 2560 ^[7] features the more advanced ATmega2560 ^[8] with 256 KiB Flash memory.

Development

Arduino provides an integrated development environment running on a host computer, supporting the C/C++ based Arduino language ^[9] . Software written using Arduino language are called sketches, and undergoes minor changes like automatic generation of function prototypes during the build process, and then passed directly to a C/C++ compiler. All standard C and C++ constructs supported by AVR-g++ should work in Arduino. Alternatively, one may compile programs for the Arduino using AVR development tools, which requires configuration to link against the appropriate files in the Arduino core libraries ^[10] .

Computer Chess

Arduino controllers are suitable to build a dedicated chess computer - to control a self-made sensory board ^[11], or even to run small chess programs.

Chess Programs

Micro-Max by Harm Geert Muller was aleady ported for the Atmel-ATmega88 by Andre Adrian ^[12] , and is also available as ATM18 mini chess computer ^[13] from the electronics magazine Elektor. Óscar Toledo Gutiérrez' program Toledo Nanochess seems appropriate for the Arduino boards as well ^[14] . Otherwise, for Uno and Mega, there are some more chess programs available, dedicated and emulated.

Little Rook Chess

Little Rook Chess by Oliver Kraus is a chess game for using the Arduino Uno with a dedicated user interface realized with an Electronic Assembly DOG LCD module ^[15] and button shield. Little Rook Chess is part of the u8glib library (Universal 8bit Graphics Library) ^[16] under the terms of the new bsd license ^[17].

MicroChess

Obsolescence Guaranteed ^[18] has ported the original 6502 MicroChess, wrapped in a 6502 emulator, to the Arduino ^[19]. A further development is the KIM Uno ^[20], a calculator-sized KIM-1 replica with MicroChess built in. Both projects are open source software/hardware using the MicroChess source code (which is available but not open source) with permission from Peter Jennings.

Myopic

Myopic by Steven Edwards is suited for the Arduino Mega, written in C++ and released under the Creative Commons license ^[21] .

myopic.tar
- Details
- Download
- 732 KB

Chess Robot

The Arduino Due Chess Robot is a self build sensory board with robot arm by Chris Quayle as a hobby project - powered by an Arduino Due and incorporating Micro-Max by Harm Geert Muller as chess AI.

Square Off

Square Off, the dedicated robot sensory board features an Arduino Mega with ATmega 2560 chip to control the piece moving two axis robotic arm, to detect piece movement, and to communicate with a smartphone via Bluetooth ^[22].

Analog Evaluation

Reading the 10-bit analog-to-digital converter, adequately supplied by a score voltage of a noisy analog leaf evaluation with some discrete analog circuits and op-amps takes about 100 microseconds and is likely too slow for that interesting application ^[23] .

Forum Posts

Arduino on Linux by erich, Arduino Forum, October 11, 2005
Chess for the Arduino by chessplayer, Arduino Forum, December 06, 2009 » Myopic
Myopic, a new Creative Commons chess program by Steven Edwards, CCC, May 22, 2010 » Myopic
Nanochess auf avr by Sam, Mikrocontroller.net GCC Forum, February 11, 2011 (German)
Re: Graphic LCD shield with EA DOGS102W display by Oliver Kraus, Arduino Forum, June 18, 2011
My Arduino-Based 6502 Simulation/Emulation...thing? by halkun, 6502.org Forum, November 26, 2012
KIM Uno: a KIM-1 emulator on an Arduino Uno by Oscar, Vintage Computer Forum, June 21, 2014
Poll: Arduino Uno Tournament by David Eather, CCC, August 15, 2014
Chess Mate Arduino chess computer via Hackaday by Steven Edwards, CCC, December 08, 2015 ^[24]
My chess robot project using Micromax chess on Arduino by Chris Quayle, CCC, August 06, 2017 » Arduino Due Chess Robot

External Links

Arduino

Computer Chess

Arduino & Raspberry PI Chess Computer running Stockfish on Raspberry Pi, by Max Dobres » Sensory Board
Little Rook Chess - Library for the Dogm-Graphics-LCD modules (AVR, Arduino compatible) - Google Project Hosting, by Oliver Kraus
chess.c - dogm128 - Library for the Dogm-Graphics-LCD modules (AVR, Arduino compatible) - Google Project Hosting
Use this Open Source Lib to play Chess with Arduino by Giorgos Lazaridis, PCB Heaven, October 14, 2014 » Micro-Max
Chessuino by Diego Cueva, based on Micro-Max by Harm Geert Muller, ported for the Atmel-ATmega88 by Andre Adrian
CHESSuino = Chess + Arduino, YouTube Video
Wireless Arduino Powered Chess, YouTube Video
Arduino Due Chess Robot by Chris Quayle » Arduino Due Chess Robot
Arduino Blog » Square Off is a chess board with a high-tech twist, October 17, 2016 » Square Off

Development

Assembly

C, C++

Java

Misc

References

^ Arduino from Wikipedia
^ Arduino - Getting Started
^ Arduino - Products
^ Arduino from Wikipedia
^ Image by David Mellis, July 12, 2010, hosted at Flickr, Arduino from Wikipedia
^ Atmel - ATmega1280
^ Arduino Mega 2560 Rev3
^ ATmega2560 - 8-bit AVR Microcontrollers
^ Arduino - Reference
^ Arduino - FAQ
^ Arduino & Raspberry PI Chess Computer running Stockfish on Raspberry Pi, by Max Dobres
^ Self-made Chess Computer SHAH based on an Atmel-ATmega88 Microcontroller and Micro-Max-port by Andre Adrian (German)
^ ATM18 Mini Chess Computer from ELEKTOR.com – Platform for electronics and microcontrollers
^ Nanochess auf avr by Sam, Mikrocontroller.net GCC Forum, February 11, 2011 (German)
^ ELECTRONIC ASSEMBLY : LCD DOG series, flexibe, flat and colorful
^ little_rook_chess · olikraus/u8glib Wiki · GitHub
^ u8glib/license.txt at master · olikraus/u8glib · GitHub
^ Obsolescence Guaranteed Home
^ 6502 Microchess on an Arduino
^ KIM Uno
^ Myopic, a new Creative Commons chess program by Steven Edwards, CCC, May 22, 2010
^ Arduino Blog » Square Off is a chess board with a high-tech twist, October 17, 2016
^ Arduino - AnalogRead
^ Chess Mate • Hackaday.io

What links here?

Page	Date Edited
6502	Dec 25, 2017
Analog Evaluation	Oct 27, 2017
Arduino	Feb 21, 2018
Dedicated Chess Computers	Feb 20, 2018
Hardware	Jan 20, 2018
KIM-1	Oct 9, 2014
Little Rook Chess	Sep 1, 2015
Max Dobres	Sep 21, 2016
Micro-Max	Aug 7, 2017
MicroChess	Jul 14, 2015
Myopic	Nov 11, 2016
Oliver Kraus	Oct 16, 2015
pcDuino	Sep 10, 2014
Raspberry Pi	Jun 7, 2017
Robots	Feb 20, 2018
Sensory Board	Mar 1, 2018
Square Off	Feb 21, 2018
Steven Edwards	Aug 26, 2017
Stockfish	Apr 7, 2018
UDOO	Oct 27, 2017
USB Chess Board	Apr 21, 2015

Up one Level

Artem Petakov

GerdIsenberg — Sat, 14 Jan 2017 22:55:54 GMT

Home * People * Artem Petakov

		Artem Petakov, (Artem Pyatakov) an Ukrainian born, American computer scientist, software engineer, and co-founder and president at Noom Inc. ^[1] (formerly WorkSmart Labs ^[2]), offering mobile apps that promote healthy living by monitoring the progress of its users, and providing advice on weight management ^[3]. He was previously affiliated with Google Inc., where he founded and later led the GeoSearch project on Google Maps, the Free University of Berlin, where he was successfully involved in their RoboCup project, Sun Microsystems, optimizing x86 execution in Solaris Kernel 10, and Microsoft as member the SQL server team ^[4]. Artem Petakov holds a Bachelor of Art from Princeton University, where he studied computer science, finance, and theater from 2000 to 2004, and also took Daniel Kanheman's psychology of decision making class ^[5]. His CS interests at that time were artificial intelligence, machine learning, and hardware and processor related topics, such as memory access and branch predictor, and their considerations in compiler optimization. During his freshman year at Princeton, he had written a chess engine which played under the handle Golch at ICC ^[6], and was also test-bed for his senior thesis Improving Computer Chess through Machine Learning ^[7] under advisor Robert Schapire ^[8].
Artem Petakov ^[9]

Selected Publications

Selected Publications

^[10]

Artem Pyatakov (2004). Improving Computer Chess through Machine Learning. Senior thesis, Princeton University, advisor Robert Schapire
Qiang Wu, Artem Pyatakov, Alexey Spiridonov, Easwaran Raman, Douglas W. Clark, David I. August (2004). Exposing Memory Access Regularities Using Object-Relative Memory Profiling. CGO 2004, pdf

Forum Posts

2001

Pattern matching and chess by Artem Pyatakov, comp.ai.games, June 20, 2001
Automatic Eval Tuning by Artem Pyatakov, CCC, June 29, 2001 » Automated Tuning
Fastest Conversion from 0x88 board to 8x8 board representation by Artem Pyatakov, CCC, July 06, 2001 » 0x88
Question about Gerbil by Artem Pyatakov, CCC, July 11, 2001 » Gerbil
Bitfields and Crafty by Artem Pyatakov, CCC, July 11, 2001 » C, Crafty
Static Exchange Eval by Artem Pyatakov, CCC, August 02, 2001 » Static Exchange Evaluation

2004

Artificial Intelligence in Computer Chess by Artem Pyatakov, CCC, March 28, 2004 » Artificial Intelligence
Re: Artificial Intelligence in Computer Chess - *DETAILS* as promised by Artem Pyatakov, CCC, March 28, 2004 » History Heuristic
Two questions: Bratko Kopec and variations on the killer heuristic by Artem Pyatakov, CCC, March 31, 2004 » Bratko-Kopec Test
Killer modifications reduced tree size by 8% (with identical results) by Artem Pyatakov, CCC, March 31, 2004 » Killer Heuristic
Help, please: best description of a modern chess program by Artem Pyatakov, CCC, April 01, 2004

External Links

References

What links here?

Page	Date Edited
0x88	Nov 28, 2016
Artem Petakov	Jan 14, 2017
Artificial Intelligence	Apr 9, 2018
Automated Tuning	Feb 27, 2018
Bratko-Kopec Test	Jun 1, 2015
Free University of Berlin	Jan 20, 2018
Gerbil	Feb 3, 2017
Golch	Dec 7, 2017
History Heuristic	Jul 19, 2017
Killer Heuristic	Sep 14, 2017
Memory	Dec 8, 2017
People	Feb 28, 2018
SEE - The Swap Algorithm	Jun 5, 2017
Static Exchange Evaluation	Dec 14, 2017

Up one Level

Artificial Intelligence

GerdIsenberg — Mon, 09 Apr 2018 18:50:33 GMT

Home * Artificial Intelligence

		Artificial Intelligence, (AI) the intelligence of machines and the branch of computer science that aims to create it. While 'machine intelligence' was already mentioned by Alan Turing in the 1940s during his research at Bletchley Park ^[1] ^[2] , the term 'artificial intelligence' was coined by John McCarthy in the proposal for the 1956 Dartmouth Conference ^[3] . In its beginning, Computer Chess was called the Drosophila of Artificial Intelligence. In the 70s, when brute-force programs started to dominate, and competitive and commercial aspects have taken precedence over using chess as a scientific domain, the AI community more and more lost interest in chess ^[4] . In disagreement with the AI establishment in the 80s, Peter W. Frey concluded, that the AI community should follow computer chess methods rather than the other way around ^[5] .
Bernd Besser, computerzeitalter ^[6]

Drosophila of AI

Donald Michie

Quote from I remember Donald Michie by Maarten van Emden ^[7] :


`In the 1970s DM was fond of proclaiming “Chess, the Drosophila Melanogaster of Artificial Intelligence”. A public pronouncement of his point of view can be found in an interview with H.J. van den Herik held in 1981 (“Computerschaak, schaakwereld en kunstmatige intelligentie” by H.J. van den Herik, Academic Service, 1983)` ^[8] `. It is a long interview, from which I quote DM’s answer to the question: “What do you think about the applicability of the research done in computer chess?”`
			The applicability is I think enormous and quite critical. Scientific study of computer chess, which includes the technological work, but goes far beyond that, is the most important scientific study that is going in the world at present. In the same sense, if I were asked what was the most important study in process during the first world war, I would say the genetic breeding experiments on the drosophila fruit fly by Morgan and his colleagues. The analogy is very good. The final impact of the early work in laying down the basic theoretical framework for the subject was just enormous, unimaginable. We see now the industrial take-off of genetic engineering which is the delayed final outcome for human society of the fly-breeding work. The use of chess now as a preliminary to the knowledge engineering and cognitive engineering of the future is exactly similar, in my opinion, to the work on drosophila. It should be encouraged in a very intense way, for these reasons.

John McCarthy

Quote by John McCarthy from What is Artificial Intelligence? ^[9] ^[10] ^[11]:

Alexander Kronrod, a Russian AI researcher, said 'Chess is the Drosophila of AI.' He was making an analogy with geneticists' use of that fruit fly to study inheritance. Playing chess requires certain intellectual mechanisms and not others. Chess programs now play at grandmaster level, but they do it with limited intellectual mechanisms compared to those used by a human chess player, substituting large amounts of computation for understanding. Once we understand these mechanisms better, we can build human-level chess programs that do far less computation than do present programs. Unfortunately, the competitive and commercial aspects of making computers play chess have taken precedence over using chess as a scientific domain. It is as if the geneticists after 1910 had organized fruit fly races and concentrated their efforts on breeding fruit flies that could win these races.

Anthony Cozzie

Anthony Cozzie in a forum discussion about McCarthy's statement ^[12] ^[13] :

First, the author of this quote is simple WRONG. The generally accepted theory of how humans play chess is that the brain does fuzzy matching on a database of several hundred thousand positions. The amount of computation needed to do that is FAR greater than the amount expended by a "conventional" AB searcher, and yet the computer plays MUCH better than the average human. The simple fact of the matter, which you refuse to recognize, is that AB-search with reasonable heuristics is the most efficient way to play chess with Von Neuman machines.

Secondly, the existence of current amateur and commercial programs does nothing to prevent you from writing whatever kind of chess playing agent you want. If you want to experiment, no one is stopping you or him from applying to NSF for research money and giving it a shot. The existence of "fruit fly races" - and his fruit fly analogy is totally flawed. A better analogy would be that a geneticist decided to make a fruit fly that could run faster than a human - does nothing to prevent casual study of one's own fruit flies.

Heuristic Programming

Remembering Kronrod

Quote from Remembering A.S. Kronrod by Evgenii Landis and Isaak Yaglom ^[14]:

Only in 1955 did a real opportunity arise for A.S. Kronrod to work with an electronic computer. It was the M2 computer constructed by I.S. Bruk, M.A. Kartsev, and N.Ya. Matyukhin in the laboratory of the Institute of Energy named after Krzhizhanovsky and directed by I.S. Bruk. This laboratory later became the to Institute for Electronic Control Machines. The mathematics/machine interface was developed by A.L. Brudno, a great personal and likeminded friend of A.S. Kronrod.

When he started with enthusiasm to program the M2 machine, A.S. Kronrod quickly came to the conclusion that computing is not the main application of computers. The main goal is to teach the computer to think, i.e., what is now called "artificial intelligence" and in those days "heuristic programming".

A.S. Kronrod captivated a large group of mathematicians and physicists (G.M. Adelson Velsky, A.L. Brudno, M.M. Bongard, E.M. Landis, N.N. Konstantinov, and others). Although some of them had arrived at this kind of problems on their own, they unconditionally accepted his leadership. In the room next to the one housing the M2 machine the work of the new Kronrod seminar started. At the gatherings there were heated discussions on pattern recognition problems (this work was led by M.M. Bongard; versions of his program "Kora" are still functioning), transportation problems (the problem was introduced to the seminar and actively worked on by A.L. Brudno), problems of automata theory, and many other problems.

Intellectual Foundations

Quote from Biography AS Kronrod by Alexander Yershov ^[15]

In 1958, Kronrod, Adelson-Velsky, and Landis selected "Snap" ("подкидного дурака") as the intellectual foundations for the development of the game heuristic programming. The program itself was a fiasco - but the basic principles (board games, search techniques and limited depth) were formulated. Further research laboratories in the field of game theory culminated in the first ever chess duel between the program of the Institute of Soviet and American best program developed at Stanford University under the direction of J. McCarthy. By telegraph match was played in four games ended 3-1 in favor of our institute. At the time, chess became a guinea pig for all programmers interested in artificial intelligence.

The 12th IJCAI

In a panel discussion at the 12th International Joint Conference on Artificial Intelligence, Robert Levinson, Feng-hsiung Hsu, Tony Marsland, Jonathan Schaeffer, and David Wilkins commented on the relationship between computer chess and AI research ^[16] . As pointed out by Peter W. Frey, many emphasized the discrepancy between both domains and seemed to lament the inferiour status of the work of computer chess - some excerpts quoted by Frey in his Computer Chess vs. AI paper ^[17] .

Jonathan Schaeffer

Sadly, most of the work currently being done on computer chess programs is engineering, not science. For example, the engineering of special-purpose VLSI chips to increase the speed of a chess program only underlines the importance chess programmers attach to speed. In my opinion, conventional computer-chess methods will yield little of further interest to the AI community.

Tony Marsland

Pruning by analogy is a powerful general-purpose tool and if developed satisfactorily for a perfect information game like chess would almost certainly be applicable to related decision-tree searches...

It is remarkable that no significant improvement has been made to that method, despite the passage of 15 years. Not even attempts to implement simple forms of the idea in serious chess programs.

Robert Levinson

Psychological evidence indicates that human chess players search very few positions, and base their positional assessments on structural/perceptual patterns learned through experience.

The main objectives of the project are to demonstrate capacity of the system to learn, to deepen our understanding of the interaction of knowledge and search, and to build bridges in this area between AI and cognitive science.

David Wilkins

Hardware advances have made chess a less fertile ground for addressing the basic issues of AI. The game is small enough that brute-force search techniques have dominated competitive computer chess, and I see little AI interest in squeezing out the last few hundred points on the chess ratings.

AI as Sport

John McCarthy from AI as Sport, 1997 ^[18] , in a review of Monty Newborn's Deep Blue vs. Kasparov ^[19] :

Now that computers have reached world-champion level, it is time for chess to become a Drosophila again. Champion-level play is possible with enormously less computation than Deep Blue and its recent competitors use. Tournaments should admit programs only with severe limits on computation. This would concentrate attention on scientific advances. Perhaps a personal computer manufacturer would sponsor a tournament with one second allowed per move on a machine of a single design. Tournaments in which players use computers to check out lines of play would be man-machine collaboration rather than just competition.

Besides AI work aimed at tournament play, particular aspects of the game have illuminated the intellectual mechanisms involved. Barbara Liskov demonstrated that what chess books teach about how to win certain endgames is not a program but more like a predicate comparing two positions to see if one is an improvement on the other. Such qualitative comparisons are an important feature of human intelligence and are needed for AI. Donald Michie, Ivan Bratko, Alen Shapiro, David Wilkins, and others have also used chess as a Drosophila to study intelligence. Newborn ignores this work, because it is not oriented to tournament play.

Making Computer Chess Scientific

A further note by John McCarthy from Making Computer Chess Scientific ^[20] :

AI has two tools for tackling problems. One is to use methods observed in humans, often observed only by introspection, and the other is to invent methods using ideas of computer science without worrying about whether humans do it this way. Chess programming employs both. Introspection is an unreliable way of determining how humans think, but introspectively suggested methods are valid as AI if they work.

Much of the mental computation done by chess players is invisible to the player and to outside observers. Patterns in the position suggest what lines of play to look at, and the pattern recognition processes in the human mind seem to be invisible to that mind. However, the parts of the move tree that are examined are consciously accessible.

It is an important advantage of chess as a Drosophila for AI that so much of the thought that goes into human chess play is visible to the player and even to spectators. When chess players argue about what is the right move in a position, they follow out lines of play, i.e. argue explicitly about parts of the move tree. Moreover, when a player is found to have made a mistake, it is almost always a failure to follow out a certain line of play rather than a misevaluation of a final position.

Go, the new Drosophila of AI

A quote by Gian-Carlo Pascutto on AI in Go and Chess ^[21] :

There is no significant difference between an alpha-beta search with heavy LMR and a static evaluator (current state of the art in chess) and an UCT searcher with a small exploration constant that does playouts (state of the art in go).

The shape of the tree they search is very similar. The main breakthrough in Go the last few years was how to backup an uncertain Monte Carlo score. This was solved. For chess this same problem was solved around the time quiescent search was developed.

Both are producing strong programs and we've proven for both the methods that they scale in strength as hardware speed goes up.

So I would say that we've successfully adopted the simple, brute force methods for chess to Go and they already work without increases in computer speed. The increases will make them progressively stronger though, and with further software tweaks they will eventually surpass humans.

Poker, the next Challenge

Graham Kendall and Jonathan Schaeffer on Poker ^[22] :

For many years Chess (and perhaps more recently Go) has served as the Drosophila of AI research. Decades of research culminated in the defeat of Garry Kasparov by DEEP BLUE in May 1997. There is still an active research community that uses Chess as a test-bed for AI research (as seen in this journal), but the game is limited in the types of challenges that it can offer to the AI researcher. Being a game of perfect information (both players know the full state of the game at any given point) with a relatively small branching factor, researchers have reduced the challenge of building a strong AI for Chess to merely one of deep brute-force search. The research challenges are to create a good evaluation function, and to design an effective search algorithm. This “solution” to Chess is unappealing to many AI purists. Nevertheless, alternative AI approaches have been largely ineffective.

Poker, as an experimental test-bed for exploring AI, is a much richer domain than Chess (and Go).

Imperfect information. Parts of the game state (opponent hands) are not known.
Multiple players. Many popular poker variants can be played with up to 10 players.
Stochastic. The dealing of the cards adds a random element to the game.
Deception. Predictable play can be exploited by an opponent. Hence, deceptive play is an essential ingredient of strong play (e.g., bluffing).
Opponent modelling. Observing your opponent(s) and adjusting your play to exploit (perceived) opponent tendencies is necessary to maximize poker winnings.
Information sparsity. Many poker hands end in the players not revealing their cards. This limits the amount of data available to learn from.

Bill Gates on AI

Remark by Bill Gates on the 17. IJCAI 2001, Seattle, Washington, USA, August 7, 2001 ^[23] :

Microsoft was founded about 25 years ago, and I can remember at the time thinking, "Well, if I go out and do this really commercial stuff, I’m going to miss these big advances in AI that will be coming very soon." (Laughter.) And so I come from the school of AI optimist. You know, I can remember being at Harvard and back then AI was the Greenblatt Chess Program and Maxima and Eliza and people literally felt that within five to ten years that some of these tough problems would be solved.

Subfields

Selected Publications

1945 ...

Vannevar Bush (1945). As We May Think. The Atlantic Monthly, July 1945, pdf from The Computer History Museum
Claude Shannon (1949). Programming a Computer for Playing Chess. pdf from The Computer History Museum

1950 ...

Alan Turing (1950). Computing Machinery and Intelligence. Mind, 59, 433-460. pdf from The Computer History Museum
Paul I. Richards (1951). Machines which can learn. American Scientist, 39:711-716
Paul I. Richards (1952). On Game Learning Machines. The Scientific Monthly, Vol. 74, No. 4, April 1952
Marvin Minsky (1954). Neural Nets and the Brain Model Problem. Ph.D. dissertation, Princeton University

1955 ...

John McCarthy, Marvin Minsky, Nathaniel Rochester, Claude Shannon (1955). A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence.
Allen Newell (1955). The Chess Machine: An Example of Dealing with a Complex Task by Adaptation. Proceedings Western Joint Computer Conference, pp. 101-108. Reprinted (1988) in Computer Chess Compendium
Frank Rosenblatt (1957). The Perceptron - a Perceiving and Recognizing Automaton. Report 85-460-1, Cornell Aeronautical Laboratory ^[24]
Allen Newell, Cliff Shaw, Herbert Simon (1958). Chess Playing Programs and the Problem of Complexity. IBM Journal of Research and Development, Vol. 4, No. 2, pp. 320-335. Reprinted (1963) in Computers and Thought (eds. Edward A. Feigenbaum and Julian Feldman), pp. 39-70. McGraw-Hill, New York, N.Y. pdf
John McCarthy (1959). Programs with Common Sense, pdf
Allen Newell, Cliff Shaw, Herbert Simon (1959). Report on a general problem-solving program. Proceedings of the International Conference on Information Processing, pp. 256-264 ^[25]
Woodrow W. Bledsoe, Iben Browning (1959). Pattern Recognition and Reading by Machine. In Proceedings of the Eastern Joint Computer Conference

1960 ...

John D. Williams (1960). Toward Intelligent Machines. RAND Corporation, P-2170, 29 December 1960
Mortimer Taube (1961). Computers and Common Sense: The Myth of Thinking Machines. Columbia University Press
Marvin Minsky (1961). Steps Toward Artificial Intelligence. Proc IRE, 49, pp. 8-30. Reprinted (1963) in Computers and Thought (eds. Edward A. Feigenbaum and Julian Feldman), pdf
John Maynard Smith, Donald Michie (1961). Machines that play games. New Scientist, 12, 367-9. ^[26]
Frank Rosenblatt (1962). Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanisms. Spartan Books
Edward Feigenbaum, Julian Feldman (eds.) (1963). Computers and Thought. McGraw-Hill, New York, N.Y.
Howard H. Campaigne (1964). Time Is - Time Was - Time Is Past. Computers for Intelligence. pdf from the National Security Agency

1965 ...

Hubert L. Dreyfus (1965). Alchemy and Artificial Intelligence. Rand Paper.
Jack Good (1965). Speculations Concerning the First Ultraintelligent Machine. Advances in Computers, Vol. 6, pdf, pdf
Ray Solomonoff (1966). Some Recent Work in Artificial Intelligence. Proc. of the IEEE, pdf
Marvin Minsky, Seymour Papert (1969). Perceptrons. ^[27] ^[28]
Herbert Simon (1969). The Sciences of the Artificial. The MIT Press, 1st Edition

1970 ...

Mikhail Botvinnik (1970). Computers, Chess and Long-Range Planning. Springer-Verlag, New York.
James R. Slagle (1971). Artificial Intelligence: The Heuristic Programming Approach. McGraw-Hill
Nils J. Nilsson (1971). Problem Solving Methods in Artificial Intelligence. McGraw-Hill
Nicholas V. Findler, Bernard Meltzer (eds.) (1971). Artificial Intelligence and Heuristic Programming. Edinburgh University Press, ISBN 0-85224-199-2
Marvin Minsky, Seymour Papert (1972). Perceptrons: An Introduction to Computational Geometry. The MIT Press, 2nd edition with corrections
Hubert L. Dreyfus (1972, 1979, 1991). What Computers Can't Do.
Oscar Firschein, Martin A. Fischler, L. Stephen Coles, Jay M. Tenenbaum (1973). Forecasting and Assessing the Impact of Artificial Intelligence on Society. 3. IJCAI, Stanford, California
Donald Michie (1974). On Machine Intelligence. Edinburgh: University Press, abebooks.com, alibris.com, biblio.com

1975 ...

John Henry Holland (1975). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. amazon.com
A. Harry Klopf (1975). A Comparison of Natural and Artificial Intelligence. ACM SIGART Bulletin, No. 52
Allen Newell, Herbert Simon (1976). Computer Science as Empirical Inquiry: Symbols and Search. Communications of the ACM, Vol. 19, No. 3, ACM Turing Award Lecture, pdf from The Computer History Museum ^[29]
Donald Michie (1976). AL1: a package for generating strategies from tables. ACM SIGART Bulletin, No. 59
Donald Michie (1976). An Advice-Taking System for Computer Chess. Computer Bulletin, Ser. 2, Vol. 10, pp. 12-14. ISSN 0010-4531.
Azriel Rosenfeld, Jerome A. Feldman, Laveen N. Kanal, Patrick H. Winston (1977). AI and Pattern Recognition. IJCAI 1977
Ivan Bratko (1979). Implementing Search Heuristics using the AL1 Advice-Taking System. Proc. Sixth Int. Joint Conf. on Art. Intell., pp. 95-97.
Alan H. Bond (1979). An Approach to Artificial Intelligence. pdf

1980 ...

Allen Newell (1980). Physical Symbol Systems. Cognitive Science, Vol. 4, No. 2
Mikhail Botvinnik, Boris Stilman, Alexander Yudin, Alexander Reznitskiy, Michael Tsfasman (1980). Thinking of Man and Computer, Proc. of the Second International Meeting on Artificial Intelligence, pp. 1-9, Repino, Leningrad, Russia
David Wilkins (1980). Using patterns and plans in chess. Artificial Intelligence, vol. 14, pp. 165-203. Reprinted (1988) in Computer Chess Compendium
Marvin Minsky (1980). K-Lines: A Theory of Memory. Cognitive Science 4, 117-133, pdf ^[30]
Hans Berliner (1981). An Examination of Brute Force Intelligence. Proceedings of IJCAI 81, Vancouver, pp. 581-587, Vancouver. pdf
Avron Barr, Edward Feigenbaum (eds.) (1981). The Handbook of Artificial Intelligence. Vol. 1, HeurisTech Press
Avron Barr, Edward Feigenbaum (eds). (1982). The Handbook of Artificial Intelligence. Vol. 2, HeurisTech Press
Paul Cohen, Edward Feigenbaum (eds.) (1982). The Handbook of Artificial Intelligence. Vol. 3, HeurisTech Press
Donald Michie (1982). Chess with computers. Machine Intelligence and Related Topics. Gordon and Breach Science
Dana S. Nau, Vipin Kumar, Laveen N. Kanal (1982). A General Paradigm for A.I. Search Procedures. AAAI 1982
Marek Perkowski, Andrzej Goralski, Gerard Zieliński (1982). Elements of Artificial Intelligence. Institute of Automatic Control, Warsaw University of Technology
A. Harry Klopf (1982). The Hedonistic Neuron: A Theory of Memory, Learning, and Intelligence. Hemisphere Publishing Corporation, University of Michigan
Danny Kopec, Donald Michie (1983). Mismatch between machine representations and human concepts: dangers and remedies. FAST series No. 9 report. European Community, Brussels.
Ryszard Michalski, Jaime Carbonell, Tom Mitchell (1983). Machine Learning: An Artificial Intelligence Approach. Tioga Publishing Company, google books

1985 ...

Ryszard Michalski, Jaime Carbonell, Tom Mitchell (1985). Machine Learning: An Artificial Intelligence Approach. Morgan Kaufmann, google books
Hermann Kaindl (1985). What Happened with AI's Drosophila? ÖGAI 1985: 194-203
Chin-Liang Chang (1985). Introduction to Artificial Intelligence Techniques. JMA Press, Open Library
Judith V. Grabiner (1986). Computers and the Nature of Man: A Historian's Perspective of Controversies about Artificial Intelligence. Bulletin of the American Mathematical Society, Vol. 15, No. 2, pdf
Ryszard Michalski, Jaime Carbonell, Tom Mitchell (1986). Machine Learning: An Artificial Intelligence Approach, Volume II. Morgan Kaufmann, google books
Herbert Simon (1986). Whether Software Engineering Needs to Be Artificially Intelligent. IEEE Transactions on Software Engineering, Vol. 12, No. 7
John E. Laird, Allen Newell, Paul S. Rosenbloom (1987). SOAR: An Architecture for General Intelligence. Artificial Intelligence, Vol. 33, No. 1
Christopher Chabris (1987). Artificial Intelligence and Turbo Pascal - Book and Disk. Irwin Professional Pub, amazon.com » Turbo Pascal
Marvin Minsky (1988). Why People Think Computers Can't. MIT
Marvin Minsky (1988). Society of Mind. Simon & Schuster
David E. Goldberg (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, from amazon.com
Mikhail Donskoy, Jonathan Schaeffer (1989). Perspectives on Falling from Grace. Workshop on New Directions in Game-Tree Search, pdf, revised version published (1990). in Computers, Chess, and Cognition

1990 ...

John McCarthy (1990). Chess as the Drosophila of AI. Computers, Chess, and Cognition, pp. 227-237 ^[31]
Mikhail Donskoy, Jonathan Schaeffer (1990). Perspectives on Falling from Grace. Computers, Chess, and Cognition
Yves Kodratoff, Ryszard Michalski (1990). Machine Learning: An Artificial Intelligence Approach, Volume III. Morgan Kaufmann, google books
Richard Fikes (1990). AI and Software Engineering - Managing Exploratory Programming. AAAI 1990
Nicholas V. Findler (1990). Contributions to a Computer-Based Theory of Strategies. Springer

1991

Herbert Simon (1991). Artificial Intelligence: Where Has It Been, Where is it Going? IEEE Transactions on Knowledge and Data Engineering, Vol. 3, No. 2
Robert Levinson, Feng-hsiung Hsu, Tony Marsland, Jonathan Schaeffer, David Wilkins (1991). The Role of Chess in Artificial Intelligence Research. IJCAI 1991, pdf, also in ICCA Journal, Vol. 14, No. 3, pdf
Peter W. Frey (1991). Memory-Based Expertise: Computer Chess vs. AI. ICCA Journal, Vol. 14, No. 4
Dinesh Gadwal, Jim Greer, Gordon McCalla (1991). UMRAO: A Chess Endgame Tutor. ARIES Laboratory, Department of Computational Science, University of Saskatchewan, IJCAI-91, pdf
Robert W. Howard (1991). All about Intelligence: Human, Animal, and Artificial. New South Wales University Press Ltd, amazon.com

1992

Patrick Winston (1992) Artificial Intelligence. (third Edition)
Peter Norvig (1992). Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp. Morgan Kaufmann

1993

Helmut Horacek (1993). Computer Chess, its Impact on Artificial Intelligence. ICCA Journal, Vol. 16, No. 1 » WCCC 1992 - Workshop
Matthew L. Ginsberg (1993). Essentials of artificial intelligence. Morgan Kaufmann Publishers
Paul S. Rosenbloom, John E. Laird, Allen Newell (1993). The SOAR Papers: Research on Integrated Intelligence. MIT Press, amazon

1994

Victor Allis (1994). Searching for Solutions in Games and Artificial Intelligence. Ph.D. Thesis, University of Limburg, pdf
Boris Stilman (1994). A Linguistic Geometry for Space Applications, Proc. of the 1994 Goddard Conference on Space Applications of Artificial Intelligence, pp. 87-101, NASA Goddard Space Flight Center, Greenbelt, MD, USA.
Ryszard Michalski, George Tecuci (1994). Machine Learning: A Multistrategy Approach, Volume IV. Morgan Kaufmann, google books
L. Stephen Coles (1994). Computer Chess: The Drosophila of AI. AI Expert, Vol. 9, No. 4, Miller Freeman, Inc., posted October 30, 2002 in Dr. Dobbs

1995 ...

Herbert Simon (1995). Explaining the Ineffable: AI on the Topics of Intuition, Insight and Inspiration. IJCAI 1995, pdf
Herbert Simon (1995). Artificial Intelligence: An Empirical Science. Artificial Intelligence, Vol. 77, No. 1
Jacques Pitrat (1995). AI Systems Are Dumb Because AI Researchers Are Too Clever. ACM Computing Surveys, Vol. 27, No. 3
Edward Feigenbaum, Julian Feldman (eds.) (1995). Computers and Thought. MIT Press
Jay Burmeister, Janet Wiles (1995). The Challenge of Go as a Domain for AI Research: A Comparison Between Go and Chess. In Proceedings of the Third Australian and New Zealand Conference on Intelligent Information Systems, IEEE Western Australia Section, pdf

1996

Herbert Simon (1996). The Sciences of the Artificial. MIT Press, 3rd Edition 1996, amazon
Edward A. Feigenbaum (1996) How the “What“ Becomes the “How“. Communications of the ACM, Vol. 39, No. 5, pdf hosted by The Computer History Museum

1997

Tony Marsland, Yngvi Björnsson. (1997). From MiniMax to Manhattan. In Deep Blue Versus Kasparov: The Significance for Artificial Intelligence. AAAI Workshop, pp. 31–36, 1997. pdf
John McCarthy (1997). Chess as the Drosophila of AI. Computer Science Department, Stanford University, condensed version of the 1990 paper, pdf
Richard Korf (1997). Does DEEP BLUE use Artificial Intelligence? ICCA Journal, Vol. 20, No. 4 ^[32]
John McCarthy (1997). AI as Sport. Science, Vol. 276
Santos Gerardo Lazzeri, Rachelle Heller (1997). Application of Fuzzy Logic and Case-Based Reasoning to the Generation of High-Level Advice in Chess. Advances in Computer Chess 8

1998

Franz-Günter Winkler, Johannes Fürnkranz (1998). A Hypothesis on the Divergence of AI Research. ICCA Journal, Vol. 21, No. 1, pdf
Toshinori Munakata (1998). Fundamentals of the New Artificial Intelligence: Beyond Traditional Paradigms. 1st edition, Springer, 2nd edition 2008

1999

Christian Jongeneel ^[33], Henk Koppelaar (1999). Gödel pro and contra AI: dismissal of the case. Engineering Applications of Artificial Intelligence, Vol. 12, No. 5

2000 ...

Bart Selman (2000). Compute-intensive Methods in Artificial Intelligence. Annals of Mathematics and Artificial Intelligence, Vol. 28, Nos. 1-4, pdf
Ivan Bratko (2001,2010). Prolog programming for artificial intelligence. Harlow England, Addison Wesley
Monroe Newborn (2002). Deep Blue: An Artificial Intelligence Milestone. Springer
Jonathan Schaeffer, Jaap van den Herik (2002). Games, computers, and artificial intelligence. Artificial Intelligence 134, pdf
Jürgen Schmidhuber (2003). The New AI:General & Sound & Relevant for Physics. Technical Report IDSIA-04-03
Eric B. Baum (2004). What is Thought? Bradford Book
Kevin Warwick (2004). March of the Machines: The Breakthrough in Artificial Intelligence. University of Illinois Press
Kevin Warwick (2004). I, Cyborg. University of Illinois Press

2005 ...

Dap Hartmann (2005). The True Holy Grail of Artificial Intelligence. ICGA Journal, Vol. 28, No. 1
David Levy (2005). Robots Unlimited: Life in a Virtual Age. AK Peters
Marcus Hutter (2005). Universal Artificial Intelligence. Sequential Decisions based on Algorithmic Probability, Springer
Pieter Spronck (2005). Adaptive Game AI. Ph.D. thesis, Maastricht University, pdf

2006

Azlan Iqbal (2006). Is Aesthetics Computable? ICGA Journal, Vol. 29, No. 1, pdf

2007

Edward Feigenbaum (2007). Happy Silver Anniversary, AI! AI Magazine, Vol. 27, No. 4
Marvin Minsky (2007). The Emotion Machine: Commonsense Thinking, Artificial Intelligence, and the Future of the Human Mind. Simon & Schuster ^[34]
David Levy (2007). Love and Sex With Robots: The Evolution of Human-Robot Relationships. Harper Collins, amazon.com

2008

Guillaume Chaslot, Sander Bakkes, István Szita, Pieter Spronck (2008). Monte-Carlo Tree Search: A New Framework for Game AI. pdf
István Szita, Marc Ponsen, Pieter Spronck (2008). Keeping Adaptive Game AI interesting. CGames 2008, pdf draft, pdf
Brian Schwab (2008). AI Game Engine Programming. Second Edition, amazon » Faile
Mark Watson (2008). Practical Artificial Intelligence Programming With Java. Third Edition, pdf ^[35] » Java
Michael Thielscher (2008). Artificial Intelligence and General Game Playing. Workshop Chess and Mathematics » General Game Playing
Toshinori Munakata (2008). Fundamentals of the New Artificial Intelligence: Neural, Evolutionary, Fuzzy and More. 2nd edition, Springer, 1st edition 1998
Brian Bloomfield, Theodore Vurdubakis (2008). IBM's Chess Players: On AI and Its Supplements. The Information Society, Vol. 24, No. 2 » Deep Blue

2009

Stuart Russell, Peter Norvig (2009). Artificial Intelligence: A Modern Approach. 3rd edition ^[36]
Jacques Pitrat (2009). Artificial Beings: The Conscience of a Conscious Machine. Wiley
Diego Rasskin-Gutman (2009). Chess Metaphors - Artificial Intelligence and the Human Mind. translated by Deborah Klosky, MIT Press ^[37]
Nils J. Nilsson (2009). The Quest for Artificial Intelligence: A History of Ideas and Achievements. Cambridge University Press
Zongmin Ma (2009). Artificial Intelligence for Maximizing Content Based Image Retrieval. Northeastern University, China
Shay Bushinsky (2009). Deus Ex Machina— A Higher Creative Species in the Game of Chess. AI Magazine, Vol. 30, No. 3 » Machine Creativity

2010 ...

Sander Bakkes (2010). Rapid Adaptation of Video Game AI. Ph.D. thesis, Tilburg University, pdf ^[38]
Pieter Spronck (2010). Adaptive Game AI. Tilburg University, pdf
Paul S. Rosenbloom (2010). An Architectural Approach to Statistical Relational AI. Statistical Relational Artificial Intelligence 2010

2011

Joel Veness (2011). Approximate Universal Artificial Intelligence and Self-Play Learning for Games. Ph.D. thesis, University of New South Wales, supervisors: Kee Siong Ng, Marcus Hutter, Alan Blair, William Uther, John Lloyd; pdf
Stephen Lucci, Danny Kopec (2011). Artificial Intelligence in the 21st Century. Mercury Learning and Information
Kevin Warwick (2011). Artificial Intelligence: The Basics. Taylor & Francis

2013

Kieran Greer (2013). Is Intelligence Artificial? arXiv:1403.1076

2014

Kieran Greer (2014). Turing: Then, Now and Still Key. arXiv:1403.2541 » Alan Turing
Danny Kopec, Shweta Shetty, Christopher Pileggi (2014). Artificial Intelligence Problems and Their Solutions. Mercury Learning and Information
Cameron Browne (2014). What Can Game AI Teach Us? ICGA Journal, Vol. 37, No. 3
Héctor Muñoz-Avila, David J. Stracuzzi (2014). Innovative Applications of Artificial Intelligence 2013. AI Magazine, Vol. 35, No. 1

2015 ...

Susan L. Epstein (2015). Wanted: Collaborative Intelligence. Artificial Intelligence, Vol. 221
Jaap van den Herik (2015). Computers and Intuition. ICGA Journal, Vol. 38, No. 4

2016

Jaap van den Herik (2016). Intuition is Programmable. Valedictory Address from Tilburg University
Azlan Iqbal, Matej Guid, Simon Colton, Jana Krivec, Shazril Azman, Boshra Haghighi (2016). The Digital Synaptic Neural Substrate: A New Approach to Computational Creativity. arXiv:1507.07058 » Machine Creativity

2017

Garry Kasparov (2017). Don’t Fear Intelligent Machines: Work with Them. ICGA Journal, Vol. 39, No. 2 ^[39]

AI Game Programming Wisdom

Steve Rabin (editor) (2002). AI Game Programming Wisdom. Charles River Media
Steve Rabin (editor) (2003). AI Game Programming Wisdom 2. Charles River Media
Steve Rabin (editor) (2006). AI Game Programming Wisdom 3. Charles River Media
Steve Rabin (editor) (2008). AI Game Programming Wisdom 4. Charles River Media

Forum Posts

chess and AI by David Deininger, rgc, April 11, 1994
Artificial Intelligence by Fernando Villegas Darroui, rgcc, May 13, 1997
Artificial Intelligence in Computer Chess by Artem Pyatakov, CCC, March 28, 2004
Re: Artificial Intelligence in Computer Chess - *DETAILS* as promised by Artem Pyatakov, CCC, March 28, 2004 » History Heuristic
Fruit fly races by Steven Edwards, CCC, April 06, 2005
what constitutes AI? by stackOVERFLOW, OpenChess Forum, December 14, 2013
Scientific American article on Computer Chess by Mark Lefler, CCC, June 03, 2017 ^[40] » Kasparov versus Deep Blue 1997

External Links

Wikipedia

AI in Media

BBC - Future - Artificial intelligence
BBC - Future - The cyborg chess players that can’t be beaten by Chris Baraniuk, December 04, 2015 » David Levy, Boris Alterman, Shay Bushinsky, Mark Lefler

Famous AI Programs

Logic Theorist by Allen Newell, Herbert Simon and Cliff Shaw
General Problem Solver by Herbert Simon, Cliff Shaw and Allen Newell
Eliza by Joseph Weizenbaum

Machine Creativity

Computational creativity from Wikipedia
Machine creativity: what it is and what it isn't by Albert Silver, ChessBase News, August 28, 2016 » AlphaGo
Creativity: Why it cannot be a machine property by Ofer Shamai, ChessBase News, October 01, 2016

Associations

Association for the Advancement of Artificial Intelligence (AAAI) (formerly the American Association for Artificial Intelligence)
AITopics / HomePage
AITopics / AINews
International Joint Conferences on Artificial Intelligence (IJCAI), IJCAI Conferences
Society for the Study of Artificial Intelligence and Simulation of Behaviour (SSAISB)

Journals

Online Courses

MIT OpenCourseWare tries to put as much MIT course material online as possible. Here are two courses on Artificial Intelligence:
6,034 Artificial Intelligence, Spring 2005
6.034 Artificial Intelligence, Fall 2010, Video Lectures by Patrick Winston
Intro to Artificial Intelligence Course Overview by Sebastian Thrun (Udacity) and Peter Norvig
Joint RTS/IET Public Lecture with Google DeepMind's Demis Hassabis, British Museum, London, November 04, 2015, YouTube Video

John McCarthy

Misc

Watson (artificial intelligence software) from Wikipedia
Computer Chess: The Drosophila of AI by L. Stephen Coles, October 30, 2002, Dr. Dobbs, republished 1994 article
Artificial Intelligence: A Modern Approach by Stuart Russell and Peter Norvig
AI on the Web
Articles On Artificial Intelligence
Artificial Intelligence II by Nikos Drakos, Computer Based Learning Unit, University of Leeds
Artificial Intelligence by Jürgen Schmidhuber
Artificial Intelligence Repository from Carnegie Mellon University
Artificial Intelligence at Edinburgh University: a Perspective by Jim Howe, University of Edinburgh
Artificial Intelligence - Recollections of the Pioneers
My view on Artificial Intelligence | Just another WordPress site by Jacques Pitrat
The “Modern” History of Artificial Intelligence and Programs from Neuroscience Of Intelligence
Kurt Gödel and his Impact on A.I., a preliminary draft by Werner DePauli-Schimanovich ^[43]
Cognitive Science and Artificial Intelligence by Franz-Günter Winkler
Science Clarified » Artificial Intelligence
Google AI Challenge Organized by the University of Waterloo Computer Science Club and sponsored by Google
A.I. Artificial Intelligence (film) from Wikipedia
Teachings from the Electronic Brain from Wikipedia
The Future of Computers, AI (artificial intelligence), etc -- aka, You're gonna die, sucker by Warren D. Smith, March 07, 2013
Fludd's description of perception, 1619 ^[44]

References

^ Alan Turing Scrapbook - the Origins of Artificial Intelligence by Andrew Hodges
^ B. Jack Copeland, Diane Proudfoot (2011-2012). Turing, Father of the Modern Computer. The Rutherford Journal - The New Zealand Journal for the History and Philosophy of Science and Technology, Vol. 4 » with photos of Alan Turing, John von Neumann, Dietrich Prinz, Christopher Strachey, Jack Good, Arthur Samuel, Herbert Simon, Allen Newell, ...
^ John McCarthy, Marvin Minsky, Nathaniel Rochester, Claude Shannon (1955). A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence.
^ Hermann Kaindl (1985). What Happened with AI's Drosophila? ÖGAI 1985: 194-203
^ Peter W. Frey (1991). Memory-Based Expertise: Computer Chess vs. AI, ICCA Journal, Vol. 14, No. 4
^ Schaakkunst Bernd Besser
^ I remember Donald Michie (1923 – 2007) « A Programmers Place by Maarten van Emden, June 12, 2009
^ Jaap van den Herik (1981). Computer Chess Today and Tomorrow: An Interview with Donald Michie. Computer Chess Digest Annual 1984
^ What is Artificial Intelligence? by John McCarthy
^ John McCarthy (1989). The Fruitfly on the Fly. ICCA Journal, Vol. 12, No. 4
^ John McCarthy (1990). Chess as the Drosophila of AI. Computers, Chess, and Cognition, pp. 227-237
^ Fruit fly races by Steven Edwards, CCC, April 06, 2005
^ Re: Fruit fly races by Anthony Cozzie, CCC, April 06, 2005
^ Evgenii Landis, Isaak Yaglom (1987). Remembering A.S. Kronrod. (2002). Translation by Viola Brudno, Edited by Walter Gautschi, ps
^ Биография А.С. Кронрода, Biography AS Kronrod by Alexander Yershov (translated by Google Translate)
^ Robert Levinson, Feng-hsiung Hsu, Tony Marsland, Jonathan Schaeffer, David Wilkins (1991). The Role of Chess in Artificial Intelligence Research. IJCAI 1991, pdf, also in ICCA Journal, Vol. 14, No. 3, pdf
^ Peter W. Frey (1991). Memory-Based Expertise: Computer Chess vs. AI. ICCA Journal, Vol. 14, No. 4
^ John McCarthy (1997). AI as Sport. Science, Vol. 276
^ Monroe Newborn (1997). Kasparov versus DEEP BLUE: Computer Chess Comes of Age. Springer
^ Making Computer Chess Scientific by John McCarthy
^ Re: Chess vs Go // AI vs IA by Gian-Carlo Pascutto, June 02, 2010
^ Graham Kendall, Jonathan Schaeffer (2006). Poker. ICGA Journal, Vol. 29, No. 3
^ Remarks by Bill Gates, International Joint Conference on Artificial Intelligence, Seattle, Wash., August 7, 2001
^ Rosenblatt's Contributions
^ General Problem Solver from Wikipedia
^ Publications of John Maynard Smith (pdf)
^ The abandonment of connectionism in 1969 - Wikipedia
^ Frank Rosenblatt (1962). Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanisms. Spartan Books
^ Physical symbol system from Wikipedia
^ K-line (artificial intelligence) from Wikipedia
^ John McCarthy (1997). Chess as the Drosophila of AI. Computer Science Department, Stanford University, condensed version of the 1990 paper, pdf
^ Re: ICCA Journal Sinks To A New Low by Amir Ban, CCC, January 25, 1998
^ Christian Jongeneel (1996). The informatical worldview, an inquiry into the methodology of computer science. Ph.D. thesis, Delft University of Technology, advisor Henk Koppelaar, The evolution of information in man and machine | Christian Jongeneel
^ Terasem Journal of Personal Cyberconsciousness - Marvin Lee Minsky discussing his book, The Emotion Machine
^ Mark Watson · GitHub
^ Java implementation of algorithms from Norvig and Russell's Artificial Intelligence: A Modern Approach. 3rd edition
^ Chess Metaphors – Artificial Intelligence and the Human Mind by Diego Rasskin-Gutman, ChessBase News, January 28, 2010
^ Dap Hartmann (2010). Sander Bakkes: Rapid Adaptation of Video Game AI. Review, ICGA Journal, Vol. 34, No. 1
^ Transcript of Kasparov’s TED talk, May 2017
^ 20 Years after Deep Blue: How AI Has Advanced Since Conquering Chess by Larry Greenemeier, Scientific American, June 2, 2017
^ Connectionism from Wikipedia
^ Marvin Minsky, Seymour Papert (1969). Perceptrons.
^ Kurt Gödel from Wikipedia
^ Intelligence from Wikipedia

Up one Level

Arts

GerdIsenberg — Sun, 05 Nov 2017 09:51:08 GMT

Margaret Sarah Carpenter

Jean-Jules-Antoine Lecomte du Nouÿ

John William Waterhouse

Industrial Heritage Trail

Home * Arts

Artists

CPW Pages containing Paintings, Arts and artful buildings by:

Alfred Agache

1. History Heuristic
2. Nona

Irving Amen

^[1]

Samuel Bak

^[2]

Hans Baldung

1. Bruja
2. Witchess

Lubin Baugin

1. Bouquet

Bernd Besser

^[3]

1. Artificial Intelligence
2. Search

Joachim Beuckelaer

1. CFish

Ivan Bilibin

1. Dragon (Chess Assistant)

William Blake

1. Bestia

Boldriaan

1. CHAOS
2. Perceiver

Carlo Bolmida

1. ChessMind

Hieronymus Bosch

1. Armageddon

Sandro Botticelli

1. Centaur

François Boucher

1. Kallisto

Karl Bryullov

1. DisasterArea

John Cage

Jacques Callot

1. Double Attack
2. KriegSpiel

Margaret Sarah Carpenter

1. AdaChess

John Collier

1. Anaconda
2. Delphi

Christopher Conte

1. NegaC*
2. SpiderChess

Salvador Dalí

Eugène Delacroix

1. Chiron
2. Freedom
3. Mephisto

Gustave Doré

1. Arachne
2. Bringer
3. Princhess
4. Rocinante
5. Satana

Willem Drost

1. Betsabe

Marcel Duchamp

Marcel Duchamp - Man Ray, Entr'acte 1924 ^[4] ^[5] ^[6] ^[7] ^[8]

Bert Eelen

1. DarkThought

Max Ernst

Max Ernst and Dorothea Tanning ^[9] ^[10]
1. 8x8 Board
2. King
3. Minimax
4. Pieces
5. Square Attacked By

M. C. Escher

Luis Ricardo Falero

1. B*
2. Comet
3. Fairy-Max

Henry Fuseli

1. Nightmare GER
2. Nightmare NL

Jean-Léon Gérôme

1. Chess Tiger
2. Diogenes

Vincent van Gogh

El Greco

1. Toledo 2000

Gerhard Hahn

1. Tech

Hannah Höch

Gerhard Hoehme

1. Aspiration Windows

Katsushika Hokusai

1. Multi-Cut
2. Senpai

Carina Jørgensen

Marina Kalinovsky

1. Castling
2. Legal Move

Wassily Kandinsky

Yvonne Kendall

1. StarTech

Paul Klee

Shannon Larratt

1. Checkmate

Hans Larwin

1. Soldat

Jean-Jules-Antoine Lecomte du Nouÿ

1. Rhetoric

Eustache Le Sueur

1. Muse

Tom Loback

^[13]

1. Gothmog
2. Treebeard

René Magritte

1. Recursion

Frederick McCubbin

1. Pioneer

Michelangelo

Barbara Mittman

Piet Mondrian

Andres Montenegro

1. Chess Monster
2. SPOC

Henry Moore

1. Asymmetric evaluation
2. Internal Iterative Deepening

Evelyn De Morgan

1. Cassandre
2. Storm

Igor Morski

1. Chess Wizard
2. Michael Dvorkin

Edvard Munch

1. Monte-Carlo Tree Search
2. Search Explosion

Luigi Mussini

1. Ruy Lopez

Doris Neidl

1. Fischerle
2. Requiem

David Normal

1. Tumult

Jacek Pałucha

1. Robocide

Joanna Margaret Paul

1. Joanna

Feliks Pęczarski

1. Sharper

Pablo Picasso

1. Chrilly Donninger
2. Knight

John C. Portman Jr.

1. ACM 1973
2. ACM 1976
3. ACM 1979
4. ACM 1981

Irmgard Potthoff

1. Iterative Search

Man Ray

Salvador Dalí and Man Ray in Paris, on June 16, 1934

Elke Rehder

Auguste Rodin

Frederick Sandys

1. Madeleine

Alexei Savrasov

1. Rook (Program)

Osmar Schindler

1. Goliath

Karen Schuman

1. Quiescence Search

Vieira da Silva

1. Mate at a Glance

John Singer Sargent

1. Atlas

Hildegard Skowasch

1. PolyGlot

Stephen Strait

1. Stalemate

Dorothea Tanning

1. 8x8 Board
2. Endgame

John Tenniel

La Tuffo

^[14]

1. Time Management

Raja Ravi Varma

1. Chess Guru

Viktor Vasnetsov

1. Dragon RU
2. Quest
3. Symbolic

Hikaru Wada

1. Xenarbor

John William Waterhouse

1. Hexxpawn
2. Oracle
3. Tristram

Lawrence Weiner

1. PostModernist

Mark Wilkinson

1. Chess

Richard Wilson

1. Averno

Graffiti

1. Homer
2. Jumbo
3. Robbolito

Industrial Heritage Trail

^[15]

Art Museum Bochum

1. Aspiration Windows
2. Asymmetric evaluation

Flottmann-Hallen

Zollern Colliery

1. Move Generation
2. Nodes per second

Publications

Donald E. Knuth (1968 ...). The Art of Computer Programming (TAOCP). Addison-Wesley
Sanjoy Mahajan (2010). Street-Fighting Mathematics: The Art of Educated Guessing and Opportunistic Problem Solving. MIT Press
Sanjoy Mahajan (2014). The Art of Insight in Science and Engineering. MIT Press

Forum Posts

The Art of Evaluation by Tord Romstad, CCC, August 2, 2007 » Evaluation Philosophy

External Links

Wikipedia

Misc

References

Up one Level

Barbara Liskov

GerdIsenberg — Thu, 30 Oct 2014 15:20:59 GMT

Home * People * Barbara Liskov

		Barbara Liskov, (née Barbara Jane Huberman in 1939) an American mathematician, computer scientist and Ford Professor at MIT School of Engineering at Massachusetts Institute of Technology. In 1968 Stanford University made her the first woman in the United States to be awarded a Ph.D. from a computer science department, advised by John McCarthy. The topic of her Ph.D. thesis was a computer program to play chess end games, where she proposed the Killer Heuristic ^[1] ^[2]. Huberman's program could solve KQK, KRK, KBBK, KBNK, and KNNNK ^[3].
Barbara Huberman ^[4]

Turing Award

Selected Publications

External Links

References

What links here?

Turing Award

Barbara Liskov received the 2008 ACM Turing Award for her work on practical and theoretical foundations of programming language and systems design, especially related to data abstraction, fault tolerance, and distributed computing ^[5]

Turing Award Winner Barbara Liskov ^[6]

Selected Publications

^[7]

Barbara J. Huberman (1968). A Program to Play Chess End Games. Technical Report no. CS-106, Ph.D. thesis. Stanford University
Alex Bell (1972). Games Playing with Computers. Allen & Unwin, Chess programs: Huberman
Barbara Liskov (1972). A Design Methodology for Reliable Software Systems. AFIPS '72, pdf
Barbara Liskov, Stephen N. Zilles (1974). Programming with Abstract Data Types. SIGPLAN Notices, Vol. 9, No. 4
Barbara Liskov, John Guttag (1986). Abstraction and Specification in Program Development. The MIT Press
Barbara Liskov, John Guttag (2000). Program Development in Java; Abstraction, Specification, and Object-oriented Design. Addison-Wesley
Barbara Liskov (2009). The Power of Abtraction. ACM Turing Award lecture, slides as pdf, Keynote, May 03, 2013

External Links

Barbara Liskov homepage
Barbara Liskov from Wikipedia
Barbara Liskov, Computer Engineer, Massachusetts Institute of Technology, Career Description
Liskov substitution principle from Wikipedia
Barbara Jane Huberman Liskov from Mathematics Genealogy Project
The Programmer Dress Code – Part Deux | CodeThinked by Justin Etheredge, December 11, 2007
Turing Award Winner Barbara Liskov from Science Friday, March 13, 2009
Barbara Liskov Wins Turing Award from Dr. Dobb's Journal, March 10, 2009
ACM Celebrating Women of Distinction
In praise of Knuth and Liskov from Bertrand Meyer's technology+ blog, May 22, 2011 » Donald Knuth
Barbara Liskov: Programming the Turing Machine, YouTube Video
A lecture given on the occasion of Princeton University's centennial celebration of Alan Turing, May 11, 2012

References

^ Jos Uiterwijk (1992). The Countermove Heuristic. ICCA Journal, Vol. 15, No. 1, pp. 8, The killer heuristic
^ Barbara J. Huberman (1968). A Program to Play Chess End Games. Technical Report no. CS-106, Ph.D. thesis. Stanford University
^ Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227, Chess programs: Huberman
^ The Programmer Dress Code – Part Deux | CodeThinked by Justin Etheredge, December 11, 2007
^ Barbara Liskov Wins Turing Award from Dr. Dobb's Journal, March 10, 2009
^ Turing Award Winner Barbara Liskov from Science Friday, March 13, 2009
^ dblp: Barbara Liskov

What links here?

Page	Date Edited
ACM	May 7, 2017
Alen Shapiro	May 3, 2015
Artificial Intelligence	Apr 9, 2018
Barbara Liskov	Oct 30, 2014
Donald Knuth	Aug 29, 2016
Donald Michie	Dec 23, 2017
Endgame	Sep 18, 2017
Huberman	Aug 9, 2013
Java	Feb 25, 2018
Killer Heuristic	Sep 14, 2017
KRK	Nov 26, 2016
Massachusetts Institute of Technology	Jan 24, 2017
Mathematician	Apr 9, 2018
People	Feb 28, 2018
Stanford University	Dec 7, 2017

Up one level

Battle Chess

GerdIsenberg — Mon, 12 Dec 2016 15:53:38 GMT

Home * Engines * Battle Chess

		Battle Chess, a chess program, famous for its animated move and specially capture sequences in 3D mode, released for various home and personal computer platforms as well as video game consoles, beside others for Apple II, Commodore 64, Commodore Amiga, Atari ST, IBM PC, Apple Macintosh, Acorn Archimedes, 3DO and Nintendo Entertainment System. The game was developed by a team around Brian Fargo and Michael Quarles, including Jay Patel, Bruce Schlickbernd, and Todd Camasta ^[1], released in 1988 by Fargo's company Interplay ^[2] soon after ending the relationship with Electronic Arts ^[3].
Cover art of Battle Chess ^[4]

Games

Battle Chess 4000 for MS-DOS played the Harvard Cup 1993, and surprised by winning from Michael Rohde and a drawing from Boris Gulko ^[5] ^[6]:

[Event "4th Harvard Cup G/25"]
[Site "Boston, MA USA"]
[Date "1993.11.06"]
[Round "03"]
[White "Michael Rohde"]
[Black "BattleChess 4000 SVGA"]
[Result "0-1"]
 
1.Nf3 Nf6 2.c4 g6 3.Nc3 d5 4.cxd5 Nxd5 5.Qa4+ Nc6 6.Nxd5 Qxd5 7.e4 Qe6
8.Bb5 Bd7 9.O-O Bg7 10.d3 Qd6 11.Be3 Bxb2 12.Rab1 Bg7 13.d4 a6
14.e5 Qe6 15.d5 Qxd5 16.Rfd1 Qe6 17.Bc4 Nxe5 18.Bxe6 Nxf3+ 19.gxf3 Bxa4
20.Bb3 Bc6 21.Bd5 Bxd5 22.Rxd5 e6 23.Rd2 b6 24.Rc2 Be5 25.f4 Bd6 26.Kg2 O-O
27.Rc6 Rfd8 28.Kf3 Kf8 29.Ke2 Ke7 30.h3 Kf6 31.Rd1 Rab8 32.Kf3 Kf5
33.Rg1 h6 34.h4 Rd7 35.Rcc1 Be7 36.Rh1 h5 37.Rc6 Rb7 38.Rh2 Rd3 39.Rh1 Bd6
40.Rg1 Bxf4 0-1
 
 
[Event "4th Harvard Cup G/25"]
[Site "Boston, MA USA"]
[Date "1993.11.06"]
[Round "05"]
[White "Boris Gulko"]
[Black "BattleChess 4000 SVGA"]
[Result "1/2-1/2"]
 
1.d4 Nf6 2.Bf4 d5 3.e3 Bf5 4.c4 Nc6 5.Nc3 e6 6.Nf3 Bb4 7.a3 Bxc3+
8.bxc3 O-O 9.Bg5 Qe7 10.Bd3 Bxd3 11.Qxd3 dxc4 12.Qxc4 h6 13.Bh4 Qd8
14.O-O Qd5 15.Qd3 Ne4 16.Rab1 Nd6 17.Nd2 Ne5 18.Qe2 Ng6 19.Bg3 Qc6
20.c4 Nf5 21.Rb4 Nxg3 22.hxg3 b6 23.Qh5 Rad8 24.Rc1 Rd6 25.Qb5 e5
26.Qxc6 Rxc6 27.d5 Rd6 28.e4 Re8 29.c5 Rd7 30.Ra4 Ra8 31.cxb6 cxb6
32.Rc6 Re8 33.Rac4 f6 34.a4 Ra8 35.Kf1 Kf7 36.Nf3 Ne7 37.Rc7 Ke8 38.Rc2
Kd8 39.R7c3 Rc8 40.Rxc8+ Nxc8 41.Ke2 Nd6 42.Kd3 f5 43.Nxe5 fxe4+ 44.Kd4
Rc7 45.Nc6+ Ke8 46.g4 Kd7 47.Re2 Kc8 48.Ke5 Kd7 49.Rc2 Rc8 50.Kd4 Rc7
51.Rc3 Ke8 52.Ke5 Kd7 53.Kd4 Ke8 54.Re3 Kf7 55.f3 exf3 56.gxf3 h5
57.Re6 Rxc6 58.dxc6 Kxe6 59.gxh5 Ne8 60.Kc4 Kd6 61.Kd4 Nf6 62.c7 Kxc7
63.Ke5 Nxh5 64.Kf5 Ng3+ 65.Kg6 Ne2 66.Kxg7 Nd4 67.f4 Ne6+ 68.Kf6 Nxf4
69.Ke5 Ne2 70.Kd5 Nc3+ 71.Kc4 Nxa4 72.Kb5 Nc5 73.Kb4 Kd6 74.Kb5 Kd5
75.Kb4 a6 76.Kc3 a5 77.Kb2 b5 78.Kc3 b4+ 79.Kb2 Kc4 80.Kc2 Nd3
81.Kd2 b3 82.Ke3 b2 83.Ke4 a4 84.Kf5 a3 85.Ke6 Nb4 1/2-1/2

Forum Posts

Battle Chess 4000 + NT4 = Yuk by Mark Taylor, rgcc, April 9, 1999
Deep Thought, Kasparov, Fidelity, Ferret, CM4000,Junior, Battle Chess by K. Burcham, CCC, March 23, 2002
Chess Programming Questions by Randall Jouett, rgcc, May 21, 2002
Battle Chess needs help by Julien Marcel, CCC, May 17, 2012

External Links

Battle Chess from Wikipedia
Commodore 64/128 Old Computer Chess Game Collection - Battle Chess from The Spacious Mind » Commodore 64, Commodore 128
Warring Battle Chess reactions | Apple II Bits » Apple II
Battle Chess series - MobyGames
Battle Chess (1993) 3DO cover art - MobyGames
Battle Chess for 3DO (1993) - MobyGames
Battle Chess 4000 Screenshots for DOS - MobyGames
Battle Chess Special Edition - GOG.com
Interplay - Battle Chess
Interplay wins injunction against Topware's Battle vs Chess game by John Callaham, December 25, 2010
Interplay Wins over TopWare in "Battle vs. Chess" Affair by Theo Valich, February 12, 2012
Battle Chess - Subdued Software LLC
Amazon.com: Battle Chess Bundle (Jewel Case): Video Games
Battle Chess for Windows from Home of the Underdogs » Windows
Starring the Computer - The Rachel Papers (1989) » Amiga
Battle Chess for Acorn Archimedes - GameFAQs » Acorn Archimedes
The Computer Chronicles - Amiga 2500 (1989), YouTube Video
Battle Chess starting around 8:30 ^[7]

References

^ Commodore 64/128 Old Computer Chess Game Collection - Battle Chess from The Spacious Mind
^ Interplay - Battle Chess
^ Battle Chess from Wikipedia
^ Battle Chess from Wikipedia
^ Larry Kaufman (1993). The 4th Harvard Cup. Computer Chess Reports, Vol. 4, No. 2
^ Downloads | Man-Computer | Games, CSVN site
^ Re: Kathlen Spracklen's TV interview about Sargon (1985) by Julien Marcel, CCC, January 12, 2014 » Kathe Spracklen - Lady Sargon

What links here?

Page	Date Edited
Acorn Archimedes	Dec 17, 2016
Amiga	Mar 24, 2016
Apple II	Dec 22, 2017
Battle Chess	Dec 12, 2016
Death Chess 5000	Apr 5, 2013
Engines	Mar 10, 2018
Grandmaster Chess	Dec 7, 2016
Harvard Cup 1993	Nov 8, 2016
Heuristic Software	May 4, 2013
Virtual Chess	Mar 25, 2017

Up one level

BBC Micro

GerdIsenberg — Fri, 16 Dec 2016 21:39:49 GMT

Home * Hardware * BBC Micro

		BBC Micro, (BBC Microcomputer System) a series of 8-bit 6502 based home computers by Acorn Computers Ltd, initially designed by a team including Steve Furber and Sophie Wilson, first released in December 1981. The Micro was contracted by the British Broadcasting Corporation (BBC) after a call for bids for a computer to accompany the TV series and literature for their Computer Literacy Project ^[1] ^[2] ^[3], which was won by Acorn with the Proton, a successor of the Acorn Atom - renamed the BBC Micro. Acorn also employed the machine to simulate and develop the ARM architecture which, many years later, has become hugely successful ^[4].
BBC Micro ^[5]

First Computer Go Tournament

Computer Literacy Project

Misc

References

What links here?

Hardware

The BBC Micro had a 6502 processor running at full 2 MHz speed, accessing fast DRAM, alternating concurrently with the MC6845 video display controller, featuring eight display modes for text and graphics varied between 20 and 40-column text suitable for a TV, to 80-column text requiring an RGB-connected video monitor. As noted by Steve Furber in a recent interview ^[6], the alternating fast 4 MHz RAM access required some address multiplexing using exactly the 81LS95 tri-state octal buffer ^[7] from National Semiconductor - for unknown reasons, 81LS95 from other vendors were not working.

Multiple input/output ports were available to connect with peripherals or other machines, such as serial PS-423 ports, parallel ports, analogue input ports with ADC for instance used by a joystick, light pen input, an expansion connector (the "1 MHz bus") to expand the system with additional hardware such as the BBC Micro expansion, and the Tube interface to connect a secondary processor. The BBC Micro had an integrated keyboard and a cassette interface. Floppy disks were optional through the Intel 8271 programmable floppy disk controller, in later models replaced by Western Digital's FD1771. The Texas Instruments SN76489 was responsible for sound. Phoneme based speech synthesis using TI's TMS5220 speech chip with a custom Acorn ROM of Kenneth Kendall's voice was optional ^[8].

Models

The initial BBC Micro was shipped as Model A with 16 KiB of user RAM, and Model B with 32 KiB. The Acorn Electron was a budget version of the B-Model released by Acorn in 1983. Two export models were developed for the US ^[9] and West Germany in 1983 ^[10]. As a sideline, the Acorn Business Computer (ABC) range of machines was announced in October 1984 ^[11].

The Model B+ in mid 1985, increased the total RAM to 64 KiB, the B+128 came with an additional 64 KiB (4 × 16 KBi "Sideways" RAM banks) to give a total RAM of 128 KiB ^[12]. The BBC Master with integrated floppies followed in 1986 with an enhanced 65SC12 CPU, and expandable 128 KiB RAM as default, and remained in production until 1993 ^[13].

Software

The Acorn Machine Operating System (MOS) was held in 16 KiB of ROM on the motherboard. A further 16 KiB ROM contained the BBC BASIC interpreter. Acornsoft was the major publisher of software for the BBC Micro and Acorn Electron, who released Acornsoft Chess written by Arthur Norman and Nick Pelling. Other British companies in the fast growing software market were Micro Power , Computer Concepts, Ltd. and Bug-Byte.

Chess Programs

First Computer Go Tournament

The BBC Micro Go Tournament was held in London, on January 7 and 8, 1984, sponsored by Acornsoft. All eight programs ran on BBC Micro. The Go playing program by Bronyslaw Przybla won the event ^[14].

Publications

John Vaux (1983). Micro takes on Chess Machine. Acorn User, No. 8, pdf
Tony Harrington (1983). University Challenge - Martin Bryant and White Knight. Personal Computer World, August 1983, pdf hosted by Mike Watters
Alex Bell (1983). Chess for three gives the White Knight a winning gambit. The Micro User Magazine, December 1983
Arthur Norman, Gillian Cattell (1983). LISP on the BBC Microcomputer. Acornsoft » LISP ^[16]

Manuals

^[17]

John Coll, David Allen (ed.) (1984). BBC Microcomputer System User Guide. pdf
Acorn Computer (1985). BBC Microcomputer Service Manual. Section 1, Models A + B, pdf
Circuit Diagram (pdf)

Forum Posts

Okay, i know now: Colossus and BBC ACORN A: White Knight by Frank Phillips, CCC, May 06, 2002
those good old times... in the 70-80ties by Thorsten Czub, CCC, May 06, 2002

External Links

BBC Micro

Software

Chess Programs

Computer Literacy Project

Misc

Computer Go - Past Events - Acorn 1984 » Go
Building the BBC Micro (The Beeb) with Steve Furber - Computerphile, YouTube Video
The BBC Model B Microcomputer System: As seen in Tezza's classic computer collection, YouTube Video

References

^ BBC - Computer Literacy Project - Computing History
^ BBC Continuing Education Television - Computer Literacy Project (pdf)
^ The Computer Programme (BBC2, 1982), YouTube Videos
^ BBC Micro from Wikipedia
^ Image assumed by Stuart Brady, December 26, 2005, The expansion socket to the left of the keyboard is not a standard fitting and has been added afterwards, Wikimedia Commons
^ Steve Furber's Video Interview at 8:50
^ DM81LS95A Datasheet - National Semiconductor
^ BBC Micro from Wikipedia
^ USA model BBC micro
^ Chris's Acorns: German BBC Microcomputer Model B, hosted by the Wayback Machine
^ BBC Micro from Wikipedia
^ BBC Micro from Wikipedia
^ Acorn Sales News Issue 72 (pdf) April 19, 1993
^ Computer Go - Past Events - Acorn 1984
^ Micro Bit from Wikipedia
^ Acornsoft LISP from Wikipedia
^ Chris's Acorns: Acorn Manuals

What links here?

Page	Date Edited
Acorn Archimedes	Dec 17, 2016
Acorn Atom	Dec 11, 2016
Acornsoft Chess	Dec 11, 2016
Arthur Norman	Dec 16, 2016
Artic Computing	Aug 13, 2016
Basic	Jan 3, 2018
BBC Micro	Dec 16, 2016
Chess (David Thompson)	Dec 11, 2016
Colossus Chess	Dec 10, 2017
Go	Jan 24, 2018
Hardware	Jan 20, 2018
Martin Bryant	Dec 11, 2016
Michael Reiss	Dec 15, 2016
Nick Pelling	Dec 11, 2016
White Knight	Dec 12, 2016
Your Computer	Dec 10, 2016

Up one Level

C sharp

GerdIsenberg — Sun, 26 Nov 2017 11:45:02 GMT

Home * Programming * Languages * C#

C# has been developed by Microsoft as part of the .NET Framework. It is a Multi-paradigm programming language, being functional, imperative, generic, object-oriented, and component-oriented. C# Chief Architect is Anders Hejlsberg, the creator of Turbo Pascal and Delphi ^[1].

Chess Programs

Chess Program in C# by Jacques Fournier, from the Code Project, Last Updated: June 08, 2009
How to Develop a Chess Program for Dummies based on Huo Chess by Spiros (Spyridon) Kakos ^[2]

Dynamic List

Engines, written in C#. To expand this list, create a new engine page with the tag "csharpengines".

1. Alfil
2. ChessBin.com
3. ChessMaps
4. ChessV
5. Counter
6. Dolphin
7. Excelsior
8. FUSCsharp
9. Jabba
10. MadChess
11. NoraGrace
12. Portfish
13. RumbleMinze
14. Sharp Chess
15. SharpChess
16. The Turk (TR)

Neural Networks

John Wakefield's Dynamic Notions, a Blog about the evolution of neural networks with C# samples:

Publications

Liwu Li, Wenjiang Wang (2004). Object-oriented programming with dynamic classification in C#. IASTED Conference on Software Engineering and Applications 2004

Forum Posts

c# for chess engine by Sergei Markoff, CCC, September 13, 2011
C# Performance by Richard Allbert, CCC, January 27, 2012
[.Net only] - fast bit operations by Balint Pfliegel, CCC, June 18, 2012
Question About CPP-C#, Performance, and Square Represenation by Cheney Nattress, CCC, September 29, 2012
Re: Question About CPP-C#, Performance, and Square Represenation by Erik Madsen, CCC, October 03, 2012 ^[3]
C# compiler for Windows XP SP3 by Norbert Raimund Leisner, CCC, January 15, 2014

External Links

C#

Yield

SYSK 149: Performance Analysis of the ‘yield return’ Statement - AppDev: Something You Should Know by Irena Kennedy - MSDN Blogs, July 05, 2006
Give way to the yield keyword! - IronShay, June 2008
Behind the scenes of the C# yield keyword by Lars Corneliussen, June 9, 2008
Demystifying the C# Yield-Return Mechanism -- Visual Studio Magazine by James McCaffrey, February 02, 2012

Frameworks

References

^ Behind the Code with Anders Hejlsberg, YouTube Video
^ Huo Chess from MSDN Code Gallery
^ Behind the scenes of the C# yield keyword by Lars Corneliussen, June 9, 2008

What links here?

Page	Date Edited
Adam Berent	Jul 6, 2010
Albert Bertilsson	Jun 6, 2017
Alfil	Sep 3, 2015
Balint Pfliegel	Aug 30, 2015
C sharp	Nov 26, 2017
ChessBin.com	Jan 6, 2012
ChessMaps	Dec 7, 2017
Chessmaps Heuristic	Aug 27, 2015
ChessV	Jan 21, 2018
Colossus Chess	Dec 10, 2017
Counter	Nov 13, 2017
Dolphin	Nov 28, 2014
Engines	Mar 10, 2018
Eric Oldre	Jul 3, 2014
Erik Madsen	Apr 13, 2014
Excelsior	Apr 16, 2014
Fafis	May 17, 2016
FUSCsharp	Jun 7, 2013
Garbochess	Sep 23, 2017
Garbochess-JS	Sep 23, 2017
Gary Linscott	Jan 16, 2018
Generic Programming	Jul 7, 2012
Jabba	Sep 10, 2016
Kieran Greer	Nov 7, 2014
Languages	Nov 26, 2017
Learning	Feb 20, 2018
Linked List	Oct 11, 2016
MadChess	Jul 4, 2017
Marco Belli	Jan 6, 2018
Marco Block-Berlitz	May 26, 2013
Marek Kłonowski	Apr 16, 2014
Neural Networks	Mar 12, 2018
NoraGrace	Nov 23, 2014
Norbert Raimund Leisner	Jul 28, 2016
Oliver Uwira	Apr 5, 2013
Philippe Fabiani	Sep 15, 2016
Portfish	Sep 8, 2016
Pseudorandom number generator	May 11, 2017
Richard Allbert	Feb 7, 2016
RumbleMinze	Apr 13, 2014
Sergei Markoff	Mar 12, 2018
Sharp Chess	Jun 6, 2017
SharpChess	Jun 6, 2017
Sharper	Jun 6, 2017
Sinobyl	Jul 3, 2014
The Turk (TR)	Apr 1, 2017
Vajolet	Jan 25, 2018
Windows	Nov 2, 2017
Woodpusher	Dec 12, 2016
Yakup Ipek	Sep 6, 2015

Up one Level

Candidates (Bitboards)

GerdIsenberg — Sat, 11 Nov 2017 09:57:18 GMT

Home * Board Representation * Bitboards * Pawn Pattern and Properties * Candidates

		Candidates, pawns that can force themselves to become passed pawns simply with a series of pawn moves. Candidates are half-open pawns with no mechanical but dynamical obstructions. Specifially, the pawn must be on a half-open file, and the number of defender pawns that can help the pawn advance are greater than or equal to the number of pawns which attack the pawn or squares in front of it.
Samuel Bak - The Designated ^[1]

Candidate and Faker

While the intersection of the frontspan with opposing pawns is empty, the intersection of front attackspans with opposing pawns is not (otherwise it would already a passer). The opposing pawns as member of the front attackspan(s), stand sentinel over one or more squares in the frontfill of the open pawn, and are about to capture the open pawn, if it may advance into - or already is - a lever. Those opposing pawns are called sentries.

If the open pawn has one or more helper-pawns on adjacent files, which are able to recapture the sentry, the candidate is a real one and is guaranteed to force a passer. Otherwise, without enough support from helpers, the candidate is only a faker.

The following diagrams shows advanced candidates and fakers, assuming black to move:

candidates b6, f4   fakers -
sentries   c7, g2   more sentries
helper     c5, g4   than helpers
. . . . | . . .     . . . . | . . .
. . b . . . . .     b . b . . . . .
. w . . . . . .     . w . . . . . .
. . w . . . . .     . . w . . . . .
. . . . . b b .     . . . . . b b .
. . . . . . . .     . . . . . . . .
. . . . . . w .     . . . . w . w .
. . . | . . . .     . . . | . . . .

The white candidate on b6 is already in lever-distance with the sentry c7. The sentry c7 is likely forced to capture - otherwise b6 captures or pushes to become a passer. The white helper immediately recaptures and takes the role of the former candidate and becomes a passer. The black candidate on f4 can also force a passer. The helper on g4 compensates the sentry on g2. Usually, the candidate has to push forward, not the helper.

In the second diagram both candidates are pseudo-candidates or fakers, since there are more sentries than helpers - a7xb6 is required - otherwise, after c7xb6, c5-c6 would allow the helper to advance to a passer.

Advanced Candidates

Advanced candidates, already inside or about to enter the opponent side of the board are the most important to consider in evaluation. Even more if the interspan of sentries and helper is already one - and it is only about the control of the stop-square - or if the candidate is already part of a lever, the number of attacks and defenses.

In such cases, due to the forced nature of exchanging candidate, sentry and helper, only two or up to five plies are necessary to establish a passer. In fact those candidates may even be more worth than pawns already a passer - specially if the opponent king is outside the candidates square - or if the outside candidate may deflect the opponent king.

One may argue that a candidate already in lever distance with the sentry should be covered by quiescence search - since it is a capture/recapture sequence. Therefor more important to evaluate are the candidate-helper-duo/trio against one or two sentries, which is likely a kind of static exchange evaluation of the candidate's stop-square.

. . . . . . . .
. . s . . s . s   sentries
. . . . . . . .
. c h . . h c h   candidates with helpers
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .

To cover sets of advanced white candidates with attacked but sufficient defended stops already on the on the 5th rank, one may use some code like this. Feel free to introduce branches, e.g. if there are no white pawns on the fifth rank. Anyway, wSafePawnSquares might be used elsewhere, e.g. to decide whether helper pawns may advance to defend candidate's stop.

U64 wCandidatesOn5th(U64 wpawns, U64 bpawns) {
   const U64 rank5     = C64(0x000000ff00000000);
   U64 bPawnAnyAttacks = bPawnAnyAttacks(bpawns);
   U64 wSafeSquares    = wSafePawnSquares(wpawns, bpawns);
   U64 wSafeAttacked   = bPawnAnyAttacks  &  wSafeSquares;
   U64 blackFrontSpan  = (bpawns >> 8)    | (bpawns >> 16); // only for 5th rank
   return wpawns & rank5 &~blackFrontSpan & (wSafeAttacked >> 8);
}

Less Advanced

If it is about the long-term evaluation of telestop -squares - or the need of advancement of helper(s) to defend the stop-square, things become more complicated and one probably better relies on search and some general bonus to advance half-free pawns and advanced duos. Feel free to cover attackspan-related stuff for less advanced candidates respectively helpers and helper's helpers.

d4 is candidate     d4 is faker         d4 faker due to     d4 is candidate
                                        helper's sentry     due to helper's helper f2
. . . . . . . .     . . . . . . . .     . . . . . . . .     . . . . . . . .
. . s . s . . .     . . s . s . . .     . . s . s . . .     . . s . s . . .
. . . . . . . .     . . . . . . . .     . . . . . hs. .     . . . . . hs. .
. . . . . . . .     . . . . . . . .     . . . . . . . .     . . . . . . . .
. . . c . . . .     . . . f . . . .     . . . f . . . .     . . . c . . . .
. . . . . . . .     . . . . . . . .     . . . . . . . .     . . . . . . . .
. . h . h . . .     . . h . . . . .     . . h . h . . .     . . h . h hh. .
. . . . . . . .     . . . . . . . .     . . . . . . . .     . . . . . . . .

The Sneaker

Also known as a hidden passed pawn. A kind of candidate in disguise is an unfree pawn or faker that may become a passer through a sacrificial combination. In the diagram white may sacrifice the faker with b5-b6 - allowing black to establish a passer on b6 - but the sneaker on c6 becomes a much more advanced passer with a frontspan of only two against five:

. . . . . . . .
. . b . . . . .
. . w . . . . .
. w . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .

A sneaker is likely advanced (opponent side of the board), rammed and defended, but no lever. No other opposing pawn controls it's stop or telestop squares.

External Links

Pawn Power in Chess by Hans Kmoch - Glossary of Terms - Chess Forums - Chess.com ^[2]
Candidates Tournament from Wikipedia
Jango Edwards - Harry Christmas, September 10, 2009, Zeche Carl ^[3], Essen, YouTube Video

References

^ Chess in the Art of Samuel Bak, Center for Holocaust & Genocide Studies, University of Minnesota
^ Hans Kmoch (1959, 1990). Pawn Power in Chess. New York: Dover, 1990. Previous ed.: New York: McKay, 1959. ISBN 0-486-26486-6
^ Zeche Carl is part of The Industrial Heritage Trail

What links here?

Page	Date Edited
Attack Spans	Mar 4, 2010
Backward Pawns (Bitboards)	May 5, 2017
Candidate Passed Pawn	Nov 11, 2017
Candidates (Bitboards)	Nov 11, 2017
Faker	Nov 11, 2017
Hans Kmoch	Nov 11, 2017
Hidden Passed Pawn	Nov 11, 2017
Murka	Nov 11, 2016
Passed Pawns (Bitboards)	Aug 23, 2010
Pawn Attacks (Bitboards)	Mar 4, 2010
Pawn Pattern and Properties	Nov 11, 2017
Pawn Spans	Jul 22, 2010
PawnKing	Sep 5, 2014

Up one Level

CG 2016

GerdIsenberg — Mon, 18 Dec 2017 08:59:14 GMT

Home * Conferences * Computer and Games 2016
< Prev Next >

		The 9th International Computers and Games Conference, was held from June 29 to July 01, 2016, Snellius Building ^[1] ^[2], Leiden University, Leiden, The Netherlands, in conjunction with the WCCC 2016, WCSC 2016, and the 19th Computer Olympiad.
Snellius Building ^[3]

Lectures

^[4]

Day 1, June 29, 2016

Tobias Graf, Marco Platzner (2016). Using Deep Convolutional Neural Networks in Monte Carlo Tree Search. CG 2016
Richard J. Lorentz, Andrew Isaac (2016). Using Partial Tablebases in Breakthrough. CG 2016
Todd W. Neller et al. (2016). Monte Carlo Approaches to Parameterized Poker Squares. CG 2016
John Tromp (2016). The number of legal Go positions. CG 2016
John Tromp, Matthieu Walraet (2016). A googolplex of Go games. CG 2016
Kazuto Oka, Kiminori Matsuzaki (2016). Systematic Selection of N-tuple Networks for 2048. CG 2016
Xiaoheng Bi, Tetsuro Tanaka (2016). Human-side Strategies of the Werewolf Game against the Stealth Werewolves Strategy. CG 2016
Yuya Hirata, Michimasa Inaba, Kenichi Takahashi, Fujio Toriumi, Hirotaka Osawa, Daisuke Katagami, Kosuke Shinoda (2016). Werewolf Game Modeling using Action Probabilities based on Play Log Analysis. CG 2016

Day 2, June 30, 2016

Takahisa Imagawa, Tomoyuki Kaneko (2016). Monte Carlo Tree Search with Robust Exploration. CG 2016
Joris Duguépéroux, Ahmad Mazyad, Fabien Teytaud, Julien Dehos (2016). Pruning playouts in Monte-Carlo Tree Search for the game of Havannah. CG 2016
Jialin Liu, Olivier Teytaud, Tristan Cazenave (2016). Fast seed-learning algorithms for games. CG 2016
Michael Hartisch, Thorsten Ederer, Ulf Lorenz, Jan Wolf (2016). Quantified Integer Programs with Polyhedral Uncertainty Set. CG 2016
Raphael Thiele, Ingo Althöfer (2016). An Analysis of Majority Systems with Dependent Agents in a Simple Subtraction Game. CG 2016
Bas van Opheusden, Zahy Bnaya, Gianni Galbiati, Wei Ji Ma (2016). Do people think like computers? CG 2016
Francois Bonnet, Simon Viennot (2016). Nash Equilibrium in Mastermind. CG 2016
Aja Huang (2016). AlphaGo: Combining Deep Neural Networks with Tree Search. CG 2016, Keynote Lecture

Day 3, July 01, 2016

Jos Uiterwijk (2016). 11 x 11 Domineering is Solved: The first player wins. CG 2016
Kenny Young, Ryan Hayward (2016). A Reverse Hex Solver. CG 2016
Ingo Althöfer (2016). Computer-Aided Go: Chess as a Role Model. CG 2016
Cameron Browne (2016). A Class Grammar for General Games. CG 2016
Nera Nesic, Stephan Schiffel (2016). Heuristic Function Evaluation Framework. CG 2016
Peter H. Jin, Kurt Keutzer (2016). Convolutional Monte Carlo Rollouts for Computer Go. CG 2016
Hung Guei, Tinghan Wei, Jin-Bo Huang, I-Chen Wu (2016). An Empirical Study on Applying Deep Reinforcement Learning to the Game 2048. CG 2016

Postings

Timetable "Computers and Games 2016" by Ingo Althöfer, Computer Go Archive, June 22, 2016
Aja presentation by Ingo Althöfer, Computer Go Archive, June 30, 2016
Video of Aja Huang's presentation by Ingo Althöfer, Computer Go Archive, July 06, 2016

External Links

ICGA Events 2016 in Leiden | ICGA
Computers and Games 2016 | Computers and Games 2016 Leiden
CG2016 - ConfTool Pro - BrowseSessions
Keynote Lecture CG2016 Conference by Aja Huang, YouTube Video » AlphaGo ^[5]

References

^ Snellius Building
^ Willebrord Snellius (1580 - 1626)
^ Photo Snellius Building by Gerd Isenberg, July 03, 2015
^ CG2016 - ConfTool Pro - BrowseSessions
^ Video of Aja Huang's presentation by Ingo Althöfer, Computer Go Archive, July 06, 2016

What links here?

Page	Date Edited
19th Computer Olympiad	Sep 19, 2017
Breakthrough (Game)	Aug 11, 2017
Cameron Browne	Dec 30, 2017
CG 2013	Jul 18, 2017
CG 2016	Dec 18, 2017
Computer Olympiad	Mar 6, 2018
Conferences	Dec 18, 2017
Deep Learning	Feb 12, 2018
DeepMind	Dec 9, 2017
Evaluation	Feb 1, 2018
Fabien Teytaud	Jul 8, 2016
Games	Feb 20, 2018
General Game Playing	Dec 22, 2017
Go	Jan 24, 2018
Havannah	Jan 8, 2017
Hex	Dec 29, 2017
I-Chen Wu	Sep 19, 2017
Ingo Althöfer	May 4, 2017
Jan Wolf	Jul 8, 2016
John Tromp	Jan 6, 2017
Jos Uiterwijk	Aug 11, 2017
Julien Dehos	Jul 8, 2016
Kurt Keutzer	Jul 9, 2016
Learning	Feb 20, 2018
Leiden University	Jul 5, 2016
Marco Platzner	Dec 30, 2017
Matthieu Walraet	Jul 10, 2016
Michael Hartisch	Aug 11, 2017
Monte-Carlo Tree Search	Apr 26, 2018
Neural Networks	Mar 12, 2018
Olivier Teytaud	Jan 7, 2017
Peter H. Jin	Jul 9, 2016
Reinforcement Learning	Feb 12, 2018
Richard J. Lorentz	Aug 11, 2017
Ryan Hayward	Dec 29, 2017
Shih-Chieh Huang	Oct 18, 2017
Simon Viennot	Aug 11, 2017
Stephan Schiffel	Jul 8, 2016
Temporal Difference Learning	Feb 20, 2018
Tetsuro Tanaka	Oct 25, 2017
Thorsten Ederer	Jul 8, 2016
Tobias Graf	Jul 8, 2016
Todd W. Neller	Aug 11, 2017
Tomoyuki Kaneko	Oct 25, 2017
Tristan Cazenave	Jan 22, 2018
Ulf Lorenz	Dec 22, 2016
WCCC 2016	Sep 18, 2017
WCSC 2016	Sep 18, 2017

Up one Level

Charles Leiserson

GerdIsenberg — Wed, 12 Oct 2016 22:29:04 GMT

Home * People * Charles Leiserson

		Charles Eric Leiserson, an American computer scientist, professor of Computer Science and Engineering in MIT's Department of Electrical Engineering and Computer Science (EECS). Father of the Cilk multithreaded parallel programming language extension based on ANSI C and co-author of the parallel chess programs StarTech, Star Socrates and Cilkchess ^[1] . Charles Leiserson is co-author (with Ronald L. Rivest et al.) of Introduction to Algorithms, and co-author of the paper on using De Bruijn sequences for bitscan-purposes ^[2] . Charles was network architect for the Connection Machine Model CM-5 Supercomputer manufactured by Thinking Machines Corporation and Director of System Architecture at Akamai Technologies. In 2007 Charles Leiserson co-founded Cilk Arts, Inc., a start-up developing Cilk technology for multi-core computing applications, which was acquired by Intel in August 2009 ^[3] ^[4] .
Charles E. Leiserson ^[5]

Photos

Selected Publications

Photos

Parallel experts at WCCC 1999: Vincent Diepeveen, Don Dailey and Charles Leiserson

Selected Publications

^[6] ^[7]

1985 ...

Charles E. Leiserson (1985). Fat-Trees: Universal Networks for Hardware-efficient Supercomputing. IEEE Transactions on Computers, Vol. 34 , No. 10, pdf

1990 ...

Thomas H. Cormen, Charles Leiserson, Ronald L. Rivest (1990). Introduction to Algorithms. (first edition). MIT Press and McGraw-Hill. ISBN 0-262-03141-8
Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, Robert Zak (1992). The Network Architecture of the Connection Machine CM-5. 4th ACM Symposium on Parallel Algorithms and Architectures, (1996). revised version. Journal of Parallel and Distributed Computing, Vol. 33, No. 2

1995 ...

Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles Leiserson, Keith H. Randall, Yuli Zhou (1995). Cilk: An Efficient Multithreaded Runtime System. Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pdf
Charles Leiserson, Harald Prokop (1998). A Minicourse on Multithreaded Programming. pdf
Charles Leiserson, Harald Prokop, Keith H. Randall (1998). Using de Bruijn Sequences to Index a 1 in a Computer Word. pdf
Matteo Frigo, Charles Leiserson, Keith H. Randall (1998). The Implementation of the Cilk-5 Multithreaded Language. Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation, pdf
Robert D. Blumofe, Charles Leiserson (1999). Scheduling Multithreaded Computations by Work Stealing. Journal of the ACM, 720–748, September, 1999, pdf

2000 ...

Don Dailey, Charles Leiserson (2001). Using Cilk to Write Multiprocessor Chess Programs. Advances in Computer Games 9, pdf
Thomas H. Cormen, Charles Leiserson, Ronald L. Rivest, Clifford Stein (2001). Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill. ISBN 0-262-53196-8.

2005 ...

Thomas H. Cormen, Charles Leiserson, Ronald L. Rivest, Clifford Stein (2009). Introduction to Algorithms, Third Edition. MIT Press ISBN 0-262-03384-4.
Matteo Frigo, Pablo Halpern, Charles Leiserson, Stephen Lewin-Berlin (2009 ). Reducers and Other Cilk++ Hyperobjects. Cilk Arts, Inc., pdf

External Links

Charles E. Leiserson's homepage
Charles E. Leiserson from Wikipedia
The Mathematics Genealogy Project - Charles Leiserson
Charles Leiserson's ICGA Tournaments
Introduction to Algorithms: WHAT'S NEW in the 3rd Edition? by Charles Leiserson, YouTube Video

References

^ Charles Leiserson's ICGA Tournaments
^ Charles Leiserson, Harald Prokop and Keith H. Randall (1998). Using de Bruijn Sequences to Index a 1 in a Computer Word, pdf
^ Intel Acquires Cilk++ Technology, Dr. Dobb's, August 01, 2009
^ Intel Cilk Plus from Wikipedia
^ Charles E. Leiserson's homepage
^ SuperTech Paper Listing
^ Cilk LESS papers sorted by date

What links here?

Page	Date Edited
ACM 1993	Oct 30, 2017
ACM 1994	May 5, 2017
Advances in Computer Games 9	Nov 15, 2016
Algorithms	May 5, 2017
Aske Plaat	Jun 26, 2017
BitScan	Sep 10, 2017
Bradley Kuszmaul	Oct 12, 2016
Charles Leiserson	Oct 12, 2016
Chris Joerg	Oct 11, 2016
Cilk	Oct 28, 2013
Cilkchess	Jan 21, 2016
Connection Machine	Oct 12, 2016
De Bruijn sequence	Feb 20, 2018
DOCCC 1996	Jun 7, 2016
Don Dailey	Dec 7, 2016
Efficient Generation of Sliding Piece Attacks	Nov 5, 2016
Eric Brewer	Oct 12, 2016
Gibbon	Dec 23, 2014
Harald Prokop	Nov 29, 2017
Hash Table	Jan 1, 2018
Ifrit	Feb 7, 2016
Keith H. Randall	Jun 16, 2015
Mark Bromley	Oct 12, 2016
Massachusetts Institute of Technology	Jan 24, 2017
Mathematician	Apr 9, 2018
Matteo Frigo	Jan 7, 2016
Michael Halbherr	Jun 15, 2015
Nicolaas de Bruijn	Feb 3, 2015
Pablo San Segundo	Feb 25, 2015
Parallel Search	Dec 30, 2017
People	Feb 28, 2018
Queue	Apr 4, 2017
Ramón Galán	Feb 25, 2015
Reid Barton	Jan 7, 2016
Robert Blumofe	Jun 15, 2015
Ronald L. Rivest	Dec 14, 2017
Shared Hash Table	Sep 11, 2017
Stack	Nov 18, 2016
Star Socrates	Oct 12, 2016
StarTech	Oct 20, 2016
Thread	Apr 22, 2018
Vincent Diepeveen	May 5, 2017
WCCC 1995	Jul 12, 2017
WCCC 1999	Jul 13, 2017
Yanjun Zhang	Oct 28, 2013
Yuli Zhou	Jun 15, 2015

Up one level

CHEOPS

GerdIsenberg — Sat, 18 Apr 2015 08:17:23 GMT

Home * Hardware * CHEOPS

		CHEOPS, a Chess-Oriented Processing System with a dedicated chess processor, developed end of the 70s at MIT by John Moussouris, Jack Holloway and Richard Greenblatt, derived from the original conception and design of a 8x8 hardware chess array instrumented by Edward Fredkin. CHEOPS was used by Baisley's Tech 2 and a brute force version of Greenblatt's Mac Hack ^[1], but unfortunately have never competed in computer chess tournaments with this approach. According to Joe Condon and Ken Thompson, already working on a chess hardware for Belle, the problem with CHEOPS was the lack of positional evaluation support ^[2].
Pyramid of Cheops ^[3]

CHARM

CHEOPS had all components of a general purpose processor, in addition to a 16-bit ALU, it had a powerful Chess Array Module (CHARM), which contains a board representation and most of the chess specific logic for attack and move generation including transformation of a piece-list to a hardwired bitboard and from bitboards to a list of squares or moves. Like the ALU, CHARM's input is connected via the ABUS with a 1024-word push down list (PDL). For example CHARM can accept a record from the PDL of the last move tried from a given position, and generate the next possible move in a specified order. In general, the 8x8 CHARM chess array module is to find a specified subset of legal board moves.

The Chess arrays

Each of the 64 squares retains information about the color and type of piece (if any) occupying it. Beside memory to keep the board and pieces, the chess array contains the combinatorial logic for each square, controlled by various signal lines. It may generate attacks and sets of legal moves to one designated destination square, where the output consists of 64 lines which specify which of the 64 squares contain pieces of the moving color which can capture or move to that destination.

Alternatively, a square can be designated as the originating-area, in which case the 64 lines assert possible destinations for moves from this square, a hardwired move target bitboard. Special control bits can cause the array functions to be more specific or general. It can discriminate captures from non-capturing moves, or pawn from noble capture, or cause the entire board to be designated as originating or destination area, so that general questions as "any capture possible?" can be answered in a single operation.

The Array module

The array module consists of a sequential logic to implement the inner loops of typical move generation routines in scanning squares and pieces, in particular it implements the bitboard serialization to convert the 64 square output lines from the chess arrays to an internal list of squares. The BitScan hardware has the 64 square lines and a "last square number" register as input, to generate the number of the next active square line.

Micro-Controller

The sequence of ALU and CHARM operations in CHEOPS is determined by a 1K by 64 bit RAM control memory. Each micro-instruction consists of four 16-bit words. A cycle time of the machine is about 180 nanoseconds. The remainder of the CHEOPS system consists of a PDP-11 and a time shared PDP-10 which communicate with the special processor through a special bus interface.

Publications

John Moussouris, Jack Holloway, Richard Greenblatt (1979). CHEOPS: A Chess-orientated Processing System. Machine Intelligence 9, reprinted (1988) in Computer Chess Compendium

Namesakes

Cheops (CHEss OPponent Simulator) by Tristan Miller ^[4]

External Links

Khufu from Wikipedia
Great Pyramid of Giza from Wikipedia
Project Cheops
Cheops, Pyramid Chess
Pyramid Chess, a three dimensional chess variant
Cheops-ng
Jean-Pierre Houdin - Cheops Revealed (1 of 4), YouTube Video

References

^ John Moussouris, Jack Holloway, Richard Greenblatt (1979). CHEOPS: A Chess-orientated Processing System. Machine Intelligence 9, reprinted (1988) in Computer Chess Compendium
^ Joe Condon and Ken Thompson (1982). Belle Chess Hardware. Advances in Computer Chess 3, Reprinted (1988) in Computer Chess Compendium
^ Great Pyramid of Giza, Photo by Nina Aldin Thune, March 2005, Wikimedia Commons
^ CHEOPS - nothingisreal.com

What links here?

Page	Date Edited
Belle	Jan 18, 2018
Berkeley Chess Microprocessor	May 22, 2013
CHEOPS	Apr 18, 2015
Cheops (Miller)	Jan 13, 2017
Combinatorial Logic	Apr 6, 2017
Computer Chess Compendium	Dec 29, 2015
CXG Sphinx	Jun 23, 2017
Edward Fredkin	Oct 27, 2013
Hardware	Jan 20, 2018
Jack Holloway	Nov 1, 2015
John Moussouris	Nov 1, 2015
Mac Hack	Apr 20, 2018
Move Generation	Jan 29, 2018
PDP-10	Apr 20, 2018
Pharaon	Sep 2, 2017
Richard Greenblatt	Jan 19, 2016
Sfinks	Dec 25, 2017

Up one Level

Chess

GerdIsenberg — Sun, 21 Jan 2018 09:58:00 GMT

Home * Chess

		Chess, a two-player zero-sum abstract strategy board game with perfect information as classified by John von Neumann. Chess has an estimated state-space complexity of 1046 ^[1] , the estimated game tree complexity of 10123 is based on an average branching factor of 35 and an average game length of 80 ply ^[2] . This page is about the basic chess items, chessboard, pieces and moves, and how they are considered or encoded inside a chess program, to either represent a chess position inside its search and to play the game of chess. It sub-pages intersect with evaluation, board representation and even search topics.
Mark Wilkinson, Chess ^[3]

Board and Squares

Pieces and Moves

Color and Side

The Game of Chess

During the Game

The End

Chess Variants

Chess Problems

Chess and Mathematics

Chess Maxima

In 1966, Eero Bonsdorff, Karl Fabel, and Olvai Riihimaa gave 5899 as the maximum number of moves in a chess game ^[5] ^[6] ^[7]
Shirish Chinchalkar has determined a state-space complexity of 1046.25 as upper bound for the number of reachable chess positions ^[8], John Tromp gives about 10^45.888 ^[9] ^[10]
The maximum number of moves per chess position seems 218 ^[11] ^[12]

R6R/3Q4/1Q4Q1/4Q3/2Q4Q/Q4Q2/pp1Q4/kBNN1KB1 w - - 0 1

Chess and Psychology

Chess and Philosophy

Quote from Philosophy Looks at Chess ^[13] :

The game of chess has endured since at least the sixth century. Its earliest variant, the Indian game of Chaturanga, was from the beginning a game for thinkers. Since its inception, scholars, statesmen, strategists, and warriors have been fascinated by the game and its variants. German philosopher Emanuel Lasker and famed French artist Marcel Duchamp were both Grandmasters at chess. Karl Marx played chess avidly, as did Sir Bertrand Russell, Jean-Paul Sartre, and the logical positivist Max Black. Jean-Jacques Rousseau ^[14] mentions in his Confessions that, at the time, he "had another expedient, not less solid, in the game of chess, to which I regularly dedicated, at Maugis's, the evenings on which I did not go to the theater. I became acquainted with M. de Légal, M. Husson, Philidor, and all the great chess players of the day, without making the least improvement in the game." More recently, philosopher Stuart Rachels reports that his father, the late philosopher and prominent ethicist James Rachels, received a bribe from a Russian Grandmaster while he was the chair of the U.S. Chess Federation's Ethics committee.

Chess Programs called Chess

Chess the Northwestern University Chess Program by Larry Atkin and David Slate
Chess 0.5 by Larry Atkin and Peter W. Frey
Chess 0.5X by Wim Elsenaar
Chess 2001, Dedicated Chess Computers
Chess 201x by Filip Höfer
Chess-64 by Fabien Letouzey
Chess 7.0 by Larry Atkin

Publications

1949

Claude Shannon (1949). Programming a Computer for Playing Chess. pdf from The Computer History Museum

1950 ...

Claude Shannon (1950). A Chess-Playing Machine. Scientific American, Vol. 182 (No. 2, February 1950), pp. 48-51. Reprinted in The World of Mathematics, edited by James R. Newman, Simon & Schuster, NY, Vol. 4, 1956, pp. 2124-2133. Included in Part B
J. B. S. Haldane (1952). The mechanical chess-player. British Journal of Philosophy of Science, Vol. 3, No. 10
Alan Turing (1953). Chess. part of the collection Digital Computers Applied to Games. in Bertram Vivian Bowden (editor), Faster Than Thought, a symposium on digital computing machines, reprinted 1988 in Computer Chess Compendium, reprinted 2004 in Chapter 16 of The Essential Turing.

1955 ...

Paul Stein, Stanislaw Ulam (1957). Experiments in chess on electronic computing machines. Chess Review, 13 January 1957.
James Kister, Paul Stein, Stanislaw Ulam, William Walden, Mark Wells (1957). Experiments in Chess. Journal of the ACM, Vol. 4, No. 2
Allen Newell, Cliff Shaw, Herbert Simon (1958). Chess Playing Programs and the Problem of Complexity. IBM Journal of Research and Development, Vol. 4, No. 2, pp. 320-335
Alex Bernstein, Michael de V. Roberts (1958). Computer vs. Chess-Player. Scientific American, Vol. 198, pp. 96-105. pdf from The Computer History Museum, reprinted 1988 in Computer Chess Compendium
Alex Bernstein, Michael de V. Roberts, Timothy Arbuckle, Martin Belsky (1958). A chess playing program for the IBM 704. Proceedings of the 1958 Western Joint Computer Conference, pp. 157-159, Los Angeles, California. pdf from The Computer History Museum

1960 ...

Alan Kotok (1962). A Chess Playing Program for the IBM 7090, B.S. Thesis, MIT, AI Project Memo 41, Computation Center, Cambridge MA. pdf

1965 ...

Jack Good (1968). A Five-Year Plan for Automatic Chess. Machine Intelligence Vol. 2, pp. 110-115
Mikhail Botvinnik (1968). Algoritm igry v shakhmaty. (The algorithm of chess)

1970 ...

Georgy Adelson-Velsky, Vladimir Arlazarov, Alexander Bitman, Alexander Zhivotovsky, Anatoly Uskov (1970). Programming a Computer to Play Chess. Russian Mathematical Surveys, Vol. 25, pp. 221-262.

1975 ...

Ron Atkin, Ian H. Witten (1975). A Multi-Dimensional Approach to Positional Chess. International Journal of Man-Machine Studies, Vol. 7, No. 6
Ron Atkin, William Hartston, Ian H. Witten (1976). Fred CHAMP, Positional-Chess Analyst. International Journal of Man-Machine Studies, Vol. 8, No. 5
Donald Michie (1976). An Advice-Taking System for Computer Chess. Computer Bulletin, Ser. 2, Vol. 10, pp. 12-14. ISSN 0010-4531.

1980 ...

Aviezri Fraenkel, David Lichtenstein (1981). Computing a Perfect Strategy for n x n Chess Requires Time Exponential in N. Journal of Combinatorial Theory, Ser. A, Vol. 31, No. 2

1985 ...

Ingo Althöfer (1985). Das 3-Hirn - Entscheidungsteilung im Schach. Computerschach und Spiele, pp. 20-22 (German)
Ingo Althöfer (1989). A Survey of Some Results in Theoretical Game Tree Search and the 'Dreihirn'-experiment. Proceedings Workshop on New Directions in Game-tree Search, pp. 16-32. Edmonton, Canada.

1990 ...

Ingo Althöfer (1991). Selective trees and majority systems: two experiments with commercial chess computers. Advances in Computer Chess 6
Robert Levinson, Feng-hsiung Hsu, Tony Marsland, Jonathan Schaeffer, David Wilkins (1991). The Role of Chess in Artificial Intelligence Research. IJCAI 1991, pdf, also in ICCA Journal, Vol. 14, No. 3, pp. 153-161, pdf
Fernand Gobet, Peter Jansen (1994). Towards a Chess Program Based on a Model of Human Memory. Advances in Computer Chess 7

1995 ...

Ingo Althöfer (1997). A Symbiosis of Man and Machine Beats Grandmaster Timoshchenko. ICCA Journal, Vol. 20, No. 1
Ingo Althöfer (1997). On the k-best Mode in Computer Chess: Measuring the Similarity of Move Proposals. ICCA Journal, Vol. 20, No. 3
Ingo Althöfer (1998). LIST-3-HIRN vs. Grandmaster Yusupov. - A Report on a Very Experimental Match, Part I: The Games. ICCA Journal, Vol. 21, No. 1
Ingo Althöfer (1998). 13 Jahre 3-Hirn – Meine Schach-Experimente mit Mensch-Maschinen-Kombinationen. ISBN 3-00-003100-6. (German)

2000 ...

Ingo Althöfer (2001). Grandmaster Chess with one-sided Computer Help. ICGA Journal, Vol. 24, No.4
Marek Strejczek (2004). Some aspects of chess programming. Technical University of Łódź, Faculty of Electrical and Electronic Engineering, Department of Computer Science, Supervisor Maciej Szmit, zipped pdf, pdf
Henk Mannen, Marco Wiering (2004). Learning to play chess using TD(λ)-learning with database games. Cognitive Artiﬁcial Intelligence, Utrecht University, Benelearn’04

2005 ...

Fernand Gobet, Peter Jansen (2005). Training in Chess: A Scientific Approach. pdf
Aviezri Fraenkel (2006). Nim is Easy, Chess is Hard – But Why?? ICGA Journal, Vol. 29, No. 4, pdf
Diego Rasskin-Gutman (2009). Chess Metaphors - Artificial Intelligence and the Human Mind. ISBN-13: 978-0-262-18267-6, translated by Deborah Klosky, MIT Press ^[15]
Bernd Blasius, Ralf Tönjes (2009). Zipf's Law in the Popularity Distribution of Chess Openings. Physical Review Letters, 103, 218701, pdf ^[16]
Shay Bushinsky (2009). Deus Ex Machina— A Higher Creative Species in the Game of Chess. AI Magazine, Vol. 30, No. 3 » Machine Creativity ^[17]

2010 ...

Christian Hesse (2011). The Joys of Chess - Heroes, Battles & Brilliancies. ISBN: 978-90-5691-355-7, New In Chess ^[18]
Frédéric Prost (2012). On the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess. Turing-100. The Alan Turing Centenary, EPiC Volume 10
Matej Guid, Ivan Bratko (2012). Detecting Fortresses in Chess. Elektrotehniški vestnik, Vol. 79, Nos. 1-2, pdf » Rybka, Houdini ^[19]
Kristian Spoerer, Toshihisa Okaneya, Kokolo Ikeda, Hiroyuki Iida (2013). Further Investigations of 3-Member Simple Majority Voting for Chess. CG 2013
Katja Grace (2013). Algorithmic Progress in Six Domains. Technical report 2013-3, Machine Intelligence Research Institute, Berkeley, CA, pdf, 5 Game Playing, 5.1 Chess, 5.2 Go, 9 Machine Learning
Nick Pelling (2013). Chess Superminiatures. eBook, Kindle edition, Amazon
John Nunn (2014). Maths and Chess. ICGA Journal, Vol. 37, No. 4
Kenneth W. Regan, Tamal T. Biswas, Jason Zhou (2014). Human and Computer Preferences at Chess. pdf

2015 ...

Tamal T. Biswas, Kenneth W. Regan (2015). Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data. IEEE ICMLA 2015, pdf preprint
Vito Janko, Matej Guid (2015). Development of a Program for Playing Progressive Chess. Advances in Computer Games 14 ^[20]
Guy Haworth, Tamal T. Biswas, Kenneth W. Regan (2015). A Comparative Review of Skill Assessment: Performance, Prediction and Profiling. Advances in Computer Games 14
Muthuraman Chidambaram, Yanjun Qi (2017). Style Transfer Generative Adversarial Networks: Learning to Play Chess Differently. arXiv:1702.06762v1 ^[21] » Neural Networks
Lyudmil Tsvetkov (2017). The Secret of Chess. ^[22]
David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, Timothy Lillicrap, Karen Simonyan, Demis Hassabis (2017). Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm. arXiv:1712.01815 » AlphaZero

Forum Posts

1989

Can Chess Help Adapt to Life? by Mike Valvo, rgc, September 06, 1989

1990 ...

Is chess in NP? by Antti Juhani Ylikoski, rec.games.programmer, May 26, 1997

2000 ...

Does this position blow up your program? by Mike Byrne, CCC, December 23, 2002
Subject: Maximum Number of Legal Moves by Andrew Shapira, CCC, May 08, 2005
Variants and Board Size by Harm Geert Muller, CCC, October 25, 2007

2010 ...

max amount of moves from a position? by Srdja Matovic, CCC, June 10, 2011
Contest: Find Position with the most moves by Charles Roberson, CCC, December 09, 2011
New chess variants by Ferdinand Mosca, CCC, March 03, 2012 » Chess Variants
Chess and the "Golden Ratio"... by Steve Maughan, CCC, December 19, 2012
Chess with incomplete information by Harm Geert Muller, CCC, December 13, 2013

2014

Total possible chess positions? by Matthew R. Brades, CCC, March 26, 2014
for Chess-variant authors by Harm Geert Muller, CCC, September 17, 2014 » Chess Engine Communication Protocol, WinBoard, XBoard
XBoard and chess variants by Evert Glebbeek, CCC, October 28, 2014
UCCI2WB by Harm Geert Muller, CCC, October 27, 2014 » Chinese Chess (Universal Chinese Chess Interface, UCCI)
UCI protocol for chess variants by Evert Glebbeek, CCC, October 28, 2014 » UCI

2015 ...

Most common chess variant? by Stefano Gemma, CCC, April 15, 2015 » Chess Variants
The future of chess and elo ratings by Larry Kaufman, CCC, September 20, 2015 » Match Statistics, Opening Book
Winboard 4.8.0b and Amazon chess variant by Ferdinand Mosca, CCC, December 05, 2015 » WinBoard
Matibay an amazon chess variant engine by Ferdinand Mosca, CCC, December 08, 2015
Masipag, a nightrider chess variant engine by Ferdinand Mosca, CCC, December 09, 2015

2016

Grande Acedrex by Harm Geert Muller, CCC, January 04, 2016
Tamerlane Chess by Harm Geert Muller, CCC, January 28, 2016
New chess variant by Evert Glebbeek, CCC, June 06, 2016 » Chess Variants
Max moves in a position by Laurie Tunnicliffe, CCC, October 22, 2016 » Chess Maxima

2017

Winboard variants online by Erin Dame, CCC, March 22, 2017 » Chess Variants, WinBoard
The Peace-Chess Challenge by Harm Geert Muller, CCC, September 24, 2017 » Chess Variants
Weakly vs strongly solving chess by Greg Simpson, CCC, September 26, 2017
best board representation for variants (javascript) ? by Mahmoud Uthman, CCC, December 10, 2017 » Board Representation, JavaScript

2018

Is modern chess software lossless or lossy? by Meni Rosenfeld, CCC, January 10, 2018 » Playing Strength, Selectivity
Is chess still 99% tactics? by Alvaro Cardoso, CCC, January 11, 2018 » Tactics
A Chess variant with low draw rate by Kai Laskos, CCC, January 19, 2018 » Chess Variants

External Links

Wikipedia

Chess from Wikipedia
Chess theory from Wikipedia
Computer chess from Wikipedia
First-move advantage in chess from Wikipedia
Outline of chess from Wikipedia
Rules of Chess from Wikipedia
School of chess from Wikipedia
Solving chess from Wikipedia
Glossary of chess from Wikipedia

Chess

Chess Variants

Misc

CHESS - Microsoft Research a tool for finding and reproducing Heisenbugs in concurrent programs.
Chess (musical) from Wikipedia
BBC World Service Programmes - The Friday Documentary: Seeking The Endgame, by Simon Terrington, with statements by David Levy et al. ^[23]
BBC - Future - The cyborg chess players that can’t be beaten by Chris Baraniuk, December 04, 2015 » David Levy, Boris Alterman, Shay Bushinsky, Mark Lefler
Mathematics and Chess Page
SFE - The Science Fiction Encyclopedia - Chess
Anthony Braxton Interview - Chess, Math & Music, YouTube Video
Marcel Duchamp on Chess, YouTube Video

References

^ Shirish Chinchalkar (1996). An Upper Bound for the Number of Reachable Positions. ICCA Journal, Vol. 19, No. 3, pp. 181-183
^ Victor Allis (1994). Searching for Solutions in Games and Artificial Intelligence. Ph.D. Thesis, University of Limburg, pdf, 6.3.9 Chess pp. 171
^ Tableaux ayant pour sujet les échecs
^ Seirawan chess from Wikipedia
^ Eero Bonsdorff, Karl Fabel, Olvai Riihimaa (1966) Schach und Zahl - Unterhaltsame Schachmathematik. Seite 11-13, Walter Rau Verlag, Düsseldorf (German)
^ 50-Züge-Regel - Schachmathematik from Wikipedia.de (German)
^ Defending Humanity's Honor by Tim Krabbé, see game NewRival - Faile with 493 moves, and playing 402 moves with bare kings!
^ Shirish Chinchalkar (1996). An Upper Bound for the Number of Reachable Positions. ICCA Journal, Vol. 19, No. 3
^ John's Chess Playground - Number of chess diagrams and positions
^ Re: Total possible chess positions? by Álvaro Begué, CCC, March 26, 2014
^ Does this position blow up your program? by Mike Byrne, CCC, December 23, 2002
^ Subject: Maximum Number of Legal Moves by Andrew Shapira, CCC, May 08, 2005
^ Philosophy Looks at Chess by Benjamin Hale
^ Jean-Jacques Rousseau and Chess by Edward Winter
^ Chess Metaphors – Artificial Intelligence and the Human Mind by Diego Rasskin-Gutman, ChessBase News, January 28, 2010
^ Zipf's law from WIkipedia
^ Machine creativity: what it is and what it isn't by Albert Silver, ChessBase News, August 28, 2016
^ The joys of chess – and the value of the pieces, ChessBase News, December 21, 2011
^ Re: Tony's positional test suite by Louis Zulli, CCC, August 01, 2017
^ Progressive chess from Wikipedia
^ Using GAN to play chess by Evgeniy Zheltonozhskiy, CCC, February 23, 2017
^ The Secret of Chess by Lyudmil Tsvetkov, CCC, August 01, 2017
^ BBC Computer Chess Radio Programme by Harvey Williamson, Hiarcs Forum, September 11, 2010

Up one Level

Wikispaces : chessprogramming - items matching description

18th Computer Olympiad

Table of Contents

Results

19x19

13x13

9x9

11×11

13×13

Shogi

Mini-Shogi

Tori Shogi

Booklet

Reports

Forum Posts

External Links

References

What links here?

8x8 Board

Table of Contents

Alternatives

See also

Publications

Forum Posts

External Links

References

What links here?

Alan Kotok

Table of Contents

See also

Selected Publications

External Links

References

What links here?

Alan Turing

Table of Contents

Photos

Turing Machine

Turing Test

Chess and Go

Could one make a machine?

Andrew Hodges

Jack Good

Punishment and Death

See also

Selected Publications

1936 ...

1940 ...

1950 ...

1990 ...

2000 ...

2010 ...

Forum Posts

External Links

Turing Machine

Devices and Computers

Turing Test

Turing Archive

Andrew Hodges

Literature

Turing Year 2012

Movies

References

What links here?

Albrecht Heeffer

Table of Contents

Photos

Selected Publications

1984

1985 ...

1995 ...

2000 ...

2005 ...

2010 ...

External Links

References

What links here?

AlphaZero

Table of Contents

Description