Wikispaces : chessprogramming - items matching description

Advances in Computer Games 13

GerdIsenberg — Sat, 07 Jan 2017 18:48:07 GMT

Home * Conferences * Advances in Computer Games 13
< Prev Next >

		Advances in Computer Games 13, from November 20 to 22, 2011, Tilburg University, Tilburg ^[1], The Netherlands. In conjunction with the 16th Computer Olympiad, the WCCC 2011, and the WCSC 2011.
The Red Brick, Tilburg University ^[2]

Proceedings

Jaap van den Herik, Aske Plaat (editors) (2012). Advances in Computer Games.
Lecture Notes in Computer Science, 7168
13th International Conference, ACG 2011, Revised Selected Papers

Lectures

Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda (2011). Accelerated UCT and Its Application to Two-Player Games.
Gabriel Van Eyck, Martin Müller (2011). Revisiting Move Groups in Monte-Carlo Tree Search.
Petr Baudiš, Jean-Loup Gailly (2011). Pachi: State of the Art Open Source Go Program.
Hendrik Baier, Mark Winands (2011). Time Management for Monte-Carlo Tree Search in Go.
Richard J. Lorentz (2011). An MCTS Program to Play EinStein Würfelt Nicht!
Jan Stankiewicz, Mark Winands, Jos Uiterwijk (2011). Monte-Carlo Tree Search Enhancements for Havannah.
Pim Nijssen, Mark Winands (2011). Playout Search for Monte-Carlo Tree Search in Multi-Player Games.
Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Hui-Ming Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen (2011). Towards a Solution of 7x7 Go with Meta-MCTS.
Bruno Bouzy, Marc Métivier, Damien Pellier (2011). MCTS Experiments on the Voronoi Game.
Jiao Wang, Shiyuan Li, Jitong Chen, Xin Wei, Huizhan Lv, Xinhe Xu (2011). 4*4-Pattern and Bayesian Learning in Monte-Carlo Go.
I-Chen Wu, Hsin-Ti Tsai, Hung-Hsuan Lin, Yi-Shan Lin, Chieh-Min Chang, Ping-Hung Lin (2011). Temporal Difference Learning for Connect6.
Nikolaos Papahristou, Ioannis Refanidis (2011). Improving Temporal Difference Performance in Backgammon Variants. pdf
Rémi Coulom (2011). CLOP: Confident Local Optimization for Noisy Black-Box Parameter Tuning.
Tomoyuki Kaneko, Kunihito Hoki (2011). Analysis of Evaluation-Function Learning by Comparison of Sibling Nodes.
Todd W. Neller, Steven Hnath (2011). Approximating Optimal Dudo Play with Fixed-Strategy Iteration Counterfactual Regret Minimization.
Kunihito Hoki, Tomoyuki Kaneko (2011). The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search.
Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. » Breakthrough (Game)
Yoshiaki Yamaguchi, Kazunori Yamaguchi, Tetsuro Tanaka, Tomoyuki Kaneko (2011). Infinite Connect-Four Is Solved: Draw.
Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir, David Spies (2011). Blunder Cost in Go and Hex.
Kenneth Wingate Regan, Bartłomiej Macieja, Guy McCrossan Haworth (2011). Understanding Distributions of Chess Performances.
Guy McCrossan Haworth, Árpád Rusz (2011). Position Criticality in Chess Endgames.
Ingo Althöfer (2011). On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness.
Thorsten Ederer, Ulf Lorenz, Thomas Opfer, Jan Wolf (2011). Modeling Games with the Help of Quantified Integer Linear Programs.
Sam Ganzfried (2011). Computing Strong Game-Theoretic Strategies in Jotto.
David L. St-Pierre, Quentin Louveaux, Olivier Teytaud (2011). Online Sparse Bandit for Card Games.
Hung-Jui Chang, Meng-Tsung Tsai, Tsan-sheng Hsu (2011). Game Tree Search with Adaptive Resolution.
Giuseppe Maggiore, Alvise Spanò, Renzo Orsini, Giulia Costantini, Michele Bugliesi, Mohamed Abbadi (2011). Designing Casanova: A Language for Games. ^[3]
Michael Lankes, Thomas Mirlacher (2011). Affective Game Dialogues.
Richard Zhao, Duane Szafron (2011). Generating Believable Virtual Characters Using Behavior Capture and Hidden Markov Models.

Reports

Jaap van den Herik, Aske Plaat (2012). The 13th Advances in Computer Games Conference. ICGA Journal, Vol. 35, No. 1
Ingo Althöfer (2012). Side Report: Popular Video Livestream. ICGA Journal, Vol. 35, No. 1

External Links

Events International Computer Games Association hosted in Tilburg (2011) - Tilburg University
Slides ACG13 Tilburg
ACG13 Photo Gallery
ACG13 - ConfTool Pro - BrowseSessions
Advances in Computer Games 13, 2011 | Facebook by Nikolaos Papahristou
Gaming and AI within Communication and Information Sciences, YouTube Video
Featuring Philip Eijlander, Jaap van den Herik ^[4] ^[5], David Levy, Aske Plaat, Richard Lorentz, I-Chen Wu, and Joke Hellemons

References

What links here?

Page	Date Edited
16th Computer Olympiad	Aug 12, 2017
Abdallah Saffidine	Aug 11, 2017
Advances in Computer Games 12	Jan 5, 2017
Advances in Computer Games 13	Jan 7, 2017
Advances in Computer Games 14	Aug 11, 2017
Akihiro Kishimoto	Jan 22, 2018
Alvise Spanò	May 3, 2014
Árpád Rusz	Oct 9, 2017
Aske Plaat	Jun 26, 2017
Automated Tuning	Feb 27, 2018
Backgammon	Dec 22, 2017
Bartłomiej Macieja	Jun 8, 2015
Breakthrough (Game)	Aug 11, 2017
Bruno Bouzy	Aug 12, 2017
Chang-Shing Lee	Jul 18, 2017
Cheng-Wei Chou	Jul 17, 2017
Chess Problems, Compositions and Studies	Feb 19, 2018
CLOP	Nov 24, 2016
Computer Olympiad	Mar 6, 2018
Conferences	Dec 18, 2017
Connect Four	Jan 31, 2018
Connect6	Jul 22, 2017
Dap Hartmann	Jun 10, 2017
David Levy	Jan 3, 2017
Duane Szafron	Feb 20, 2018
EinStein würfelt nicht!	Aug 11, 2017
Fabien Teytaud	Jul 8, 2016
Games	Feb 20, 2018
Giulia Costantini	May 4, 2014
Giuseppe Maggiore	May 3, 2014
Go	Jan 24, 2018
Guy Haworth	Nov 20, 2017
Hassen Doghmen	Mar 16, 2016
Havannah	Jan 8, 2017
Hendrik Baier	Jan 22, 2018
Hex	Dec 29, 2017
Hung-Hsuan Lin	Jul 22, 2017
Hung-Jui Chang	Jul 16, 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
Jan Wolf	Jul 8, 2016
Jean-Loup Gailly	Nov 27, 2011
Jiao Wang	Jan 3, 2017
Johanna Hellemons	Jan 8, 2017
Jos Uiterwijk	Aug 11, 2017
Junichi Hashimoto	Jan 4, 2017
Kazuki Yoshizoe	May 23, 2016
Kazunori Yamaguchi	Jun 20, 2016
Kenneth Wingate Regan	Feb 19, 2018
Kokolo Ikeda	Mar 15, 2016
Kunihito Hoki	Jul 9, 2016
Languages	Nov 26, 2017
Learning	Feb 20, 2018
Mark Winands	Sep 19, 2017
Martin Müller	Aug 12, 2017
Match Statistics	Mar 31, 2018
MCαβ	Jan 28, 2018
Mei-Hui Wang	Jul 17, 2017
Meng-Tsung Tsai	May 23, 2016
Michele Bugliesi	Jun 2, 2014
Mohamed Abbadi	May 3, 2014
Monte-Carlo Tree Search	Apr 26, 2018
NegaScout	Jul 6, 2016
Nicolas Jouandeau	Jun 29, 2017
Nikolaos Papahristou	Jan 7, 2017
Olivier Teytaud	Jan 7, 2017
Pattern Recognition	Sep 8, 2017
Petr Baudiš	Dec 9, 2017
Pim Nijssen	May 21, 2015
Ping-Chiang Chou	Jul 17, 2017
Ping-Hung Lin	Jul 19, 2017
Playing Strength	Mar 31, 2018
Point Value	Mar 31, 2018
Proof-number search	Jan 22, 2018
Rémi Coulom	Feb 5, 2018
Renzo Orsini	May 3, 2014
Richard J. Lorentz	Aug 11, 2017
Ryan Hayward	Dec 29, 2017
Search	Feb 1, 2018
Shi-Jim Yen	Jul 22, 2017
Shogi	Feb 19, 2018
Takuya Obata	Jan 7, 2017
Temporal Difference Learning	Feb 20, 2018
Tetsuro Tanaka	Oct 25, 2017
Thomas Opfer	May 7, 2014
Thorsten Ederer	Jul 8, 2016
Tilburg University	Jan 7, 2017
Time Management	Mar 20, 2018
Todd W. Neller	Aug 11, 2017
Tomoyuki Kaneko	Oct 25, 2017
Tristan Cazenave	Jan 22, 2018
Tsan-Cheng Su	Jan 8, 2017
Tsan-sheng Hsu	Jul 17, 2017
UCT	Jan 22, 2018
Ulf Lorenz	Dec 22, 2016
WCCC 2011	Jan 7, 2017
WCSC 2011	Jan 7, 2017
Xinhe Xu	Jan 3, 2017
Yoshiaki Yamaguchi	Dec 18, 2016

Up one Level

Aegon 1995

GerdIsenberg — Thu, 06 Apr 2017 18:41:38 GMT

Home * Tournaments * Aegon Tournaments * Aegon 1995
< Prev Next >

The 10th Aegon Man-Machine tournament took place from April 26 to 28, and May 1 to 3, 1995, at Aegon Headquarters in The Hague, Netherlands. After five rounds, Hiarcs had 100% so far even winning from Yasser Seirawan, but lost the final round from John van der Wiel, who then scored 5½ out of 6 and won the tournament. MChess Pro won versus Larry Christiansen, Roberto Cifuentes and Zsuzsa Polgar, to make Marty Hirsch and by his German distributor a bit euphoric ^[1] .

Final Standing

Man vs Computer: 132 - 155 ^[2]

#	Name	C	1	2	3	4	5	6	P	SOS	SoDOS
1	John van der Wiel		88b1	26w1	23b1	4w½	14w1	2b1	5½	23½	21
2	Hiarcs	1	43b1	59w1	29b1	5w1	33b1	1w0	5	23	17½
3	Gert Ligterink		53w1	21b1	35w0	49b1	6w1	14b1	5	22½	19
4	Chess Genius X	2	55w1	67b1	13w1	1b½	15w1	12b½	5	22½	17½
5	Yasser Seirawan		87b1	51w1	8b1	2b0	34w1	19w1	5	22	17
6	MChess Pro	3	66w1	85b1	30b1	11w1	3b0	31w1	5	20	15
7	HiTech	4	74b1	13w0	58b1	29w1	28b1	30w1	5	19	15
8	Mephisto PC-Board	5	86b1	84w1	5w0	66b1	71w1	13b1	5	16½	11½
9	WChess	6	85w½	68b1	72w1	46b1	11b½	48w1	5	16	13
10	Socrates	7	72b1	29w0	60b1	69w1	44b1	56w1	5	15½	12
11	Roberto Cifuentes		41b1	50w1	52b1	6b0	9w½	17b1	4½	23½	16
12	Hans Ree		25b½	45w1	37b½	42w1	40b1	4w½	4½	22½	16¼
13	Nico Kuijf		91w1	7b1	4b0	24w1	37b1	8w0	4	24	14
14	Quest	8	48b1	32w1	56b1	15w1	1b0	3w0	4	23½	13
15	John Nunn		42w1	47b1	20w1	14b0	4b0	37w1	4	23	14
16	David Bronstein		24w1	20b0	63b1	21w0	45w1	39b1	4	21	13
17	Fritz 3	9	28b0	78w1	32b1	36w1	56b1	11w0	4	19½	11½
18	Sofia Polgar		83w½	81b1	38b½	19w½	22b½	34w1	4	19	12¼
19	Rebel	10	68b½	76w1	28w1	18b½	57w1	5b0	4	19	11
20	Zarkov	11	62w1	16w1	15b0	71b½	43w½	46b1	4	18½	12
21	Virtua Chess	12	76w1	3w0	94b1	16b1	31w0	57b1	4	18	9½
22	Chessica	13	58w1	56b0	48w1	68b1	18w½	33w½	4	17½	11¼
23	Zugzwang	14	69b½	62w1	1w0	76b1	29b½	74w1	4	17½	9¼
24	Kallisto	15	16b0	89w1	73w1	13b0	61w1	71b1	4	16	8
25	Nightmare NL	16	12w½	66b0	70w1	92b1	32w½	55b1	4	15½	9½
26	Arthur	17	92b1	1b0	55w0	60w1	75b1	70b1	4	15½	7½
27	Junior	18	67w0	44b0	62b1	73w1	68w1	66b1	4	13½	8½
28	Herman Grooten		17w1	34w½	19b0	50b1	7w0	47b1	3½	22½	11¾
29	Erik Hoeksema		96w1	10b1	2w0	7b0	23w½	49b1	3½	22	10
30	Larry Christiansen		64w1	54b1	6w0	45b½	47w1	7b0	3½	21½	10
31	Zsuzsa Polgar		80w1	39b½	34b0	52w1	21b1	6b0	3½	21	10¾
32	Martin Voorn		82b1	14b0	17w0	51w1	25b½	41w1	3½	20½	10½
33	Heleen de Greef		38b0	88w1	54w1	35b1	2w0	22b½	3½	20½	10
34	Mephisto Genius 68030	19	75w1	28b½	31w1	57w1	5b0	18b0	3½	20½	9¾
35	Mephisto Montreux	20	78w1	36b½	3b1	33w0	46w0	67b1	3½	19	10¾
36	Paul Boersma		63b½	35w½	77b½	17b0	52w1	40w1	3½	18½	10½
37	TASC R30	21	90b1	94w1	12w½	43b1	13w0	15b0	3½	18	7¾
38	The King	22	33w1	57b½	18w½	56w½	48b0	73b1	3½	17½	10
39	Hector 2	23	44w1	31w½	57b0	74b1	67w1	16w0	3½	17	8¾
40	Schach 3.0	24	93w1	73b½	61w1	55b1	12w0	36b0	3½	16	7
41	Gandalf	25	11w0	58b½	93w1	78b1	66w1	32b0	3½	15½	6¼
42	Schaakmeester 2.0	26	15b0	86w1	92b1	12b0	70w½	69w1	3½	15	5½
43	Jessica Harmsen		2w0	80b1	51b1	37w0	20b½	45w½	3	20½	8½
44	John Donaldson		39b0	27w1	47w0	87b1	10w0	64w1	3	19½	8
45	Chessmaster 4000	27	70w1	12b0	67w1	30w½	16b0	43b½	3	19	7¼
46	Lex Jongsma		50w0	77b1	87w1	9w0	35b1	20w0	3	19	7
47	IsiChess	28	61b1	15w0	44b1	75w1	30b0	28w0	3	18½	7½
48	Wim van der Wijk		14w0	96b1	22b0	77w1	38w1	9b0	3	18½	5½
49	Nightmare D	29	73w½	70b½	59b1	3w0	72b1	29w0	3	17	6½
50	Now	30	46b1	11b0	71w½	28w0	60b½	92w1	3	16½	6¼
51	Capture	31	60w1	5b0	43w0	32b0	93w1	85b1	3	16½	5
52	Mephisto Berlin 68020	32	89b1	69w1	11w0	31b0	36b0	90w1	3	16½	5
53	Pandix	33	3b0	55b0	89w1	59w1	69b½	58w½	3	16	6¼
54	Camel	34	71w1	30w0	33b0	61b½	86w1	59w½	3	15½	6
55	Michael Hoving/Oranje		4b0	53w1	26b1	40w0	65b½	25w0	2½	22	8¼
56	Jannes van der Wal		95b1	22w1	14w0	38b½	17w0	10b0	2½	21½	6¾
57	Peewee van Voorthuijsen		79b1	38w½	39w1	34b0	19b0	21w0	2½	20½	7¼
58	Erich Karstan		22b0	41w½	7w0	91b½	80w1	53b½	2½	19	6
59	Ad van den Berg		65w1	2b0	49w0	53b0	81w1	54b½	2½	18½	6
60	Tim Krabbé		51b0	91w1	10w0	26b0	50w½	79b1	2½	18½	5
61	Hebert Perez Garcia		47w0	79b1	40b0	54w½	24b0	77w1	2½	17½	5½
62	Ed Voortmeijer		20b0	23b0	27w0	88w½	87b1	65w1	2½	17½	4¾
63	Saitek Brute Force	35	36w½	93b½	16w0	70b0	76w1	75w½	2½	14½	5¼
64	LChess	36	30b0	74w1	66w0	93b½	89w1	44b0	2½	13	4
65	Diogenes	37	59b0	92w½	85w1	72b½	55w½	62b0	2½	12	4¼
66	Wim van der Pol		6b0	25w1	64b1	8w0	41b0	27w0	2	24	6½
67	Anne Marie Benschop		27b1	4w0	45b0	79w1	39b0	35w0	2	21	6
68	Gert Legemaat		19w½	9w0	82b1	22w0	27b0	81b½	2	21	5
69	Wim Wolthuis		23w½	52b0	81w1	10b0	53w½	42b0	2	20½	5½
70	Fre Hoogendoorn		45b0	49w½	25b0	63w1	42b½	26w0	2	20	5¾
71	Dick van Geet		54b0	95w1	50b½	20w½	8b0	24w0	2	20	4½
72	Ada van der Giessen		10w0	83b1	9b0	65w½	49w0	80b½	2	19½	4¼
73	Nico Vromans		49b½	40w½	24b0	27b0	95w1	38w0	2	19	4¼
74	Esther de Kleuver		7w0	64b0	88b1	39w0	82b1	23b0	2	18½	3½
75	Bert Kieboom		34b0	82w½	83w1	47b0	26w0	63b½	2	17	4¼
76	Henk de Kleijnen		21b0	19b0	96w1	23w0	63b0	95b1	2	15½	1
77	Novag Sapphire	38	84b1	46w0	36w½	48b0	92w½	61b0	2	15	4¼
78	Alexander Münninghoff		35b0	17b0	95w1	41w0	79b0	96w1	2	14	1
79	Saitek President	39	57w0	61w0	84b1	67b0	78w1	60w0	2	13½	4
80	Dappet	40	31b0	43w0	86b½	94w1	58b0	72w½	2	13½	2¾
81	Chess System Tal	41	94b½	18w0	69b0	90w1	59b0	68w½	2	13	3
82	Frenchess	42	32w0	75b½	68w0	85b1	74w0	89b½	2	12½	3¼
83	Centaur	43	18b½	72w0	75b0	86w½	90b0	94w1	2	12	3¾
84	Jos de Waard		77w0	8b0	79w0	95b0	96b1	91w1	2	11½	1½
85	Paul Bierenbroodspot		9b½	6w0	65b0	82w0	88b1	51w0	1½	19	4
86	Gunther Loewenthal		8w0	42b0	80w½	83b½	54b0	87w½	1½	17	2¾
87	Saitek GK 2100	44	5w0	90b1	46b0	44w0	62w0	86b½	1½	16½	2¼
88	Check Check	45	1w0	33b0	74w0	62b½	85w0	93b1	1½	16	2¼
89	Piet Geertsema		52w0	24b0	53b0	96w1	64b0	82w½	1½	14½	1
90	Henny Maliangkay		37w0	87w0	91b½	81b0	83w1	52b0	1½	13½	2¾
91	Mirage	46	13b0	60b0	90w½	58w½	94b½	84b0	1½	13½	2½
92	Rob Hartoch		26w0	65b½	42w0	25w0	77b½	50b0	1	19	2¼
93	Henk Arnoldus		40b0	63w½	41b0	64w½	51b0	88w0	1	16½	2½
94	Jos Timmer		81w½	37b0	21w0	80b0	91w½	83b0	1	15	1¾
95	Bionic	47	56w0	71b0	78b0	84w1	73b0	76w0	1	12½	2
96	Ananse	48	29b0	48w0	76b0	89b0	84w0	78b0	0	14	0

SOS: Sum of Opponent Scores
SoDOS: Sum of Defeated Opponent Scores

Selected Games

[Event "10th AEGON"]
[Site "The Hague NED"]
[Date "1995.05.03"]
[Round "06"]
[White "MChess Pro"]
[Black "Zsuzsa Polgar"]
[Result "1-0"]
 
1.e4 c5 2.Nf3 Nc6 3.d4 cxd4 4.Nxd4 g6 5.Nc3 Bg7 6.Be3 Nf6 7.Bc4 O-O
8.Bb3 a5 9.f3 d5 10.Bxd5 Nxd5 11.Nxd5 f5 12.Nxc6 bxc6 13.Nb6 Rb8
14.Qxd8 Rxd8 15.Rd1 Rxd1+ 16.Kxd1 fxe4 17.Nxc8 Rxc8 18.b3 exf3
19.gxf3 a4 20.Re1 Ra8 21.Re2 Kf7 22.Bc5 e6 23.Rd2 Ke8 24.Ke2 Be5 25.Ke3 g5
26.Ke4 Bf4 27.Rg2 Kf7 28.h4 h6 29.Bb4 Rb8 30.Bc3 Ra8 31.Bd4 Ra5
32.hxg5 hxg5 33.Bc3 Ra8 34.Be5 axb3 35.cxb3 Bxe5 36.Kxe5 Ke7 37.a4 Rb8
38.Rxg5 Rxb3 39.Rg7+ Kd8 40.f4 Rb4 41.a5 Ra4 42.Kxe6 Re4+ 43.Kd6 Rd4+
44.Kxc6 Rxf4 45.a6 Rc4+ 46.Kb5 Rc7 47.Rg8+ Kd7 48.a7 1-0

Game and short analyze on Lichess.org : https://fr.lichess.org/HdCci7jc

[Event "10th AEGON"]
[Site "The Hague NED"]
[Date "1995.05.03"]
[Round "06"]
[White "Hiarcs"]
[Black "John van der Wiel"]
[Result "0-1"]
 
1.e4 e6 2.d4 d5 3.Nc3 Bb4 4.e5 b6 5.Qg4 Bf8 6.Bg5 Qd7 7.h4 h6 8.Bf4 Ba6
9.Bxa6 Nxa6 10.Nf3 Ne7 11.O-O Nf5 12.a3 Nb8 13.h5 Nc6 14.Rfd1 Rg8
15.Kh2 O-O-O 16.b4 Be7 17.Qh3 g5 18.hxg6 fxg6 19.g4 Ng7 20.Bxh6 Rh8
21.b5 Na5 22.Rh1 Rh7 23.Kg2 Rdh8 24.g5 Nf5 25.a4 Nc4 26.Ne2 Bxg5
27.Nxg5 Rxh6 28.Qc3 Qe7 29.Nf3 Qh7 30.Rxh6 Qxh6 31.Neg1 Qf4 32.Kf1 g5
33.a5 bxa5 34.Rxa5 Nxa5 35.Qxa5 Kb8 0-1

Game and short analyze on Lichess.org : https://fr.lichess.org/kA3QEKHU

Publications

Cock de Gorter (1995). The 10th AEGON Computer-Chess Tournament. ICCA Journal, Vol. 18, No. 1
Bart Verbaan (1995). The 10th AEGON Man-Machine Tournament. ICCA Journal, Vol. 18, No. 2
Bob Herschberg, Jaap van den Herik (1995). Aegonics. ICCA Journal, Vol. 18, No. 3, pdf
Larry Kaufman (1995). Aegon Tournament. Computer Chess Reports Vol. 5 No. 2 pp. 4
Joost Buijs (1995). Aegons' Nightmare. Computer Chess Reports Vol. 5 No. 2 pp. 5
Rob van Son (2014). Reviewing the 10th AEGON Computer Chess Tournament (1995!). pdf hosted by Hein Veldhuis

External Links

AEGON Man-Machine Tournaments, old CSVN site
The Aegon Man-Machine Tournaments (1986–1997), Human-computer chess matches from Wikipedia
10th Aegon Human vs Computers The Hague 1995, by Hebert Perez Garcia, YouTube Video ^[3]

References

^ Schach - "Rambos verlieren" Programmierer Marty Hirsch über die Macht der Computer, May 15, 1995, Der Spiegel 20/1995 (German)
^ AEGON Man-Machine Tournaments, old CSVN site
^ Aegon 1995 VIDEO! by Gustavo Mallada, CCC, April 05, 2017

What links here?

Page	Date Edited
Aegon 1994	Mar 26, 2017
Aegon 1995	Apr 6, 2017
Aegon 1996	Jan 22, 2017
Aegon Tournaments	Jan 22, 2017
Bart Verbaan	Nov 3, 2015
Bionic	May 27, 2013
Capture (program)	Jan 8, 2016
Chess System Tal	Jan 13, 2017
Chessica	Nov 22, 2013
Chessmaster	Jan 21, 2018
Cock de Gorter	Nov 3, 2015
GK 2100	Jun 11, 2016
Hans Secelle	Nov 2, 2012
Hector	Nov 11, 2016
ICGA Journal	Dec 21, 2017
Jessica Harmsen	Jul 29, 2012
John Nunn	Dec 9, 2017
Joost Buijs	Dec 19, 2016
Larry Kaufman	Jan 28, 2018
Nightmare NL	Dec 12, 2016
Rob van Son	Dec 27, 2017
Saitek Brute Force	Oct 9, 2015
Saitek President	Jun 11, 2016
Virtua Chess	Jul 3, 2018

Up one Level

Aegon 1997

vincentlejeune — Fri, 07 Apr 2017 09:39:27 GMT

Home * Tournaments * Aegon Tournaments * Aegon 1997
< Prev

		The 12th Aegon Man-Machine tournament took place from April 16 to 18, and 21 to 23, 1997, at Aegon Headquarters in The Hague, Netherlands. Winner with a 100% score was Yona Kosashvili, followed by Yasser Seirawan and Johan van Mil with 5½/6 each. Best programs were Kallisto and Rebel ^[1] with 4½.
Yona Kosashvili 6/6 ^[2]

Final Standing

Man vs Computer: 148½ - 151½ ^[3]

#	Name	C	1	2	3	4	5	6	P	SOS	SoDOS
1	Yona Kosashvili		54w1	13b1	31w1	11b1	5w1	22w1	6	23	23
2	Yasser Seirawan		74b1	15w1	14b½	43w1	4w1	13b1	5½	21½	19½
3	Johan van Mil ^[4]		94b1	62w1	34b1	12w½	29b1	14w1	5½	19	17
4	Kallisto	1	92w1	6w1	17b½	20w1	2b0	27b1	4½	23	15½
5	Rebel ^[5]	2	68w1	50b1	30w½	16b1	1b0	21w1	4½	23	15¼
6	Ye Rongguang		67w1	4b0	23w1	46b1	11w½	55b1	4½	21	14½
7	John van der Wiel		36b1	70w1	43b½	59w1	9b½	19w½	4½	20½	14¾
8	Lembitt Oll		61w1	45b1	11w0	66b½	34w1	44b1	4½	19	13¾
9	Chessmaster 5000	3	77w½	63b½	91w1	50b1	7w½	18b1	4½	17½	13
10	Gert Jan de Boer		96w1	35b½	51w½	15b½	52w1	45b1	4½	17½	12¼
11	Zugzwang	4	79b1	21w1	8b1	1w0	6b½	24w½	4	25	14¾
12	Nimzo	5	49w½	25b1	32w1	3b½	21w0	47b1	4	24	15¼
13	Dragon	6	38b1	1w0	93b1	28b1	16w1	2w0	4	24	12½
14	Cilkchess	7	78w1	27b1	2w½	42b1	18w½	3b0	4	23½	13¼
15	Zarkov	8	81w1	2b0	47w1	10w½	32b½	48b1	4	21½	12
16	Gennadi Timoshchenko		52b1	37w1	44b1	5w0	13b0	46w1	4	21	12½
17	Friso Nijboer		58w1	33b1	4w½	45b0	66w1	35b½	4	20	13
18	Erik Hoeksema		56w1	44b½	33w1	74b1	14b½	9w0	4	20	12
19	The King	9	57w1	53b½	42b0	65w1	30w1	7b½	4	19½	12¾
20	Jonathan Speelman		66w½	86b1	69w1	4b0	31w1	33b½	4	18½	11
21	Rini Kuijf		100w1	11b0	60w1	62w1	12b1	5b0	4	18½	10
22	Chessica	10	75b½	64w½	97b1	38w1	42w1	1b0	4	18	9¾
23	Gandalf	11	42w0	79w1	6b0	77b1	75w1	39w1	4	17	9½
24	Larry Christiansen		82b½	98w1	62b0	37w1	43b1	11b½	4	16	10½
25	David Bronstein		72b1	12w0	46b0	96w1	54w1	67b1	4	16	9
26	Hiarcs	12	63w0	77b½	27w½	64w1	76b1	42b1	4	15½	10¼
27	Heiner Matthias		40b1	14w0	26b½	41w1	51b1	4w0	3½	22½	12
28	Roberto Cifuentes		46b1	43w0	52b1	13w0	70b1	29w½	3½	19	10¼
29	DarkThought	13	91w½	48b½	77w1	30b1	3w0	28b½	3½	19	9½
30	Sofia Polgar		85b1	84w1	5b½	29w0	19b0	62w1	3½	18½	8¾
31	MChess Pro	14	95b1	89w1	1b0	49w½	20b0	65w1	3½	18½	7
32	Peng Zhaoqin		98b½	82w1	12b0	40w1	15w½	58b½	3½	17½	9½
33	Arthur	15	83w1	17w0	18b0	81w1	93b1	20w½	3½	17½	7½
34	TASC R30	16	90b½	75w1	3w0	89b1	8b0	64w1	3½	17½	6¾
35	Fritz	17	65b½	10w½	89b½	48w½	90b1	17w½	3½	17	9¼
36	Ant	18	7w0	81b1	71w½	47b½	63w½	78w1	3½	16½	8
37	WChess	19	87w1	16b0	49w½	24b0	91w1	75b1	3½	16½	7
38	Paul Boersma		13w0	96b1	67w1	22b0	74w1	56b½	3½	16½	7
39	Nico Kuijf		44w0	100b½	54w1	69b1	45w1	23b0	3½	16	8¾
40	Rajah	20	27w0	78b1	76w½	32b0	87w1	63b1	3½	15½	7½
41	Capture	21	64b0	90w½	80b1	27b0	89w1	49b1	3½	14	7¼
42	Gert Ligterink		23b1	51b1	19w1	14w0	22b0	26w0	3	23	11
43	Virtual Chess	22	99w1	28b1 ^[6]	7w½	2b0	24w0	53b½	3	21½	8¼
44	Chess Genius	23	39b1	18w½	16w0	53b½	78b1	8w0	3	21	9
45	IsiChess	24	76b1	8w0	64b1	17w1	39b0	10w0	3	21	8½
46	Saitek Spark	25	28w0	83b1	25w1	6w0	68b1	16b0	3	20½	8½
47	Hans Ree		86b½	55w1	15b0	36w½	59b1	12w0	3	19½	8¾
48	Hebert Perez Garcia		60b1	29w½	74b0	35b½	61w1	15w0	3	19	9½
49	Jeroen Noomen		12b½	69w1	37b½	31b½	58w½	41w0	3	19	9
50	Stefan Löffler		73b1	5w0	72b1	9w0	55b0	74w1	3	19	7
51	Ferret	26	80b1	42w0	10b½	63b1	27w0	71b½	3	18	8
52	Mephisto Atlanta	27	16w0	92b1	28w0	71b1	10b0	89w1	3	17½	5½
53	Rob Hartoch		69b0	19w½	84b1	44w½	62b½	43w½	3	17	8¼
54	Chess System Tal	28	1b0	99w1	39b0	92w1	25b0	99w1	3	17	3½
55	Mephisto Genius	29	97b½	47b0	68w½	83b1	50w1	6w0	3	16	6¾
56	Hector	30	18b0	80w1	65b0	90w½	83b1	38w½	3	15½	6½
57	Jan Joost Lindner		19b0	74w0	85b½	60b½	98w1	66b1	3	14½	6
58	Mephisto Berlin Pro	31	17b0	93w½	95b½	97w1	49b½	32w½	3	14½	5¾
59	TASC R40	32	89b0	65w1	90b1	7b0	47w0	91b1	3	14½	5½
60	Novag Diamond	33	48w0	91b½	21b0	57w½	92b1	90w1	3	14½	5¼
61	Schach 3.0	34	8b0	76w½	79b½	99w1	48b0	93w1	3	14	4½
62	Now	35	71w1	3b0	24w1	21b0	53w½	30b0	2½	22½	8
63	Peewee van Voorthuijsen		26b1	9w½	70b½	51w0	36b½	40w0	2½	21	9¼
64	Gerrit Visser		41w1	22b½	45w0	26b0	85w1	34b0	2½	20	7½
65	Gert Jan Ludden		35w½	59b0	56w1	19b0	73w1	31b0	2½	19½	7¼
66	Diep	36	20b½	97w½	88b1	8w½	17b0	57w0	2½	18½	6¾
67	MacChess Aegon'97	37	6b0	95w1	38b0	76b½	80w1	25w0	2½	17½	4½
68	Dick van Geet		5b0	72w0	55b½	94w1	46w0	82b1	2½	16½	5
69	Shredder	38	53w1	49b0	20b0	39w0	99b1	76w½	2½	16½	5
70	Comet	39	93w1	7b0	63w½	75b½	28w0	79b½	2½	16	4¾
71	Paul Bierenbroodspot		62b0	94w½	36b½	52w0	96b1	51w½	2½	14½	5
72	Mephisto Milano	40	25w0	68b1	50w0	78b0	97b1	88w½	2½	14½	4½
73	Zzzzzz	41	50w0	87b1	75w0	88w1	65b0	92b½	2½	13	4¾
74	Cheiron	42	2w0	57b1	48w1	18w0	38b0	50b0	2	22	6
75	Jeroen Blokhuis		22w½	34b0	73b1	70w½	23b0	37w0	2	20	5¾
76	Henk Arnoldus		45w0	61b½	40b½	67w½	26w0	69b½	2	18½	5¾
77	Mathias Feist		9b½	26w½	29b0	23w0	84w0	100b1	2	18½	4¾
78	Lex Jongsma		14b0	40w0	82b1	72w1	44w0	36b0	2	18½	4½
79	Piet Bakker		11w0	23b0	61w½	98b½	86w½	70w½	2	16½	4¼
80	Ad van den Berg		51w0	56b0	41w0	86b1	67b0	84w1	2	16	4
81	Martin Voorn		15b0	36w0	86w1	33b0	82b0	98w1	2	16	3
82	Centaur	43	24w½	32b0	78w0	95b½	81w1	68w0	2	15½	4¾
83	Maliangkay/Oranje		33b0	46w0	94b1	55w0	56w0	96b1	2	15	2½
84	Dappet	44	88w1	30b0	53w0	87w0	77b1	80b0	2	14½	4
85	Mirage	45	30w0	88b½	57w½	91b½	64b0	95w½	2	14	4
86	Nightmare	46	47w½	20w0	81b0	80w0	79b½	97w1	2	14	3½
87	Fre Hoogendoorn		37b0	73w0	96w0	84b1	40b0	94w1	2	14	3½
88	Tom Fürstenberg		84b0	85w½	66w0	73b0	100w1	72b½	2	12	2¾
89	Frank de Hoog		59w1	31b0	35w½	34w0	41b0	52b0	1½	20	4¾
90	Henk de Kleijnen		34w½	41b½	59w0	56b½	35w0	60b0	1½	19½	5
91	Nico Vromans		29b½	60w½	9b0	85w½	37b0	59w0	1½	19½	4¼
92	Alex Kure		4b0	52w0	98b1	54b0	60w0	73w½	1½	17	2¼
93	Rudy Bloemhard		70b0	58b½	13w0	100b1	33w0	61b0	1½	16½	2
94	Novag Sapphire	47	3w0	71b½	83w0	68b0	95w1	87b0	1½	16	2¾
95	Max Pam		31w0	67b0	58w½	82w½	94b0	85b½	1½	14½	3½
96	XXXX II	48	10b0	38w0	87b1	25b0	71w0	83w0	1	18½	2
97	Peter van Wermeskerken		55w½	66b½	22w0	58b0	72w0	86b0	1	17	2¾
98	Goldbar	49	32w½	24b0	92w0	79w½	57b0	81b0	1	16	2¾
99	Gunther Loewenthal		43b0	54b0	100w1	61b0	69w0	54b0	1	15	½
100	Bionic	50	21b0	39w½	99b0	93w0	88b0	77w0	½	14	1¾

SOS: Sum of Opponent Scores
SoDOS: Sum of Defeated Opponent Scores

Photos & Games

Photos by Thorsten Czub ^[7] , games from the CSVN site ^[8]

Opening Ceremony

On April 16, 1997, Viswanathan Anand and Jan Timman played a clock simultan versus two times six programs, 1½ hours for the whole game plus 30 seconds for each move ^[9] :

	2	1	1	1	1	0
	Genius 5	Kallisto	The King	Hiarcs	Rebel	Fritz 4
Viswanathan Anand	w0	b½	w1	b½	w1	b1	4/6
Jan Timman	b0	w½	b0	w½	b0	w1	2/6


Jan Timman vs Rebel by Ed Schröder		Viswanathan Anand vs Hiarcs by Mark Uniacke ^[10]

[Event "AEGON Chess Tournament, clock simultan"]
[Site "The Hague NED, opening ceremony"]
[Date "1997.04.16"]
[Round "1"]
[White "Rebel 9.0"]
[Black "Jan Timman"]
[Result "1-0"]
 
1. e4 e5 2. Nf3 Nc6 3. Bb5 a6 4. Ba4 Nf6 5. O-O Bc5 6. c3 b5 7. Bb3 d6
8. d4 Bb6 9. dxe5 Nxe5 10. Nxe5 dxe5 11. Qxd8+ Kxd8 12. Bxf7 Ke7 13. Bb3
Bb7 14. Bg5 Rhf8 15. Nd2 h6 16. Bh4 g5 17. Bg3 Rad8 18. Rad1 Rd7 19. Bxe5
Ng4 20. Bg3 Ne3 21. fxe3 Bxe3+ 22. Bf2 1-0

Game and short analyze on Lichess.org : https://fr.lichess.org/B2JUG1AM

[Event "AEGON Chess Tournament, clock simultan"]
[Site "The Hague NED, opening ceremony"]
[Date "1997.04.16"]
[Round "1"]
[White "Hiarcs 5"]
[Black "Viswanathan Anand"]
[Result "1/2-1/2"]
 
1. e4 c5 2. Nf3 d6 3. d4 cxd4 4. Nxd4 Nf6 5. Nc3 g6 6. Be2 Bg7 7. O-O O-O 8. Nb3 Nc6
9. Bg5 Be6 10. Qd2 a6 11. Rad1 b5 12. f3 Nd7 13. Nd5 Re8 14. c4 bxc4 15. Bxc4 a5
16. Be3 a4 17. Nd4 Nxd4 18. Bxd4 Bxd4 19. Qxd4 Rb8 20. f4 Nb6 21. Bb5 Rf8 22. Nb4 Bd7
23. Bc6 Nc8 24. Bxd7 Qxd7 25. Nd5 Qd8 26. Rc1 Nb6 27. Nb4 Rb7 28. f5 Nc8 29. Nd5 Nb6
30. Nc3 Qa8 31. f6 Qd8 32. Rcd1 Qc7 33. fxe7 Qxe7 34. Rf3 Qe5 35. Qxd6 Qxd6 36.Rxd6 Nc4
37. Rd4 Nxb2 38. Nxa4 Nxa4 39. Rxa4 Rc8 40. g4 Kg7 41. Rf2 Rc5 42. h3 h5 43. Kg2 hxg4
44. hxg4 Rc3 45. Rf3 Rc2+ 46. Kg3 Re7 47. Kf4 Rb2 48. Ra5 Re2 49. Re3 Rf2+ 50. Kg3 Rb2
51. g5 Rc7 52. Kf4 Rf2+ 53. Kg4 Rg2+ 54. Rg3 Rf2 55. a3 Rc4 56. Re3 Rc1 57. Rf3 Rg1+
58. Kf4 Rfg2 59. Ra7 Rxg5 60. Ke3 R5g3 61. Rxf7+ Kh6 62. Rxg3 Rxg3+ 63. Rf3 Rg1
64. e5 g5 65. Ke4 g4 66. Rf4 Kg5 67. Rf5+ Kg6 68. Rf8 Kg7 69. Rf4 Kg6 70. a4 g3
71. Rg4+ Kf7 72. Kf3 Ke6 73. Re4 Kf7 74. e6+ Ke7 75. Kg4 g2 76. Kf3 Rf1+
77. Kxg2 Rf6 1/2-1/2

Game and short analyze on Lichess.org : https://fr.lichess.org/xxxohOPl

Woman vs. Machines

Peng Zhaoqin facing Rajah by Valavan Manohararajah

[Event "12th AEGON Man-Mach"]
[Site "The Hague NED"]
[Date "1997.04.21"]
[Round "04"]
[White "Peng Zhaoqin"]
[Black "RAJAH"]
[Result "1-0"]
 
1.d4 Nf6 2.c4 e6 3.Nc3 d5 4.Bg5 Nbd7 5.e3 Be7 6.cxd5 Nxd5 7.Bxe7 Qxe7
8.Bd3 Nxc3 9.bxc3 O-O 10.Qh5 g6 11.Qh6 Nf6 12.Nf3 Qa3 13.O-O Qxc3
14.Rfd1 b6 15.Ng5 Qb2 16.h3 Rb8 17.Rab1 Qc3 18.Rb3 Qc6 19.e4 1-0

Sofia Polgar vs. DarkThought operated by Markus Gille,
Yona Kosashvili and Karsten Bauermeister watching

[Event "12th AEGON Man-Mach"]
[Site "The Hague NED"]
[Date "1997.04.21"]
[Round "04"]
[White "Sofia Polgar"]
[Black "DarkThought"]
[Result "0-1"]
 
1.c4 c6 2.b3 Nf6 3.Bb2 e6 4.Nf3 d5 5.e3 Bb4 6.a3 Be7 7.Qc2 O-O 8.Nc3 Re8
9.d4 Nbd7 10.Be2 Nf8 11.O-O Ng6 12.Rfe1 Bd6 13.e4 dxe4 14.Nxe4 Nf4
15.Bf1 Nxe4 16.Qxe4 Bc7 17.Rad1 Bd7 18.g3 Nh5 19.Ne5 Nf6 20.Qc2 Re7
21.Bg2 Rc8 22.Ba1 Kh8 23.Qb2 Be8 24.f4 Ba5 25.Rf1 Qd6 26.Kh1 Bc7 27.g4 Rb8
28.g5 Nh5 29.Qe2 f6 30.b4 a5 31.Bc3 Qd8 32.gxf6 gxf6 33.d5 exd5 34.cxd5 Rg7
35.Ng4 axb4 36.axb4 Bd7 37.dxc6 bxc6 38.f5 Qf8 39.Bf3 c5 40.Qb2 Rb6
41.Rg1 cxb4 42.Bd4 Bc6 43.Bxc6 Rxc6 44.Qg2 Rc4 45.Qa2 b3 46.Qa1 Rc2
47.Rd3 Qe8 48.Qd1 Qe4+ 0-1

Game and short analyze on Lichess.org : https://fr.lichess.org/h6pZ5SUM

Zugzwang Team

Ye Rongguang vs. Zugzwang operated by Rainer Feldmann

[Event "12th AEGON Man-Mach"]
[Site "The Hague NED"]
[Date "1997.04.22"]
[Round "05"]
[White "Ye Rongguang"]
[Black "ZUGZWANG"]
[Result "1/2-1/2"]
 
1.c4 e5 2.Nc3 Nc6 3.g3 g6 4.Bg2 Bg7 5.d3 d6 6.e3 a5 7.Nge2 Nf6 8.a3 O-O
9.Rb1 Bg4 10.b4 axb4 11.axb4 e4 12.dxe4 Ne5 13.h3 Be6 14.f4 Nxc4 15.O-O Re8
16.Nd4 c6 17.Qd3 d5 18.e5 Nd7 19.g4 Qb6 20.Kh1 Rad8 21.Nxe6 fxe6 22.h4 Ra8
23.g5 Qc7 24.Bh3 Ndb6 25.Qc2 Qe7 26.Qb3 h5 27.Ne2 Qc7 28.Nd4 Qf7 29.Re1 Bf8
30.Nf3 Ra4 31.Qc3 Ra2 32.e4 Bg7 33.exd5 cxd5 34.Ra1 Rxa1 35.Qxa1 Bf8
36.Qb1 Nd7 37.Nd4 Nb8 38.Bf1 Nc6 39.Nxc6 bxc6 40.Bd3 Kh7 41.Bxc4 dxc4
42.Rd1 Qb7 43.Qe4 c3 44.Rd4 Rb8 45.Kh2 c5 46.Qxb7+ Rxb7 47.bxc5 Bxc5
48.Rc4 Rc7 49.Kg2 Bb6 50.Rb4 Rc6 51.Kf1 c2 52.Ke2 Ba5 53.Rb5 Bc7 54.Rb7 Kg8
55.Ra7 Bb6 56.Rd7 Bc7 57.Kd3 Ba5 58.Ke2 Bc7 59.Rd3 Kf8 60.Ra3 Bb6
61.Ra8+ Kg7 62.Ra2 Kf7 63.Ra1 Bc5 64.Ra4 Bg1 65.Ra3 Rc7 66.Rf3 Bd4
67.Kd2 Bb6 68.Ke2 Ba5 69.Ra3 Bb4 70.Rb3 Bc3 71.Ra3 Kf8 72.Ra2 Bd4
73.Ra4 Ba7 74.Ra6 Kf7 75.Rd6 Bc5 76.Rd8 Rc6 77.Rd7+ Kf8 78.Rd3 Be7
79.Rb3 Bd8 80.Rb8 Ke7 81.Rb7+ Kf8 82.Ra7 Be7 83.Kd3 Bc5 84.Ra8+ Kf7
85.Ke2 Kg7 86.Ra4 Bg1 87.Ra3 Rc8 88.Rg3 Bd4 89.Rd3 Bc3 90.Rd7+ Kf8
91.Rd6 Ke7 92.Ra6 Rc7 93.Ra8 Bd4 94.Ra4 Bb6 95.Rb4 Rc6 96.Rb3 Kd7
97.Ra3 Rc5 98.Rd3+ Ke7 99.Rd6 Ba5 100.Ra6 Kf7 101.Ra7+ Bc7 102.Kd3 Rc6
103.Ra2 Bb6 104.Ra6 Ke7 105.Ke2 Kd8 106.Ra8+ Rc8 1/2-1/2

Heiner Matthias vs. Ferret operated by Bruce Moreland

[Event "12th AEGON Man-Mach"]
[Site "The Hague NED"]
[Date "1997.04.22"]
[Round "05"]
[White "FERRET"]
[Black "Heiner Matthias"]
[Result "0-1"]
 
1.e4 c5 2.Nf3 d6 3.d4 cxd4 4.Nxd4 a6 5.Nc3 e6 6.a4 Qc7 7.Bd3 Nf6
8.O-O Be7 9.Qf3 O-O 10.Qg3 Re8 11.Bh6 Bf8 12.a5 Nc6 13.Nxc6 bxc6
14.Bg5 Nd7 15.Rfd1 Rb8 16.b3 Ne5 17.Be2 c5 18.Bf4 Bb7 19.Bxe5 dxe5
20.Bc4 Rbd8 21.f3 g6 22.Qf2 Rxd1+ 23.Nxd1 Be7 24.Nb2 Kg7 25.Qe2 Qc6
26.Nd3 Bd6 27.Rd1 Bc7 28.Qf2 Rd8 29.Ra1 Bd6 30.Kh1 Qc7 31.Qe3 Be7
32.c3 Rd7 33.Kg1 Rd8 34.Ra2 Rc8 35.Kh1 Rd8 36.Ra1 h6 37.Kg1 Rc8
38.Kh1 Rd8 39.Qe2 Ra8 40.Nb2 Qc6 41.Bd3 Bd6 42.Nc4 Bc7 43.Kg1 Rd8
44.Rd1 Rb8 45.Qe3 Rd8 46.Qe2 Rb8 47.Qe3 Ba8 48.Bc2 Bb7 49.Rb1 Rd8
50.Kh1 Rc8 51.b4 cxb4 52.Rxb4 Bd8 53.Bd3 Ba8 54.Rb1 Bc7 55.Qa7 Rd8
56.Be2 h5 57.Bf1 h4 58.Kg1 g5 59.Qe3 Kh6 60.Kh1 f6 61.Kg1 Kg6
62.Re1 Rb8 63.Ra1 Rb5 64.Qe2 Rc5 65.Qd3 Bb7 66.Rb1 Bc8 67.Kh1 Bb7
68.Rb2 Rb5 69.Rxb5 Qxb5 70.Nb6 Qxd3 71.Bxd3 Kf7 72.Bc2 Bxb6 73.axb6
Ke7 74.Kg1 Kd6 75.Kf2 Kc6 76.Ba4+ Kxb6 77.Bd7 a5 78.Bxe6 Ba6 79.g3
hxg3+ 80.hxg3 Kc5 81.Ke3 Bc4 82.Bh3 a4 83.Kd2 a3 84.Kc2 Be2 85.Kb3
Bxf3 86.Bf5 a2 87.Kxa2 Kc4 88.Kb2 Kd3 89.Bd7 Bxe4 90.Kb3 Bd5+
91.Kb4 e4 92.Bb5+ Kd2 93.c4 Be6 94.c5 0-1

Publications

Cock de Gorter (1997). The 12th AEGON Man-Machine Tournament. ICCA Journal, Vol. 20, No. 1
Eric Hallsworth (1997). Aegon, 1997 - Full Report & Games. Selective Search 71, pp. 9, pdf hosted by Mike Watters

Forum Posts

AEGON 1997 :-))))) by pitters, rgcc, February 17 1997
AEGON 1997 breakdown of opponents from their webpage by Lonnie, rgcm, April 11, 1997
AEGON 97/ 1st round: HIARCS lost by Enrico, rgcc, April 16, 1997
AEGON by Frank Meissen, rgcc, April 16, 1997
Fun with Cock de Gorter (sp?) by Tom C. Kerrigan, rgcc, April 16, 1997
AEGON "97" Reports by WFM Yvette Nagel (Rds 1&2) by Lonnie, rgcc, April 18, 1997
Rebel - S. Polgar by Howard Exner, rgcc, April 19, 1997
Rebel At Aegon by Howard Exner, rgcc, April 21, 1997
Aegon tournament conditions by Andreas Mader, rgcc, April 25, 1997
Dark Thought-IM Johan van Mil [2406] * 12st AEGON, Round 5 April 22, 1997 by José Antônio Fabiano Mendes, CCC, October 24, 2000. Game with eval on Lichess
don dailey 1997 at the aegon tournament by Thorsten Czub, CCC, November 23, 2013 » Don Dailey

External Links

AEGON Man-Machine Tournaments, old CSVN site
The Aegon Man-Machine Tournaments (1986–1997), Human-computer chess matches from Wikipedia
Rebel 9.0 at Aegon 1997, 4½ points TPR 2619 by Ed Schröder
Aegon 1996-97 by Thorsten Czub
Aegon Human-Computer Championship 1997, YouTube Video ^[11] ^[12]

References

^ Rebel 9.0 at Aegon 1997, 4½ points TPR 2619 by Ed Schröder
^ Aegon 1996-97 by Thorsten Czub
^ AEGON Man-Machine Tournaments, old CSVN site
^ Dark Thought-IM Johan van Mil [2406] * 12st AEGON, Round 5 April 22, 1997 by José Antônio Fabiano Mendes, CCC, October 24, 2000
^ Rebel - S. Polgar by Howard Exner, rgcc, April 19, 1997
^ AEGON (2): Virtual Chess defeated GM Cifuentes by Enrico, rgcc, April 17, 1997
^ Aegon 1996-97 by Thorsten Czub
^ CSVN Downloads Games Aegon Tournaments
^ Rebel 9.0 at Aegon 1997, 4½ points TPR 2619 by Ed Schröder
^ Hiarcs Fan Page by Thorsten Czub
^ Historic video's hosted by Ed Schröder
^ A couple of new historic video's by Ed Schröder, CCC, Mar 17, 2013

What links here?

Page	Date Edited
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Aegon Tournaments	Jan 22, 2017
Andreas Mader	Dec 30, 2017
Ant	Jun 1, 2015
Bionic	May 27, 2013
Capture (program)	Jan 8, 2016
Chess System Tal	Jan 13, 2017
Chessica	Nov 22, 2013
Chrilly Donninger	Dec 19, 2016
Cock de Gorter	Nov 3, 2015
Dan Wulff	Jun 25, 2016
DarkThought	Jul 3, 2018
David Bronstein	Oct 28, 2014
Don Dailey	Dec 7, 2016
Dragon RU	Jan 8, 2016
Ed Schroder	Feb 26, 2018
Gandalf	Jan 21, 2018
Hans Secelle	Nov 2, 2012
Hector	Nov 11, 2016
Heiner Matthias	Mar 8, 2016
Hiarcs	Feb 25, 2018
ICGA Journal	Dec 21, 2017
Iterative Deepening	Jun 23, 2017
Jeroen Noomen	Jul 21, 2017
José Antônio Fabiano Mendes	Feb 25, 2014
Kallisto	Oct 28, 2017
MacChess	Oct 28, 2013
Marc-François Baudot	Jan 7, 2016
Mark Uniacke	Dec 12, 2016
Markus Gille	May 15, 2016
Mathias Feist	Aug 27, 2016
Mirage	Jul 12, 2016
Nico Kuijf	Jul 16, 2017
Nightmare NL	Dec 12, 2016
Nimzo	Dec 30, 2017
Rajah	Sep 12, 2012
Roland Pfister	Apr 5, 2017
Schach	Jan 7, 2016
Stefan Löffler	Dec 29, 2016
Sylvain Renard	Feb 27, 2018
Tasc R30	Sep 7, 2017
Tasc R40	Sep 7, 2017
Tom Fürstenberg	May 23, 2016
Ulrich Türke	Jan 8, 2016
Valavan Manohararajah	May 4, 2017
Videos	Jan 22, 2018
Virtual Chess	Mar 25, 2017
Vladimir Rybinkin	Jan 8, 2016
Wim van Beusekom	Oct 28, 2013
XXXX	Jan 7, 2016
Yuri Shpeer	Jan 8, 2016
Zugzwang (Program)	Dec 19, 2016
Zzzzzz	May 14, 2016

Up one Level

Alex Bernstein

GerdIsenberg — Sat, 02 Jan 2016 15:53:00 GMT

Home * People * Alex Bernstein

		Alex Bernstein, an American mathematician, chess player and IBM employee. Along with his colleagues Michael de V. Roberts, Timothy Arbuckle and Martin Belsky, Alex Bernstein was primary author of the Bernstein Chess Program for the IBM 704.
Alex Bernstein ^[1]

Quotes

Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955 ^[2]:

Chess programs catch some of the human chess playing abilities but rely on the limited effective branching of the chess move tree. The ideas that work for chess are inadequate for go. Alpha-beta pruning characterizes human play, but it wasn't noticed by early chess programmers - Turing, Shannon, Pasta and Ulam, and Bernstein. We humans are not very good at identifying the heuristics we ourselves use. Approximations to alpha-beta used by Samuel, Newell and Simon, McCarthy. Proved equivalent to minimax by Hart and Levin, independently by Brudno. Knuth gives details.

Publications

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 (1958). A Chess Playing Program for the IBM 704. Chess Review July 1958, pdf from The Computer History Museum
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

External Links

Alex Bernstein from The Computer History Museum
Photos by Andreas Feininger, Getty Images
Chess Pieces - IBM Research the Deep Blue site
Alex Bernstein: juega al ajedrez con un IBM 704 (Thinking Machines) YouTube Video

References

^ Image captured from Alex Bernstein: juega al ajedrez con un IBM 704 (Thinking Machines) YouTube Video at 0:13
^ John McCarthy Human-Level AI is harder than it seemed in 1955

What links here?

Page	Date Edited
Alex Bernstein	Jan 2, 2016
Chess	Jan 21, 2018
Computer Chess Compendium	Dec 29, 2015
Entering Moves	Sep 7, 2017
History	Jan 2, 2018
IBM 704	Jan 2, 2016
Martin Belsky	Jul 25, 2016
Michael de V. Roberts	Jan 2, 2016
Nathaniel Rochester	Oct 26, 2016
People	Feb 28, 2018
Quote McCarthy	Sep 10, 2013
Scientific American	Jun 5, 2017
The Bernstein Chess Program	Jan 2, 2016
Timothy Arbuckle	Oct 30, 2013
Type B Strategy	Jul 19, 2016

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

Azlan Iqbal

GerdIsenberg — Sat, 15 Jul 2017 11:35:09 GMT

Home * People * Azlan Iqbal

		Mohammed Azlan Bin Mohamed Iqbal, a Malaysian computer scientist and Senior Lecturer at College of Information Technology, Universiti Tenaga Nasional in Kajang, Selangor, Malaysia. Azlan Iqbal's research interests focus on Multimedia Systems and the Artificial Intelligence topic of Computational Aesthetics ^[1]. He has a Bachelor's and a Master's degree in Computer Science from Universiti Putra Malaysia, and made his Ph.D. in 2008 on A Discrete Computational Aesthetics Model for a Zero-Sum Perfect Information Game at the University of Malaya, Kuala Lumpur, Malaysia ^[2], and various of his papers on Computational Aesthetics of the Game of Chess were published in the ICGA Journal. He developed a computational chess aesthetics model and incorporated it into a computer program called Chesthetica that can be used to automatically evaluate the beauty of thousands of three-move chess problems in a way that correlates well with human assessment ^[3].
Azlan Iqbal ^[4]

See also

Selected Publications

Selected Publications

^[5] ^[6]

2006 ...

Azlan Iqbal, Mashkuri Yaacob (2006). A Systematic and Discrete View of Aesthetics in Chess, Journal of Comparative Literature and Aesthetics, Vol. XXIX, Nos. 1-2
Azlan Iqbal (2006). Is Aesthetics Computable? ICGA Journal, Vol. 29, No. 1, pdf
Azlan Iqbal (2008). Evaluation of Economy in a Zero-sum Perfect Information Game. Comput. J. 51 No. 4
Azlan Iqbal, Mashkuri Yaacob (2008). Theme Detection and Evaluation in Chess. ICGA Journal, Vol. 31, No. 2
Mohammed Azlan Bin Mohamed Iqbal (2008). A Discrete Computational Aesthetics Model for a Zero-Sum Perfect Information Game, Ph.D. Thesis, University of Malaya, Kuala Lumpur, Malaysia, pdf
Azlan Iqbal, Mashkuri Yaacob (2008). Advanced Computer Recognition of Aesthetics in the Game of Chess, WSEAS Transactions on Computers, Vol. 7, Issue 5, pdf

2010 ...

Azlan Iqbal (2010). What Computer Chess Still Has to Teach Us: The Game that Will not Go, electronic Journal of Computer Science and Information Technology (eJCSIT), Vol. 2, No. 1, pdf link
Azlan Iqbal, Harold van der Heijden, Matej Guid (2010). Research Grant to Investigate Multi-Dimensional Aesthetic Perception using Endgame Studies. EG, Alexander Rueb Vereniging voor Schaakeindspelstudie (ARVES), No. 180, Vol. XVI
Azlan Iqbal (2010). Aesthetics in Mate-In-3 Combinations, Part I Combinatorics and Weights, ICGA Journal, Vol. 33, No. 3
Azlan Iqbal (2010). Aesthetics in Mate-In-3 Combinations, Part II Normality, ICGA Journal, Vol. 33, No. 4
Azlan Iqbal (2011). Increasing Efficiency and Quality in the Automatic Composition of Three-Move Mate Problems. Entertainment Computing - ICEC 2011, Lecture Notes in Computer Science, Vol. 6972, Springer
Azlan Iqbal, Harold van der Heijden, Matej Guid, Ali Makhmali (2012). Evaluating the Aesthetics of Endgame Studies: A Computational Model of Human Aesthetic Perception. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 4, No. 3 ^[7]

2015 ...

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
Paul Bonham, Azlan Iqbal (2017). A Chain-Detection Algorithm for Two-Dimensional Grids. arXiv:1610.03573 ^[8]

ChessBase Articles

2009

Can computers be made to appreciate beauty? by Frederic Friedel, ChessBase News, September 02, 2009

2010 ...

A computer program to identify beauty in problems and studies by Azlan Iqbal, ChessBase News, December 15, 2012
A new, challenging chess variant by Azlan Iqbal, ChessBase News, February 02, 2014
Kasparov in Malaysia by Azlan Iqbal, ChessBase News, May 11, 2014
Introducing ‘Chess Constructs’ by Azlan Iqbal, ChessBase News, June 29, 2014
A machine that composes chess problems’ by Azlan Iqbal, ChessBase News, November 07, 2014

2015 ...

Computer generated chess problems for everyone by Azlan Iqbal, ChessBase News, February 06, 2015
Switch-Side Chain-Chess Revisited by Azlan Iqbal, ChessBase News, April 07, 2015
Celebrating 300 machine generated problems by Azlan Iqbal, ChessBase News, May 31, 2015
Chesthetica Composes Longer Mates! by Azlan Iqbal, ChessBase News, September 07, 2015
Chesthetica: Studies and a Decade in Development by Azlan Iqbal, ChessBase News, May 31, 2016
What is Switch-Side Chain-Chess? by Azlan Iqbal, ChessBase News, July 13, 2017 » Chain-Detection Algorithm

External Links

Mohammed Azlan Bin Mohamed Iqbal at Universiti Tenaga Nasional
Azlan Iqbal - YouTube
Computer Generated Chess Problem 00146, YouTube Video

References

^ Chess aesthetics from Wikipedia
^ Mohammed Azlan Bin Mohamed Iqbal (2008). A Discrete Computational Aesthetics Model for a Zero-Sum Perfect Information Game, Ph.D. Thesis, University of Malaya, Kuala Lumpur, Malaysia, pdf
^ A machine that composes chess problems’ by Azlan Iqbal, ChessBase News, November 07, 2014
^ Mohammed Azlan Bin Mohamed Iqbal at Universiti Tenaga Nasional
^ DBLP: Azlan Iqbal
^ Dr. Mohammed Azlan Bin Mohamed Iqbal (Publications and Research Grants)
^ A computer program to identify beauty in problems and studies, ChessBase News, December 15, 2012
^ Chain detection algorithm by Jorge Garcia, CCC, July 13, 2017

What links here?

Page	Date Edited
Ali Makhmali	Dec 24, 2013
Artificial Intelligence	Apr 9, 2018
Azlan Iqbal	Jul 15, 2017
Checkmate	Apr 13, 2018
Chess Problems, Compositions and Studies	Feb 19, 2018
Cognition	Dec 8, 2017
Combination	Oct 25, 2016
Emil Vlasák	Sep 30, 2015
Frederic Friedel	Jan 6, 2018
Harold van der Heijden	Jan 8, 2014
ICGA Journal	Dec 21, 2017
Jana Krivec	Jul 15, 2017
Mashkuri Yaacob	Aug 29, 2013
Matej Guid	Jan 6, 2018
People	Feb 28, 2018

Up one level

CHEKMO-II

GerdIsenberg — Wed, 03 Jan 2018 09:33:16 GMT

Home * Engines * CHEKMO-II

CHEKMO-II, (CheckMo-II)
the classical chess program for the PDP-8, written in the 70s by Digital Equipment Corporation instructor John E. Comeau in PAL-8, the PDP-8 assembly.

Abstract

^[1] ^[2]:

CHEKMO-II is a chess playing program which will run on any PDP-8 family computer. The program will play either the white pieces or the black pieces, and will play and accept all classes of legal moves, including castling both short and long, en passant pawn captures, and pawn promoting moves to any legal promotion piece. The program prints out its moves in Algebraic Notation, and accepts moves using Algebraic Notation. Included in the command structure of the program are commands which allow you to input board positions using Forsyth Notation, and get a printout of the board at your terminal.

Known Deficiencies

^[3]

CHEKMO-II has been programed to use the same strategy throughout the game. This strategy has been optimized for good play in the Middlegame, and Opening. As a result CHEKMO-II plays poor moves in some Endgame positions. If either the white side or the black side becomes significantly more powerful than the other (about 4 queens) CHEKMO-II may play some strange, but legal moves. This is caused by overflow in an internal evaluator routine.

Forum Posts

More PDP-8 Software Donated to the RICM by Klemens Krause, alt.sys.pdp8, July 5, 2011

External Links

PDP-8 Chess (CHEKMO-II) Instructions ^[4]
Norbert's Emulators | The Atari PDP-8 Emulator | b) Chess program CHEKMO-II
File View: `Chekmo II (19xx)(Comeau, John E.).zip' for `DEC PDP-8'
Classic Computer Chess - ... The programs of yesteryear by Carey, hosted by the Internet Archive ^[5]
PDP-8 - Presentation No. 3, The National Museum of Computing, YouTube Video

References

^ DECUS Program Library PDP-8 Catalog 1978 (pdf)
^ PDP-8 Chess (CHEKMO-II) Instructions
^ PDP-8 Chess (CHEKMO-II) Instructions
^ CHEKMO-II German manual (pdf)
^ Re: Old programs CHAOS and USC by Dann Corbit, CCC, July 11, 2015

What links here?

Page	Date Edited
CHEKMO-II	Jan 3, 2018
CLI	Jan 20, 2018
Engines	Mar 10, 2018
John E. Comeau	Apr 7, 2012
PDP-8	Jan 5, 2016
QCHESS	Nov 21, 2015

Up one level

Chess for Android

GerdIsenberg — Thu, 01 Mar 2018 18:12:58 GMT

Home * User Interface * GUI * Chess for Android
Home * Engines * Chess for Android

		Chess for Android, written by Aart Bik, is a standalone chess application for Android. The application is available for free at the Android Market ^[1] or as direct download ^[2] and consists of a chess engine (a Java version derived from the UCI engine BikJump that is written in C++) and a GUI. The application accepts moves through the touchscreen, the trackball, or through the keyboard (e2e4 pushes the king pawn, e1g1 castles king side, etc.). An optional "move coach" highlights valid user moves during input and last played engine move. Full game navigation buttons enable users to correct mistakes or analyze games. Games import and export as FEN/PGN to and from the clipboard, load and save as file, are set up through a position editor, or import as application/x-chess-pgn MIME type on startup. A draw by stalemate, insufficient material, the fifty move rule, or threefold repetition is recognized. The engine plays at various levels (including random, against itself in auto-play, or free-play, where the game can be used as a "magnetic chessboard"). The user can play either side and, independently, view the board from the perspective of white or black. The application also supports the Universal Chess Interface (UCI) and Chess Engine Communication Protocol (often simply called WinBoard or XBoard protocol), which allows users to play against more powerful third party engines or even play tournaments between engines. Engine setup features pondering, infinite analysis, hash tables, multiple threads, endgame tablebases (Nalimov , Gaviota, Scorpio, Robbobases), and opening test suites. Chess for Android recognizes all ChessBase compatible engines that are installed on the same device. Since version 5.6 released in February 2018 ^[3], Chess for Android supports the electronic chess board of the Millennium ChessGenius ^[4].
Chess for Android on a Tablet

Images

Screenshot of latest version

Setup Position

Screenshot of older G1 version

Forum Posts

2008 ...

Chess for Android by Aart Bik, CCC, November 24, 2008
Upcoming Chess for Android 2.0 by Aart Bik, CCC, October 19, 2009

2010 ...

Chess for Android with UCI support released by Aart Bik, CCC, August 23, 2010
Chess for Android with UCI support released by Aart Bik, OpenChess Forum, August 23, 2010
Chess for Android 2.5 by Aart Bik, CCC, January 05, 2011
Chess for Android 2.8 by Aart Bik, CCC, April 01, 2011
Chess for Android 3.0.2: enhanced XBoard support by Aart Bik, CCC, October 24, 2011
Chess for Android upcoming network feature by Aart Bik, CCC, July 03, 2012
Chess for Android v4.1.5: sharing by Aart Bik, CCC, January 12, 2013

2015 ...

Chess for Android by Patrice Duhamel, CCC, January 04, 2015 » Cheese
Chess for Android v5.0: Time Control by Aart Bik, CCC, January 09, 2015
Chess on Android by Pedro Castro, CCC, April 19, 2016 » Chess Engine Communication Protocol, DanaSah
New Chess Graphics for Chess for Android by Aart Bik, CCC, October 13, 2016
Chess for Android v5.3 by Aart Bik, CCC, November 27, 2017
Chess for Android v5.4: adjudication by Aart Bik, CCC, December 18, 2017
Chess for Android v5.6 by Aart Bik, CCC, February 26, 2018
Re: Chess for Android v5.6 by Aart Bik, CCC, February 28, 2018 » Millennium ChessGenius

External Links

References

^ Android Market - Apps by Aart Bik
^ Download Chess for Android
^ Re: Chess for Android v5.6 by Aart Bik, CCC, February 28, 2018
^ Connecting Chess for Android with the Millennium » Millennium ChessGenius

What links here?

Page	Date Edited
chessmateapp : ChessMateResources	May 28, 2014
Aart Bik	Mar 1, 2018
Algebraic Chess Notation	Sep 25, 2017
Android	Jan 9, 2018
Android-Chess	Jun 2, 2016
BikJump	Aug 11, 2014
Cheese	Feb 17, 2018
Chess Engine Communication Protocol	Mar 4, 2018
Chess for Android	Mar 1, 2018
Chess for Glass	Dec 26, 2016
DanaSah	Oct 9, 2017
DroidFish	Jan 17, 2017
Engines	Mar 10, 2018
Entering Moves	Sep 7, 2017
Greko	Feb 27, 2018
GUI	Mar 16, 2018
Jazz	Oct 4, 2017
Komodo	Mar 6, 2018
Mathematician	Apr 9, 2018
Millennium ChessGenius	Mar 1, 2018
Pedro Castro	Apr 19, 2016
SolusChess	Apr 21, 2015
UCI	Mar 4, 2018

Up one Level

Chess Genius

GerdIsenberg — Mon, 26 Feb 2018 15:59:40 GMT

Home * Engines * Chess Genius

		Chess Genius (ChessGenius), a series of chess engines by Richard Lang, written in assembly for various processor architectures such as Motorola 68000 and Intel 8086 and x86, and successor of Lang's dedicated 68000 based Mephisto Vancouver program incorporating small improvements, the 8086 version first released in 1992 as PC program running under 16-bit MS-DOS ^[1]. Chess Genius 2 won the manufacturers and Absolute World Microcomputer Chess Champion titles at the WMCCC 1993 running on the PC based Mephisto Wundermaschine, and was also shipped as Mephisto Genius 68030 module for Mephisto module systems. Chess Genius 4 in 1995 became a 16-bit Windows program ^[2] with a GUI developed by Adrian Millett ^[3] written in C ^[4], which further evolved to a multi-engine GUI via Chess Genius 6 (6.5) to the Millennium Chess System ^[5], and the Chess Genius Classic GUI ^[6]. Chess Genius was further ported to various PDA and mobile platforms, such as Palm and Apple's iPhone, iPod touch, and iPad on the iTunes Store ^[7] , as well as Android. In November 2015, Chess Genius, ported to the ARM Cortex-M processor, was released as dedicated Millennium ChessGenius.
Chess Genius for DOS ^[8]

Screenshots


Chess Genius Classic 7.1 for Windows ^[9]		ChessGenius for Android ^[10]

Intel Grand Prix

In 1994, during the Intel Grand Prix Cycle ^[11] in London, Chess Genius 3, operated by Ossi Weiner, won a speed chess game (25-minutes per side) against Garry Kasparov ^[12] and drew the second game, knocking Kasparov out of the tournament. This was the first match that Kasparov ever lost to a computer. In the next round, Genius then beat Predrag Nikolić, but then lost to Viswanathan Anand ^[13] ^[14] ^[15] ^[16] .

[Event "Intel Chess Grand Prix"]
[Site "London (England)"]
[Date "1994.08.12"]
[Round "1"]
[White "Garry Kasparov"]
[Black "Chess Genius"]
[Result "0-1"]
 
1.c4 c6 2.d4 d5 3.Nf3 Nf6 4.Qc2 dxc4 5.Qxc4 Bf5 6.Nc3 Nbd7 7.g3 e6 8.Bg2 Be7
9.O-O O-O 10.e3 Ne4 11.Qe2 Qb6 12.Rd1 Rad8 13.Ne1 Ndf6 14.Nxe4 Nxe4 15.f3 Nd6
16.a4 Qb3 17.e4 Bg6 18.Rd3 Qb4 19.b3 Nc8 20.Nc2 Qb6 21.Bf4 c5 22.Be3 cxd4
23.Nxd4 Bc5 24.Rad1 e5 25.Nc2 Rxd3 26.Qxd3 Ne7 27.b4 Bxe3+ 28.Qxe3 Rd8 29.Rxd8+
Qxd8 30.Bf1 b6 31.Qc3 f6 32.Bc4+ Bf7 33.Ne3 Qd4 34.Bxf7+ Kxf7 35.Qb3+ Kf8
36.Kg2 Qd2+ 37.Kh3 Qe2 38.Ng2 h5 39.Qe3 Qc4 40.Qd2 Qe6+ 41.g4 hxg4 42.fxg4 Qc4
43.Qe1 Qb3+ 44.Ne3 Qd3 45.Kg3 Qxe4 46.Qd2 Qf4+ 47.Kg2 Qd4 48.Qxd4 exd4 49.Nc4
Nc6 50.b5 Ne5 51.Nd6 d3 52.Kf2 Nxg4+ 53.Ke1 Nxh2 54.Kd2 Nf3+ 55.Kxd3 Ke7 56.Nf5+
Kf7 57.Ke4 Nd2+ 58.Kd5 g5 59.Nd6+ Kg6 60.Kd4 Nb3+ 0-1

Game and short analyze on Lichess.org : https://fr.lichess.org/BhO7GmBH

Instances

Publications

Eric Hallsworth (1992). Chess Genius. Selective Search 43, pp. 7, pdf hosted by Mike Watters
Richard Lang (1995). Chess Genius 4. Computer Chess Reports Vol. 5 No. 3+4, pp. 80
Paul Wiereyn (1997). Genius-3 Cooked Endgame Studies. ICCA Journal, Vol. 20, No. 3

Forum Posts

1993 ...

Chess Genius by Roy Eassa, rgc, March 08, 1993
Chess Genius by Ray Helie, rgc, June 08, 1993
New programs released! by Ralf Stephan, rgc, October 10, 1993 » Gideon
Chess Genius 2.0 by Murat Saygin, rgc, December 18, 1993
Mephisto Genius 3.0 - A bit of info by Franz Hemmer, rgc, October 02, 1994
cg by Pc Solutions, rgc, December 29, 1994

1995 ...

Genius 4 is a Windows program by Andy Duplain, rgcc, November 24, 1995
Win95/genius 4 users note by PC SOL, rgcc, March 30, 1996
Chess Genius 3.0--->4.0 Upgrade by Daniel Chinn, rgcc, August 07, 1996
Genius 5 (DOS us Windows) by Hansjoerg Zech, rgcc, December 11, 1996
Genius isn't sensitive enough? by Serge Desmarais, rgcc, April 16, 1997
Genius' asymmetric-search by example: TRY yourself by Thorsten Czub, rgcc, December 30, 1997
Chess Genius 5 by Frank Nelson, rgcc, April 18, 1998
Opinions on Genius 5.0 by barry, rgcc, April 18, 1998
CG6 --- integration of all chess engines -- good or bad?! by Lonnie, rgcc, November 03, 1998 » Millennium Chess System
Genius 6 Questions by Chessnut, rgcc, February 20, 1999
Re: Chess Genius 6.5 by Pc Solutions, rgcc, November 24, 1999 » Shredder, Millennium Chess System
Genius 6.5 - Is it an improvement? by Albert Silver, CCC, November 25, 1999

2000 ...

Re. Genius on Palm / Richard Lang the return by Steve Maughan, CCC, February 09, 2000
Genius 6.5 vs. 6.0/6.1 vs. 5 by Roy Eassa, CCC, December 07, 2000
Genius2 is clearly a legal free program by Uri Blass, CCC, April 09, 2001
Genius strongest version? by Jonas Cohonas, CCC, July 09, 2002
Chess Genius 7 Engine by James Constance, CCC, November 02, 2002
Is Genius the only asymmetry program out there? by Dana Turnmire, CCC, October 08, 2003
Re: Is Genius the only asymmetry program out there? by Christophe Théron, CCC, October 08, 2003
Chess Genius 5 question by Murat, CCC, December 29, 2004

2005 ...

Asymmetry in Genius? by Vladimir Medvedev, CCC, September 15, 2005 ^[17]
Chess Genius Classic 7 by adam wilks, CCC, December 16, 2005
Question about ChessGenius for Symbian OS by Vikrant Malvankar, CCC, December 19, 2005
Richard Lang Give me Some News by Fernando Villegas, CCC, June 01, 2007
Who is testing Genius 7? by Marek Soszynski, CCC, December 21, 2007
ChessGenius Classic 7.200e Download by Norbert Raimund Leisner, CCC, July 23, 2008
ChessGenius for the iPhone by Bryan Whitby, CCC, October 22, 2008

2010 ...

Strength of Chess Genius Classic by Gerald Grimsley, CCC, October 06, 2010
Re: Some thoughts on QS by Don Dailey, CCC, July 24, 2012 » Quiescence Search
ChessGenius for Windows 8 by Norbert Raimund Leisner, CCC, May 12, 2013
Embedded freeware engines into ChessGenius Classic GUI by Norbert Raimund Leisner, CCC, July 25, 2014

2015 ...

Does DOSBOX accept Mephisto Genius 3? by Jonathan Lee, CCC, April 03, 2015 » MS-DOS
ChessGenius 7 Classic GUI - commercial UCI chess engines by Norbert Raimund Leisner, CCC, April 14, 2015
Millennium Chess Genius is here by Thorsten Czub, CCC, October 09, 2015 » Millennium ChessGenius
Chess Genius Pro by Hans van Mierlo, Hiarcs Forum, August 12, 2016
Chess Genius 3 Beat Kasparov on a Pentium 90? by Brendan J. Norman, CCC, May 30, 2017

External Links

References

^ Eric Hallsworth (1992). Chess Genius. Selective Search 43, pp. 7, pdf hosted by Mike Watters
^ Staff (1995). An Interview with Richard Lang. Computer Chess Reports Vol. 5 No. 3+4 pp. 63
^ ChessGenius Classic 7.0 - The Chess Program that beat Kasparov!
^ Richard Lang (1995). Chess Genius 4. Computer Chess Reports Vol. 5 No. 3+4, pp. 80
^ Schachclub Leinzell - Schach + PC - Shredder 5, Teil 1 by Peter Schreiner (German)
^ ChessGenius Classic 7.0 - The Chess Program that beat Kasparov!
^ Chess Genius for iPhone, iPod touch, and iPad on the iTunes App Store
^ Septober - Computerschach by Herbert Marquardt
^ ChessGenius Classic 7.0 - The Chess Program that beat Kasparov!
^ ChessGenius for Android
^ GM Magazine: Vol. 12 Intel Grand Prix London 1994 {DVD} by GM Daniel King
^ Matches by Ed Schröder
^ Intel Rapid Chess Grand Prix 1994 - London from chessgames.com
^ Garry Kasparov vs Chess Genius (1994) from chessgames.com
^ ChessGenius - Famous game - Wikipedia
^ Kasparov, Garry 2805 - Genius 3, Intel World Chess Grand Prix London (1) 1994 D23, 0-1 [Hertneck,G] from Schachcomputer.info Wiki (German)
^ Re: Farewell of chess programmers by Thorsten Czub, CCC, September 15, 2005

What links here?

Page	Date Edited
Adrian Millett	Jul 12, 2017
Aegon 1993	Mar 26, 2017
Aegon 1994	Mar 26, 2017
Aegon 1995	Apr 6, 2017
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Aubervilliers Rapid Open	Mar 25, 2017
Bryan Whitby	Jan 2, 2017
Chess Genius	Feb 26, 2018
Chess System Tal	Jan 13, 2017
Cyrus	Jul 22, 2014
Dedicated Chess Computers	Feb 20, 2018
Didzis Cirulis	Dec 25, 2015
Engines	Mar 10, 2018
Frenchess	Jan 7, 2016
Gideon	Feb 26, 2018
ICGA Journal	Dec 21, 2017
Kasparov simul vs 32 micro Hamburg 1985	Dec 22, 2017
MChess	Feb 26, 2018
Mephisto	Dec 18, 2017
Mephisto Genius 68030	Sep 2, 2017
Mephisto Vancouver	Sep 2, 2017
Mephisto Wundermaschine	Sep 2, 2017
MILLENNIUM 2000 GmbH	Jul 13, 2017
Millennium Chess System	Jul 12, 2017
Millennium ChessGenius	Mar 1, 2018
Moritz Berger	Feb 25, 2018
MS-DOS	Feb 3, 2018
Nimzo	Dec 30, 2017
Novag Universal Electronic Chess Board	Feb 24, 2017
Opponent Model Search	Aug 14, 2017
Oracle	Sep 4, 2016
Ossi Weiner	Dec 18, 2017
Paul Wiereyn	Jun 4, 2015
Peter Schreiner	May 22, 2016
Rebel	Feb 25, 2018
Richard Lang	Jan 7, 2016
Saitek PC Auto Chessboard	Jun 11, 2016
Shredder	Jan 21, 2018
TASC SmartBoard	Feb 25, 2018
Thompson's Databases	Dec 24, 2014
Tournaments	Dec 21, 2017
WCCC 1992	Feb 26, 2018
WCCC 1995	Jul 12, 2017
WMCCC 1993	Dec 30, 2017
WMCCC 1995	Jan 3, 2018
World Microcomputer Chess Championship	Jan 7, 2016
Zarkov	Feb 26, 2018

Up one Level

Chess King

GerdIsenberg — Sun, 04 Dec 2016 16:29:30 GMT

Home * User Interface * GUI * Chess King

		Chess King a commercial chess GUI along with chess database, opening tree, chess publishing, chess tutorials and training features, the brand created by Diego F. Garcés ^[1], developed and purchased by ChessOK, the brand name of Convekta Ltd - first released in December 2011 bundled with Houdini 2 ^[2]. Chess King is purchased as Gold, Silver and Standard edition differing in database volume and timeliness, engine version and price, and includes multilingual executables running under various Windows and OSX versions for PC and MAC ^[3]. Chess King is not intended to use other engines - as of 2013, advanced users may try to change the default engine, either compliant to UCI or the Chess Engine Communication Protocol, by editing some file ^[4].
Chess King's analysis pane ^[5]

Forum Posts

Chess King and Peshk@ with external WB/UCI engines by Norbert Raimund Leisner, CCC, July 23, 2013

External Links

ChessKing.com » About
Chess King : ChessOK, Chess Shop from the Developers of Rybka 3 Aquarium
Chess King Released, ChessOK, December 14, 2011
Chess King with Houdini 2, ChessOK, January 27, 2012
ChessKing - YouTube
How to Improve at Chess with Chess King 4 for PC or Mac - Intro by Alexandra Kosteniuk, July 05, 2014, YouTube Video » Konstantin Kosteniuk
New 2015 Chess King Software Versions (PC & Mac) - Promo by Steve Lopez, April 06, 2015 YouTube Video

References

What links here?

Page	Date Edited
Aquarium	Dec 4, 2016
Chess Assistant	Jul 16, 2017
Chess King	Dec 4, 2016
ChessOK	Jul 30, 2013
GUI	Mar 16, 2018
Houdini	Apr 14, 2018
Konstantin Kosteniuk	Dec 4, 2016
Robots	Feb 20, 2018
Steve Lopez	Dec 4, 2016

Up one Level

Chess960CWC 2009

GerdIsenberg — Tue, 21 Aug 2012 11:03:12 GMT

Home * Tournaments * Livingston Chess960 Computer World Championship * Chess960CWC 2009
< Prev

The Fifth Livingston ^[1] Chess960 Computer World Championship was held within the scope of the Chess Classic Mainz, Germany, July 29-31, 2009, last time organized by Hans-Walter Schmitt and his Chess Tigers ^[2]. The two finalists from 2008, Rybka and Shredder were challenged by two qualifiers from an online tournament held at Internet Chess Club (ICC), Deep Sjeng and Ikarus ^[3]. Hans Secelle served as arbiter, and Eric van Reem as Tournament director.

Final Standing

^[4]

Preliminary

#	Program	CC	Authors	Ry	Sh	Sj	Ik	P	G
1	Rybka	US	Vasik Rajlich, Larry Kaufman	-	111½	1111	1111	11½	12
2	Deep Shredder	DE	Stefan Meyer-Kahlen	000½	-	½011	1111	7	12
3	Deep Sjeng	BE	Gian-Carlo Pascutto	0000	½100	-	1½1½	4½	12
4	Ikarus	DE	Munjong Kolss, Muntsin Kolss	0000	0000	0½0½	-	1	12

CC Country Codes

Final

	Final	1	2	3	4	P	Tiebreak
1	Rybka	1	½	1	½	3
2	Deep Shredder	0	½	0	½	1

Place 3

	Place 3	1	2	3	4	P	Tiebreak
3	Deep Sjeng	1	1	0	0	2	2
4	Ikarus	0	0	1	1	2	0

Photos



Drawing the lots: Muntsin Kolss, Gian-Carlo Pascutto, Stefan Meyer-Kahlen, Vasik Rajlich ^[5]

Deep Sjeng, Shredder, Rybka and Ikarus in action ^[6]


Arbiter Hans Secelle, Tournament director Eric van Reem, and the participants ^[7]

Video

Rybka - Deep Shredder Video, Levon Aronian talking with Vasik Rajlich and Stefan Meyer-Kahlen ^[8]

Reports

Eric van Reem (2009). Livingston Chess960 Computer World Championship. ICGA Journal, Vol. 32, No. 3

Forum Posts

Chess960 Internet Championship 2009 by Eric van Reem, CCC, June 19, 2009
Result Mainz Chess960 qualifier: 1) Sjeng 2) Rybka 3) Ikarus by Gian-Carlo Pascutto, CCC, July 04, 2009

External Links

References

^ Livingston, Europe's Number 1 Test & Measurement Hire and Computer Rental Company
^ Chess Tigers (German)
^ Result Mainz Chess960 qualifier: 1) Sjeng 2) Rybka 3) Ikarus by Gian-Carlo Pascutto, CCC, July 04, 2009
^ Results (pdf)
^ Chess Classic Mainz 2009 (CCM9) 2009-07-27 - 2009-08-02 by Eric van Reem
^ 5th Livingston Chess960 Computer World Championship 2009 at Mainz. The 4 programs Deep Sjeng, Shredder, Rybka and Ikarus, Photographer Gerhard Hund
^ Chess Classic Mainz 2009 (CCM9) 2009-07-27 - 2009-08-02 (German)
^ Video by Gerhard Hund from Wikimedia Commons

What links here?

Page	Date Edited
Chess960CWC 2008	Aug 21, 2012
Chess960CWC 2009	Aug 21, 2012
Eric van Reem	Sep 10, 2014
Hans Secelle	Nov 2, 2012
ICGA Journal	Dec 21, 2017
Ikarus	Jul 5, 2016
Livingston Chess960 Computer World Championship	Aug 7, 2012

Up one level

Claude Shannon

GerdIsenberg — Sat, 30 Apr 2016 18:23:39 GMT

Home * People * Claude Shannon

		Claude Elwood Shannon, (April 30, 1916 – February 24, 2001) was an American electrical engineer, mathematician and researcher from MIT and since 1941 Bell Laboratories. One of the pioneers of the information theory . In 1949 Shannon published a groundbreaking paper on computer chess entitled Programming a Computer for Playing Chess ^[1] . It describes how a machine or computer could be made to play a reasonable game of chess. His process for having the computer decide on which move to make is a minimax procedure, based on an evaluation function of a given chess position.
Claude Shannon ^[2]

Selected Publications

Photos

Chess Automation

Quote of the text on the back on the photo, as given in ICCA Journal, Vol. 12, No. 4: ^[3] :

Dr. Claude E. Shannon demonstrating to Chessmaster Edward Lasker his (home-made) electric chess automation, build in 1949. The machine could handle up to six pieces, and was designed to test various programming methods. With one hundred and fifty relay operations required to complete a move, it arrived at the reply to an opponent's play in ten to fifteen seconds. It had built into it a random element, and as a result did not necessarily always make the same move when faced with the same position.

Computer pioneer Claude Shannon and chess champion Edward Lasker at MIT,
ponder the computational aspects of playing chess at Shannon's early relay-based
chess machine ^[4]

WCCC 1980



WCCC 1980, Linz, Austria, Special guest Claude Shannon, David Levy left ^[5]

Chess pioneers in Sacher Hotel Vienna, Austria 1980: Ben Mittman, Monty Newborn, Tony Marsland, Dave Slate, David Levy, Claude Shannon, Ken Thompson, Betty Shannon, Tom Truscott ^[6]

WCCC 1989



Thompson, Shannon, and Slate at the 6th WCCC Edmonton 1989 ^[7]

Claude Shannon awards Feng-Hsiung Hsu, first prize for Deep Thought, Edmonton 1989 ^[8]

Shannon's Types

Claude Shannon categorized two types of search ^[9] :

Type A - a brute-force search looking at every variation to a given depth
Type B - a selective search looking at "important" branches only

Without the sense of alpha-beta, and inspired by the experiments of Adriaan de Groot ^[10] , Shannon and early programmers favored Type B strategy. Type B searches use some type of static heuristics in order to only look at branches that look important - with some risk to oversee some serious tactics not covered by the plausible move selector. Type B was most popular until the 1970's, when Type A programs had enough processing power and more efficient brute force algorithms to become stronger. Today most programs are closer to Type A, but have some characteristics of a Type B as mentioned in selectivity.

Selected Publications

Claude Shannon (1938). A Symbolic Analysis of Relay and Switching Circuits. Transactions of the AIEE, Vol. 57, No 12, Master's thesis 1940, Massachusetts Institute of Technology
Claude Shannon (1948). A Mathematical Theory of Communication. pdf
Claude Shannon (1949). Programming a Computer for Playing Chess. pdf from The Computer History Museum
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
Claude Shannon (1953). Computers and Automata. Proceedings of the Institute of Radio Engineers Vol. 41, No. 10 ^[11] ^[12] ^[13]
John McCarthy, Marvin Minsky, Nathaniel Rochester, Claude Shannon (1955). A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence.
Claude Shannon, John McCarthy (eds.) (1956). Automata Studies. Annals of Mathematics Studies Number 34, Google books, oldcomputerbooks.com
Jaap van den Herik (1989). An Interview with Claude Shannon, September 25, 1980 in Linz, Austria. ICCA Journal, Vol. 12, No. 4
Bob Herschberg, Jaap van den Herik (1989). Thank You, Dr. Shannon. ICCA Journal, Vol. 12, No. 4
Neil J. A. Sloane, Aaron D. Wyner (1993). Claude Shannon: Collected Papers. IEEE Press, ISBN 0-7803-0434-9
Ken Thompson (2001). CLAUDE SHANNON (1916-2001): FUNDAMENTAL CONTRIBUTIONS. ICGA Journal, Vol. 24, No. 1
Jaap van den Herik (2001). CLAUDE SHANNON (1916-2001): THANK YOU. ICGA Journal, Vol. 24, No. 1
Ben Mittman (2001). OBITUARY CLAUDE SHANNON (1916 – 2001): PERSONAL MEMORIES. ICGA Journal, Vol. 24, No. 2
David Mindell, Jérôme Segal, Slava Gerovitch (2003). Cybernetics and Information Theory in the United States, France and the Soviet Union. in Mark Walker, Science and Ideology: A Comparative History » Claude Shannon, Norbert Wiener, covers the 1951 Paris Cybernetic Congress

Forum Posts

One hundred years ago by Steven Edwards, CCC, April 30, 2016

External Links

Videos

Claude Shannon - Father of the Information Age, YouTube Video
Claude Shannon Juggling, YouTube Video

100th Birthday

References

^ Programming a Computer for Playing Chess (raw text)
^ Claude Shannon from Wikipedia
^ Photo of courtesy of Mrs. Shannon and Jos Uiterwijk, ICCA Journal, Vol. 12, No. 4, pp. 217. Quote of the text on the back on the photo
^ Shannon and Lasker at Shannon's chess machine, ca. 1950 Gift of Monroe Newborn from The Computer History Museum
^ Claude Shannon during the 3rd World Computer Chess Championship that was staged in the course of the Ars Electronica Festival 1980, credit: LIVA – Linzer Veranstaltungsgesellschaft mbH, Ars Electronica - Codes & Clowns (2010/2011) – Flickr
^ Chess pioneers in Sacher Hotel Vienna, Austria, Gift of Benjamin Mittman, The Computer History Museum
^ Thompson, Shannon, and Slate Photo by Monroe Newborn from A History of Computer Chess from The Computer History Museum
^ Claude Shannon awards Feng-Hsiung Hsu Photo from A History of Computer Chess from The Computer History Museum
^ Claude Shannon (1949). Programming a Computer for Playing Chess. pdf
^ Groot, A.D. de (1946). Het denken van den Schaker, een experimenteel-psychologische studie. Ph.D. thesis, University of Amsterdam; N.V. Noord-Hollandse Uitgevers Maatschappij, Amsterdam. Translated with the help of George Baylor, with additions (in 1965) as Thought and Choice in Chess. Mouton Publishers, The Hague. ISBN 90-279-7914-6. (amazon)
^ In Vadim Anshelevich (2002). A hierarchical approach to computer Hex. Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence, pdf, Vadim Anshelevich acknowledged Claude Shannon, who build an analogue Hex-playing machine using electrical resistor circuits, which was model in Anshelevich's program Hexy
^ Hex is a special case of the Shannon Switching Game, from Jack van Rijswijck (2003). Search and evaluation in Hex. Technical report, University of Alberta, pdf
^ Thomas Fischer (2009). Bridg-It – Beating Shannon’s Analog Heuristic. pdf

What links here?

Page	Date Edited
1st Computer Olympiad	Jul 25, 2017
8x8 Board	Aug 29, 2017
Adriaan de Groot	Oct 6, 2014
Alan Turing	Feb 8, 2017
Alpha-Beta	Jan 28, 2018
Artificial Intelligence	Apr 9, 2018
Bell Laboratories	Jun 20, 2017
Ben Mittman	Jan 2, 2017
Bit	Oct 29, 2012
Board Representation	Dec 11, 2017
Bob Herschberg	Dec 13, 2016
Brute-Force	Jul 27, 2017
CC Sapiens	Oct 29, 2014
Chess	Jan 21, 2018
Chess (Program)	Dec 22, 2017
Chess Game	Mar 28, 2017
Claude Shannon	Apr 30, 2016
Claudia	Jun 1, 2016
Cognition	Dec 8, 2017
Complexity to include	Jun 16, 2011
Computer Chess Compendium	Dec 29, 2015
Connection Machine	Oct 12, 2016
Dartmouth College	Dec 16, 2016
David Levy	Jan 3, 2017
David Slate	Jul 19, 2016
Duchess	Dec 22, 2017
Edward Fredkin	Oct 27, 2013
El Ajedrecista	Feb 25, 2015
Electro-Mechanical	May 2, 2016
Elwyn Berlekamp	Jun 25, 2015
Evaluation	Feb 1, 2018
Feng-hsiung Hsu	Dec 27, 2016
Games	Feb 20, 2018
Hartmut Tanke	Sep 7, 2014
Heinz Nixdorf MuseumsForum	Sep 6, 2015
Hex	Dec 29, 2017
History	Jan 2, 2018
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
Jack Good	Dec 22, 2017
James Gillogly	Jan 7, 2016
John McCarthy	Jan 5, 2017
John von Neumann	May 8, 2017
Jos Uiterwijk	Aug 11, 2017
Kaissa	Apr 9, 2018
Kches6	Jan 2, 2018
Ken Thompson	Sep 8, 2017
Learning	Feb 20, 2018
Leonardo Torres y Quevedo	Feb 25, 2015
Mailbox	Apr 14, 2018
Marvin Minsky	Jan 29, 2016
Massachusetts Institute of Technology	Jan 24, 2017
Master	Dec 28, 2017
Material	Mar 31, 2018
Mathematician	Apr 9, 2018
Mikhail Botvinnik	Jul 15, 2017
Minimax	Dec 29, 2017
Mobility	Jan 17, 2018
Monroe Newborn	Dec 23, 2017
Nathaniel Rochester	Oct 26, 2016
Neural Networks	Mar 12, 2018
Norbert Wiener	Oct 6, 2013
Opponent Model Search	Aug 14, 2017
People	Feb 28, 2018
Point Value	Mar 31, 2018
Point Value by Regression Analysis	Aug 26, 2017
Pruning	Jan 1, 2018
Quote McCarthy	Sep 10, 2013
Razoring	Oct 5, 2015
Robots	Feb 20, 2018
Santos Gerardo Lazzeri	Mar 19, 2016
Scientific American	Jun 5, 2017
Search	Feb 1, 2018
Shannon Trophy	Jul 7, 2017
Simplified evaluation function	Dec 2, 2014
Tech	Apr 20, 2018
The Fox	Feb 27, 2017
Tom Truscott	Dec 22, 2017
Tony Marsland	Nov 27, 2017
Type A Strategy	Jul 30, 2010
Type B Strategy	Jul 19, 2016
Vadim Anshelevich	Dec 22, 2016
WCCC 1980	Dec 25, 2017
WCCC 1989	Dec 5, 2017
World Computer Chess Championship	Mar 6, 2018

Up one level

Daylen Yang

GerdIsenberg — Fri, 08 Sep 2017 10:04:25 GMT

Home * People * Daylen Yang

		Daylen Yang, an American student of computer science and electrical engineering at University of California, Berkeley, and since 2010 member of the Stockfish team ^[1]. He is application author of Stockfish for Mac, and author of the Stockfish website ^[2].
Daylen Yang ^[3]

Forum Posts

Stockfish Mac app by Daylen Yang, CCC, January 22, 2014
Dumb question about alpha-beta by Daylen Yang, CCC, March 04, 2014 » Alpha-Beta
Parallel Search with Transposition Table by Daylen Yang, CCC, March 27, 2014 » Parallel Search, Shared Hash Table

External Links

Daylen Yang
daylen (Daylen Yang) · GitHub
Building Chess ID – Medium by Daylen Yang
How do modern chess engines work?, Talk by Daylen Yang, Discussion with Tord Romstad, TNG | Big Techday 8, June 12, 2015, YouTube Video ^[4] ^[5]

References

^ TNG | Abstracts
^ About - Stockfish - Open Source Chess Engine
^ Daylen Yang
^ Video : How do modern chess engines work ? by Vincent Lejeune, CCC, April 12, 2016
^ Parallelism and Selectivity in Game Tree Search | Video, Talk by Tord Romstad

What links here?

Page	Date Edited
Alpha-Beta	Jan 28, 2018
Daylen Yang	Sep 8, 2017
Macintosh	Dec 7, 2016
Parallel Search	Dec 30, 2017
People	Feb 28, 2018
Piece Recognition	Sep 8, 2017
Shared Hash Table	Sep 11, 2017
Stockfish	Apr 7, 2018
University of California, Berkeley	Sep 5, 2016

Up one level

Deep Blue

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

Home * Engines * Deep Blue

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

WCCC 1995

Kasparov versus Deep Blue

Selected Publications

WCCC 1995

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

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

Kasparov versus Deep Blue

Main article: Kasparov versus Deep Blue 1996

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

The Rematch

Main article: Kasparov versus Deep Blue 1997

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

The Deep Blue Team

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

Photos

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

Selected Publications

1995 ...

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

1996

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

1997

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

1998

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

1999

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

2000 ...

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

Forum Posts

1995 ...

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

1997

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

1998

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

2000 ...

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

2005 ...

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

2010 ...

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

2015 ...

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

External Links

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

Videos

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

References

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

What links here?

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

Up one Level

Edward de Grijs

GerdIsenberg — Fri, 30 Dec 2016 21:50:39 GMT

Home * People * Edward de Grijs

		Edward de Grijs, a Dutch software and hardware engineer and developer. He holds a B.Sc. degree from Delft University of Technology in 1988, and specialized on image processing, high performance digital signal processing, hardware mapping of algorithms on FPGA, game theory and implementation, statistics, analytics and collaborative filtering, data mining, and predictive modelling.
Edward de Grijs ^[1]

Game Progamming

As a chess and Go programmer, Edward de Grijs is author of the chess playing entity Explorer, playing the DOCCC 1991 and the DOCCC 1993, and more recently the Go playing program FirstGo, which participated at the 12th Computer Olympiad in Amsterdam ^[2].

Prize Winning

Edward de Grijs was member of The Ensemble in the Netflix Prize challenge, an open competition for the best collaborative filtering algorithm to predict user ratings for films, which finished second on the leaderboard out of 50 thousand contestants ^[3] ^[4] ^[5]. He was also member of the POWERDOT team, winning the 2013 Heritage Health Prize 2.0 ^[6].

Forum Posts

Re: 19x19 CGOS by Edward de Grijs, Computer Go Archive, October 28, 2007
Re: A thought about ratings by Edward de Grijs, Computer Go Archive, December 10, 2007 » Playing Strength

External Links

References

^ Edward de Grijs | LinkedIn
^ igosoft - Info&Tournament for Go Playing Software - F1,FU,FG,GN,GP,GA
^ Edward de Grijs | LinkedIn
^ How the Netflix Prize Was Won by Eliot Van Buskirk, Wired, September 22, 2009
^ Lester Mackey (2011). The Story of the Netflix Prize: An Ensembler’s Tale. National Academies' Seminar, Washington, DC, slides as pdf
^ POWERDOT awarded $500,000 and Announcing Heritage Health Prize 2.0 | No Free Hunch by Jeremy Howard, June 03, 2013

What links here?

Page	Date Edited
12th Computer Olympiad	Jul 22, 2017
Delft University of Technology	Feb 4, 2018
DOCCC 1993	Dec 12, 2016
Edward de Grijs	Dec 30, 2016
Explorer	Dec 8, 2016
Go	Jan 24, 2018
People	Feb 28, 2018
Playing Strength	Mar 31, 2018

Up one level

El Ajedrecista

GerdIsenberg — Wed, 25 Feb 2015 21:00:30 GMT

Home * History * El Ajedrecista

		El Ajedrecista, the electro-mechanical KRK solver by Leonardo Torres y Quevedo. In 1910 Torres began (other sources state 1890, or 1901 ^[1] ) to construct the chess automaton. In 1912 it was able to automatically play a white king (initially on a8) and white rook (initially on b7) against the lonesome black king placed on any square, except 7th or 8th rank. The algorithm was suboptimal, but could win in less than 50 moves against any defense ^[2] . It used mechanical arms to make its moves and electrical sensors to detect its opponent's replies. A second, mechanical but not algorithmic improved El Ajedrecista was built by Leonardo Torres Quevedo's son Gonzalo in 1922, under the direction of his father. At the 1951 Paris Cybernetic Congress the advanced machine was introduced to a greater audience and explained to Norbert Wiener ^[3] . Even if only playing KRK, El Ajedrecista can be considered as the world’s first chess computer, even a dedicated robot able to move its own pieces. It is still functional and can be visited at the Torres Quevedo Museum of Engineering, Institute of Civil Engineering at the Universidad Politécnica de Madrid ^[4]. During the WCCC 1992, hosted by the Universidad Politécnica de Madrid, the original El Ajedrecista was an exhibit in the tournament hall ^[5].
El Ajedrecista ^[6]

Photos

El Ajedrecista I



Front view of the 1911 chess playing automation. The chessboard is shown in the lower right of center. Horizontal and vertical arms moved the pieces (which were actually electrical jacks) from square to square, and the logic circuitry consisted of battery driven relays arranged in a logical tree structure ^[7] ^[8]

El Ajedrecista II

Gonzalo Torres y Quevedo and Norbert Wiener ^[9] ^[10]

Description

On March 17, 2007, the Institute of Electrical and Electronics Engineers (IEEE) recognized Torres’ Telekine ^[11] with an IEEE Milestone in Electrical Engineering and Computing ^[12] . The dedication was held at the Torres Quevedo Museum of Engineering, Institute of Civil Engineering, Universidad Politécnica de Madrid, and following description of El Ajedrecista was given in the Celebration Ceremony Booklet Early Developments in Remote-Control, 1901 - The Telekine ^[13] ^[14] :

Roughly speaking, the movement of white pieces depends on the movement of the black king. Each of the 64 squares of the chess board (8 rows x 8 columns) are formed by three metallic pieces separated each other by an insulating material; the central piece is circular and is connected to the positive terminal whereas the side pieces are triangular and are respectively connected to two conductors, one horizontal and one vertical.

The black king has a silver mesh-base that connects the central piece of the square to the triangular ones, thus closing two electrical circuits that move two respective sliding bars, one horizontal and one vertical, until they reach two positions that determine the black king position on the chess board. Similarly, positions of the white king and rook are defined by four sliding bars, two for each of the pieces. When the black king moves into a position, the corresponding sliding bars move and close, by means of suitable contacts, the electrical circuits which act in turn on the white pieces making them move according to the game strategy. The white pieces have a steel ball in their base and are driven by electromagnets, which are placed under the table and suitably activated for each black king position.

When a check situation occurs, a phonographic disc pronounces the sentence “check to the king”. When checkmate occurs, the disc pronounces the corresponding sentence and a warning light indicating mate is turned on. In these cases, an electromagnet removes the tension from the board, thus ending the game. The automaton won. Although the chess automaton function was limited to particular chess endgames, Torres Quevedo proved that further advances in computer technology were possible at a time when the information about “artificial intelligence” was very limited. At the time of this invention Torres Quevedo was President of the Academy of Sciences of Madrid, Spain.

The Robot

A detailed explanation of El Ajedrecista can be found in Les Automates by Henri Vigneron ^[15] :

If the opponent plays an illegal move, a light comes on and the robot refuses to make a move. Once three such illegal moves have been made, the robot ceases to play altogether. If, on the contrary, the robot will carry out one of six operations, depending upon the position of the (just moved) black king. In order to archive this, Mr Torres use two zones on the chessboard: the one on the left consisting of the a-, b-, c-files, and the corresponding one on the right consisting of the h-, g-, and f-files (and a center zone consisting of d-, and e-file). We then have six operations as shown in the figure:

The (defending) black King
is in the same zone as the (white) rook	is not in the same zone as the rook and the vertical distance between the black king and the rook is
	more than a square	one square, with the vertical distance between the two kings being
		more than two squares	two squares, with the number of square representing their horizontal distance apart being
			odd	even	zero
The rook moves away horizontally	The rook moves down one square	The king moves down one square	The rook moves one square horizontally	The white king moves one square towards the black king	The rook moves down one square
1	2	3	4	5	6

Assembly

El Ajedrecista - principle assembly diagram ^[16]

Making own Moves

Eight electro-mechanical actuators make the robot's own white king (left, right, down) or rook (left, right, down one square, horizontally to a- and h-file) moves and update its internal board representation. They are build using a disc (D) under friction torque of a spindle (O) driven by weights suspended from a cord wrapped around a pulley ^[17]. The disc has one sawtooth to prevent motion by an pawl unless an electromagnet (E) shortly attracts armature (A), allowing a full disc rotation, running a kind of mechanical microprogram for a specific piece movement. Using vertical and horizontal sliding arms, the robot addresses the origin square, grasps the piece from the board's plug hole, moves it over the target square to reinsert it into the board again.


Actuator principle ...		and photo detail ^[18]		Board with sliding arms

Publications

Henri Vigneron (1914). Les Automates. La Nature, pdf from cyberneticzoo.com, Translation by David Levy as Robots in David Levy, Monroe Newborn (1982). All About Chess and Computers. Springer, pp. 14-23, also in David Levy (ed.) (1988). Computer Chess Compendium, pp. 273-278.
Anonymmous (1915). Torre and His Remarkable Automatic Devices. Scientific American, Supplement 80, Number 2079, November 06, 1915
Donald Michie (1977). King and Rook Against King: Historical Background and a Problem on the Infinite Board. Advances in Computer Chess 1
James M. Williams (1978). Antique Mechanical Computers, Part 3: The Torres Chess Automation. BYTE, Vol. 3, No. 9
David Levy (1982). Robots. Translation of Henri Vigneron (1914). Les Automates. in David Levy, Monroe Newborn (1982). All About Chess and Computers. Springer, also in David Levy (ed.) (1988). Computer Chess Compendium, pp. 273-278. pdf from cyberneticzoo.com
Brian Randell (1982). From Analytical Engine to Electronic Digital Computer: The Contributions of Ludgate, Torres, and Bush. Annals of the History of Computing, Vol. 4, No. 4, October 1982, pdf ^[19] ^[20] ^[21]
Ulrich Thiemonds (1999). Ein regelbasiertes Spielprogramm für Schachendspiele. University of Bonn, Diploma Thesis, zipped ps, pdf, pp 34-36 "Historischer" Ansatz von Torres y Quevedo" (German)

Forum Posts

"El Ajedristica" Programming Challenge by Ricardo Gibert, CCC, April 25, 2005
One hundred years ago, the first chess computer by Steven Edwards, CCC, January 05, 2012
Re: Programmer wanted to write chess game for an exhibition by Harm Geert Muller, CCC, November 04, 2012 (El Ajedrecista algorithm)
chess-playing automaton , circa 1914 by Tom Glenn, CCC, February 10, 2014

External Links

El Ajedrecista from Wikipedia
El Ajedrecista from Wikipedia.es (Spanish)
Universidad Politécnica de Madrid - Museo "Torres Quevedo"
The first chess computer Chess Notes Archive by Edward Winter (note 4470, 4482)
The first chess computer Chess Notes Archive by Edward Winter (note 4525, 4547)
1911 El Ajedrecista from Carolus Chess
1911-20 - Chess Playing Machines - Leonardo Torres y Quevedo from cyberneticzoo.com
History of Computers and Computing, Automata, Leonardo Torres's chess-machine
Cyber Heroes of the past: Leonardo Torres y Quevedo
A New Photograph of “El jugador ajedrecista,” the World’s First Chess Computer by Nathan Bauman, July 16th, 2006
Mechanical Chess Opponent | Modern Mechanix
Spain, September 6, 1955 - Leonardo Torres Quevedo: inventor of the first chess machine El Ajedrecista in 1911
Imágenes del Autómata ajedrecista - Torres Quevedo (Spanish)
Die Schachautomaten des Torres Quevedo by Hans-Peter Ketterling, Schachklub Tempelhof (German)
Computer Schach by Andre Adrian, see Torres y Quevedo, Endspielautomat (German)
The Rook Endgame Machine of Torres y Quevedo by Ramón Jiménez, ChessBase, July 20, 2004
"El Ajedrecista" - an analog chess-playing computer from 1912, September 14, 2011 ^[22]
El primer robot de ajedrez era español y cumple cien años | Jugar con Cabeza by Federico Marín Bellón, November 02, 2012 (Spanish)
Chess and the Automaton Endgame by Jon Turi, February 9th, 2014 ^[23]
Leonardo Torres Quevedo Chess Automaton 1951, YouTube Video

References

^ The first chess computer Chess Notes Archive by Edward Winter (note 4525, 4547)
^ David Levy in Computer Chess Compendium, Special Purpose Software and Hardware, pp. 266
^ David Mindell, Jérôme Segal, Slava Gerovitch (2003). Cybernetics and Information Theory in the United States, France and the Soviet Union. in Mark Walker, Science and Ideology: A Comparative History » Claude Shannon, Norbert Wiener, covers the 1951 Paris Cybernetic Congress
^ Universidad Politécnica de Madrid - Museo "Torres Quevedo" (Spanish)
^ Jaap van den Herik, Bob Herschberg (1992). The 7th World Computer-Chess Championship. Report on the Tournament. ICCA Journal, Vol. 15, No. 4
^ A New Photograph of “El jugador ajedrecista,” the World’s First Chess Computer by Nathan Bauman, July 16th, 2006
^ Fotografía del primer ajedrecista. Del libro Obra e Inventos de Torres Quevedo. José García Santesmases. Editado en 1980 por el Instituto de España en la "Colección Cultura y Cienci, Imágenes del Autómata ajedrecista - Torres Quevedo (Spanish)
^ James M. Williams (1978). Antique Mechanical Computers, Part 3: The Torres Chess Automation. BYTE, Vol. 3, No. 9
^ A New Photograph of “El jugador ajedrecista,” the World’s First Chess Computer by Nathan Bauman, July 16th, 2006
^ David Mindell, Jérôme Segal, Slava Gerovitch (2003). Cybernetics and Information Theory in the United States, France and the Soviet Union. in Mark Walker, Science and Ideology: A Comparative History » Claude Shannon, Norbert Wiener, covers the 1951 Paris Cybernetic Congress
^ Antonio Pérez Yuste, Magdalena Salazar Palma (2004). The First Wireless Remote-Control: The Telekine of Torres Quevedo. pdf
^ Cyber Heroes of the past: Leonardo Torres y Quevedo
^ Torres-Quevedo Museum of Engineering - Early Developments in Remote-Control, 1901 - The Telekine (pdf, Spanish/English) Escuela Técnica Superior de Ingenieros de Caminos, Canales y Puertos (Institute of Civil Engineering) - Universidad Politécnica de Madrid
^ José Luis López Aranguren, Complutense University of Madrid
^ Henri Vigneron (1914). Les Automates. La Nature, pdf from cyberneticzoo.com, Translation by David Levy as Robots in David Levy, Monroe Newborn (1982). All About Chess and Computers. Springer, pp. 14-23, also in David Levy (ed.) (1988). Computer Chess Compendium, pp. 273-278.
^ Henri Vigneron (1914). Les Automates. La Nature, image pp. 61, pdf from cyberneticzoo.com
^ Mechanical movements - Movement (clockwork) from Wikipedia
^ Detail photos cropped from A New Photograph of “El jugador ajedrecista,” the World’s First Chess Computer by Nathan Bauman, July 16th, 2006
^ Analytical Engine from Wikipedia
^ Percy Ludgate from Wikipedia
^ Vannevar Bush
^ El Ajedrecista deals with discrete states and should not considered as analog computer
^ chess-playing automaton , circa 1914 by Tom Glenn, CCC, February 10, 2014

What links here?

Page	Date Edited
Andre Adrian	Jan 16, 2012
Byte Magazine	Nov 20, 2016
Computer Chess Compendium	Dec 29, 2015
David Levy	Jan 3, 2017
Dedicated Chess Computers	Feb 20, 2018
El Ajedrecista	Feb 25, 2015
Electro-Mechanical	May 2, 2016
Hardware	Jan 20, 2018
Henri Vigneron	Nov 20, 2012
History	Jan 2, 2018
KRK	Nov 26, 2016
Leonardo Torres y Quevedo	Feb 25, 2015
Mate-in-two	Oct 14, 2016
Norbert Wiener	Oct 6, 2013
Robots	Feb 20, 2018
Scientific American	Jun 5, 2017
Steven Edwards	Aug 26, 2017
Technical University of Madrid	Feb 25, 2015
Tihamér Nemes	Sep 11, 2014
Ulrich Thiemonds	Apr 26, 2014
WCCC 1992	Feb 26, 2018

Up one level

Eric Hallsworth

GerdIsenberg — Thu, 07 Jan 2016 17:33:20 GMT

Home * People * Eric Hallsworth

		Eric Hallsworth, a British computer chess expert, journalist, since 1985 editor and producer of the computer chess periodical Selective Search, merchant of computer chess and bridge computers, games and accessories, and as opening book author and tester member of the Hiarcs team ^[1] ^[2] ^[3].
Eric Hallsworth ^[4]

External Links

Eric Hallsworth's ICGA Tournaments
Getting the most out of Hiarcs 8 - Eric Hallsworth, ChessBase News, May 16, 2002
Eric Hallsworth about chess computers, YouTube Video ^[5] ^[6]

References

^ Eric Hallsworth's ICGA Tournaments
^ PC HIARCS 9.0 Computer Chess Software Program
^ Eric Hallsworth by Ted Summers, Hiarcs Forum, December 14, 2008
^ Getting the most out of Hiarcs 8 - Eric Hallsworth, ChessBase News, May 16, 2002
^ Historic video's hosted by Ed Schröder
^ A couple of new historic video's by Ed Schröder, CCC, Mar 17, 2013

What links here?

Page	Date Edited
More Links
ACM 1988	Dec 5, 2017
Aegon 1996	Jan 22, 2017
Aegon 1997	Apr 7, 2017
Bareev versus Hiarcs 2003	Aug 18, 2016
Brutus	Dec 24, 2016
Chess Genius	Feb 26, 2018
Clones	Jan 16, 2017
Computer Chess Reports	May 15, 2016
DOCCC 2003	Aug 17, 2016
Ed Schroder	Feb 26, 2018
Engine Rating Lists	Dec 13, 2017
Eric Hallsworth	Jan 7, 2016
Fritz	Feb 26, 2018
Harvard Cup 1993	Nov 8, 2016
Hiarcs	Feb 25, 2018
ICT 2002	Nov 19, 2016
ICT 2003	Aug 18, 2016
ICT 2004	Aug 17, 2016
IPCCC 2003	Aug 17, 2016
Kasparov versus Deep Blue 1997	Aug 1, 2017
Kasparov versus Deep Junior 2003	Mar 18, 2017
Kasparov versus X3D Fritz 2003	Aug 17, 2016
Kramnik versus Deep Fritz 2002	Oct 16, 2017
Kramnik versus Deep Fritz 2006	Nov 28, 2017
Man vs Machine Team Championship	Aug 21, 2016
Match Statistics	Mar 31, 2018
MChess	Feb 26, 2018
Mephisto Almeria	Sep 1, 2017
Mephisto Lyon	Sep 1, 2017
People	Feb 28, 2018
Playing Strength	Mar 31, 2018
Rybka	Mar 27, 2017
Rybka Controversy	Jan 18, 2018
Selective Search	Oct 24, 2016
Videos	Jan 22, 2018
WCCC 1974	Jan 19, 2018
WCCC 1977	Dec 22, 2017
WCCC 1992	Feb 26, 2018
WCCC 1995	Jul 12, 2017
WCCC 1999	Jul 13, 2017
WCCC 2002	Nov 24, 2017
WCCC 2003	Apr 2, 2017
WCCC 2004	Jan 28, 2018
WCCC 2005	Dec 27, 2016
WCCC 2006	Jan 28, 2018
WCCC 2007	Jan 2, 2017
WCCC 2008	Jan 3, 2017
WCCC 2009	Apr 2, 2017
WCCC 2010	Jan 6, 2017
WCCC 2011	Jan 7, 2017
WCCC 2013	Dec 7, 2016
WCSC 2010	Jan 6, 2017
WCSC 2011	Jan 7, 2017
WCSC 2013	Aug 17, 2016
Who's Who	Sep 6, 2017
WMCCC 1988	Oct 27, 2016
WMCCC 1989	Oct 27, 2016
WMCCC 1990	Oct 27, 2016
WMCCC 1991	Sep 18, 2016
WMCCC 1993	Dec 30, 2017

Up one level

Georgy Adelson-Velsky

GerdIsenberg — Mon, 09 Apr 2018 18:49:26 GMT

Home * People * Georgy Adelson-Velsky

		Georgy Maximovich Adelson-Velsky, (Гео́ргий Макси́мович Адельсо́н-Ве́льский, January 8, 1922 - April 26, 2014) was a Soviet and Israeli mathematician, computer scientist and computer chess pioneer, most famous for inventing the AVL tree along with Evgenii Landis ^[1], and as co-author of the ITEP Chess Program and Kaissa. Adelson-Velsky and his fellow Alexander Kronrod were the last students of Nikolai Luzin at Moscow State University, where he graduated in 1949 under Israel Gelfand on Spectral Analysis of Ring of Bounded Linear Operators ^[2] ^[3]. In the 90s, Adelson-Velsky emigrated to Israel and lived in Ashdod ^[4], at times affiliated with the Technion, and Mathematics & Computer Science department of Bar-Ilan University ^[5]. Georgy Adelson-Velsky died on April 26, 2014, aged 92, in Giv'atayim, Israel ^[6] ^[7].
Adelson-Velsky in Moscow 1980 ^[8]

Computer Chess

Since the late 50s, at Kronrod's Institute of Theoretical and Experimental Physics, Georgy Adelson-Velsky worked along with Kronrod, Alexander Brudno, Mikhail Bongard, Evgenii Landis, Nikolay Konstantinov, Vladimir Arlazarov et al. on heuristic and game programming, where they elaborated on the foundations of computer chess. Since 1963 ^[9] at ITEP, Georgy Adelson-Velsky co-developed the ITEP Chess Program, along with Vladimir Arlazarov, Anatoly Uskov and Alexander Zhivotovsky, advised by Russian chess master Alexander Bitman and three-time world champion Mikhail Botvinnik ^[10].

At the end of 1966 a four game match began between the Kotok-McCarthy-Program, running on a IBM 7090 computer, and the ITEP Chess Program on a Soviet M-2 ^[11] computer. The match played over nine months was won 3-1 by the ITEP program. In 1971, along with Mikhail Donskoy and Vladimir Arlazarov, Georgy Adelson-Velsky became primary author of Kaissa, winner of the first computer chess championship 1974 in Stockholm.

Photos



Georgy Adelson-Velsky and John McCarthy playing chess, Soviet-American computer science conference, Urgench, 1979 ^[12]

Adelson-Velsky explaing his work on the analysis of the Minimax algorithm, Moscow 1980 ^[13] ^[14]

Quotes

Official Information

by Mikhail Donskoy (1999) on Kaissa ^[15]

Georgy Adelson-Velsky - one of the first Soviet programmers (together with Alexander Kronrod, Alexander Brudno, Evgenii Landis and others). He was occupied by the programs, connected with nuclear physics at ITEP, where he devised many algorithms which became classical. Especially the equilibrium binary trees, which in the entire world are called AVL trees after the names of the authors - Adelson-Velsky and Landis. After short-term teaching at MGU he worked at IPU and VNIISI (All-Union Scientific Research Institute of Sanitary Testing) on discrete algorithms, network planning and artificial intelligence. He now lives in Israel and works at Technion on NP problems of complete tasks.

Remembering A.S. Kronrod

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

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 ^[17]

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.

Hashing

Quote from Mikhail Donskoy's life cycle of a programmer ^[18]:

When I was in high school I learned to program on the M-20 ... In the group of programmers at Institute of Theoretical and Experimental Physics, where computing work was done on nuclear physics on the M-20, they came up with arrays, lists, the need for subroutines and more. One of my teachers, Georgy Adelson-Velsky came up with a hash memory. Details can be found in another of my teachers - Alexander Kronrod "Conversations about programming". Even before Dijkstra's basic principles of structured programming was known, Alexander Brudno published the book "Programming in meaningful notation." There was also created the first chess program ... The chess program ITEP, the predecessor of Kaissa fit in memory of M-20, namely in 4096 cells, each of which has a 48-bit ...

AVL Trees

Dinitz

Anecdote by Yefim Dinitz from his talk at Shimon Even's retiring party, November 2003 ^[19], revised version in Dinitz' Algorithm: The Original Version and Even's Version ^[20] ^[21]:

The following anecdote sheds some light on how things were done in the USSR. Shortly after the "iron curtain" fell in 1990, an American and a Russian, who had both worked on the development of weapons, met. The American asked: "When you developed the Bomb, how were you able to perform such an enormous amount of computing with your weak computers?". The Russian responded: "We used better algorithms." This was really so. Russia had a long tradition of excellence in Mathematics. In addition, the usual Soviet method for attacking hard problems was to combine pressure from the authorities with people's enthusiasm. When Stalin decided to develop the Bomb, many bright mathematicians, e.g. Israel Gelfand and my first Math teacher, Alexander Kronrod, put aside their mathematical studies and delved deeply into the novel area of computing. They have assembled teams of talented people, and succeeded. The teams continued to grow and work on the theory of computing. The supervisor of my M.Sc. thesis was Georgy Adelson-Velsky, one of the fathers of Computer Science. Among the students in his group were M. Kronrod (one of the future "Four Russians", i.e. the four authors of ^[22]), A. Karzanov (the future author of the O(n3) network flow algorithm ^[23] ) and other talented school pupils of A. Kronrod. This was in 1968, long after the Bomb project completed. The work on the foundations of the chess program "Kaissa", created by members of A. Kronrod's team under guidance of Adelson-Velsky, was almost finished; "Kaissa" won the first world championship in 1974. Adelson-Velsky's new passion became discrete algorithms, which he felt had a great future. The fundamental contribution of Adelson-Velsky to Computer Science was AVL-trees. He (AV) and Evgenii Landis (L) published a paper about AVL-trees in early 60's, consisting of just a few pages. Besides solving an important problem, it presented a bright approach to data structure maintenance. While this approach became standard in the USSR, it was still not known in the West. No reaction followed their publication during a couple of years, until another paper, 15 pages long, was published by a researcher, which understood how AVL-trees work and explained this to the Western community, in its language. Since then, AVL-trees and the entire data structure maintenance approach became a corner-stone of Computer Science.

Ershov and Shura-Bura

Quote from The Early Development of Programming in the USSR by Andrey Ershov, Mikhail R. Shura-Bura ^[24]

At the end of the 1950's a group of Moscow mathematicians began a study of computerized chess. Sixteen years later, the studies would lead to victory in the first world chess tournament for computer programs held in Stockholm during the 1974 IFIP Congress. An important component of this success was a deep study of the problems of information organization in computer memory and of various search heuristics. G. M. Adelson-Velsky and E. M. Landis invented the binary search tree ("dichotomic inquiry") and A. L. Brudno, independent of J. McCarthy, discovered the (α,β)-heuristic for reducing search times on a game tree.

Donskoy

Quote by Mikhail Donskoy from a Radio Liberty interview on an anecdote concerning Georgy Adelson-Velsky and AVL trees^[25] ^[26]:

One of my teachers, Georgy Adelson-Velsky, wrote an excellent report, "How did chess programs influence the development of programming". He lectured it in a strange way - at a congress in geophysics. In particular, the famous AVL trees were invented for chess programs at ITEP. I happened to be in Canada with Adelson-Velsky, at the University of Waterloo, where we were invited. There are three Faculties of Computational Mathematics, one way or another related to computer science and programming. One of them is, more or less, department of AVL trees. Can you imagine the scene when Adelson-Velsky himself (AVL stands for Adelson-Velsky and Evgenii Landis - two authors) comes to a department bearing his name, with a head of the department, three full professors, and six assistant professors, a myriad of graduate students and all who study his works. We were seated at a place of honor. Adelson-Velsky did not speak English and I translated. They asked the fundamental question: "How do you feel about the AVL-tree today?". This was 20, maybe 30 years after the invention. Then Adelson-Velsky, a typical scientist, small and hunchbacked with glasses, said with his high voice: "Yes, AVL-trees - this was a mistake of my youth". I replied to him "Georgy Maximovich, should I translate that directly?". His honesty has always distinguished the crystal. He said yes, and I translated. Soon the department head said "You know, our guests are tired from the journey and need to rest". God forbid again Adelson-Velsky says that AVL-trees are nonsense again - their monthly salary exceeds two or three years' of Adelson's income ...

The chronology of the events

Quotes by Mikhail Donskoy on the History of Kaissa ^[27]

1963 - beginning of the works on the first Soviet chess program in the Institute of Theoretical and Experimental Physics (ITEP) in the laboratory under Alexander Kronrod's management. The first authors - Georgy Adelson-Velsky, Vladimir Arlazarov, Alexander Bitman, Alexander Zhivotovsky, Anatoly Uskov, A. Leman, M. Rozenfeld.

1967 - first international match of chess programs. Competed the program ITEP and the program of Stanford University, made under the management John McCarthy. McCarthy is famous fact that in 1952 on the beach in San Diego together with Alan Turing devised the word combination of "Artificial Intelligence", and fact that he is the author of the language Lisp - the first programming language, specially created for the tasks in the problems of artificial intelligence. Regulations of the match - four games. From the side of Stanford played one and the same version, from the ITEP side - two, which were being distinguished by the depth of search. Moves were transferred by the telegraph once a week (this to those- that times from "yadernogo" institute!). Match continued entire year and ended with the score the 3:1 in favor of ITEP.

1969 - a letter in support of mathematician Esenin-Volpin (son of poet) and his incorrect psychiatric confinement, among others signed by Alexander Kronrod and Georgy Adelson-Velsky. As a result, the laboratory was disbanded and its major portion under Vladimir Arlazarov's management, but without Kronrod, after a certain time he settled in Institute of Control Sciences (ICF).

1970 - the mechanic mathematical department of MGU finished the entire group of the students of Alexander Kronrod and Georgy Adelson-Velsky, that was being occupied in the famous seminar for discrete algorithms. Sums of the seminar:
For Georgy Adelson-Velsky it was forbidden to teach in MGU

Visit from Canada

Tony Marsland and Monty Newborn on Georgy Adelson-Velsky in their report of their USSR visit, December 1980 ^[28]:

Adelson-Velsky, an extremely capable and animated scientist and a real pleasure to meet, generally led our technical discussions. His eyes seemed to glisten with enthusiasm when he spoke. Discussions centered around probabilistic analyses of various aspects of the minimax algorithm and parallel search of chess trees. Our first joint seminar on alpha-beta analysis and the impact of computer technology was attended by about thirty people, including Leonid Kantorovich, winner of the 1975 Nobel Prize in Economics for his work on linear programming.

Selected Publications

^[29] ^[30] ^[31] ^[32] ^[33]

1957 ...

Georgy Adelson-Velsky, Yuli A. Shreider (1957). The Banach mean on groups. Uspekhi Matematicheskikh Nauk, Vol. 12, No. 6

1960 ...

Georgy Adelson-Velsky, Evgenii Landis (1962). An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences, 146: 263–266. (Russian) English translation by Myron J. Ricci in Soviet Mathematics Doklady, No. 3 ^[34]

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.
Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (1975). Some Methods of Controlling the Tree Search in Chess Programs. Artificial Intelligence, Vol. 6, No. 4, pp. 361-371. ISSN 0004-3702. Reprinted (1988) in Computer Chess Compendium pp. 129-135. ^[35]
Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (1977). On the Structure of an Important Class of Exhaustive Problems and Methods of Search Reduction for them. Advances in Computer Chess 1
Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (1979). Algorithms of adaptive search. Machine Intelligence 9 (eds. Jean Hayes Michie, Donald Michie and L.I. Mikulich), pp. 373-384. Ellis Horwood, Chichester

1980 ...

Georgy Adelson-Velsky, V. P. Akimov, Vladimir Arlazarov (1981). On a probabilistic approach tо verification of the Shannon game model. Avtomatika i Telemekhanika, No. 9, 138–144
Г.М. Адельсон-Вельский, В.Л. Арлазаров, А.Р. Битман, М.В. Донской (1983). Машина играет в шахматы, pdf (book with detailed explanations of Kaissa algorithms, language: Russian)
Georgy Adelson-Velsky, V. P. Akimov (1987). On validity of Shannon's game model. Avtomatika i Telemekhanika, No. 1, 171–173
Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (1988). Algorithms for Games. Springer-Verlag, New York, NY. ISBN 3-540-96629-3. amazon.com

2000 ...

Georgy Adelson-Velsky, Eugene Levner (2002). Project scheduling in AND-OR graphs: a generalization of Dijkstra’s algorithm. Mathematics of Operations Research, Vol. 27, No. 3

Forum Posts

Early Reference on Bit-Boards by Tony Warnock, rgc, October 29, 1994
Kaissa & Botvinik by Shay Bushinsky, rgcc, October 16, 1997
Method of Analogies?? by Bruce Cleaver, CCC, May 29, 1998

External Links

Georgy Adelson-Velsky from Wikipedia
The Mathematics Genealogy Project - Georgiy Adelson-Velsky
Georgy M. Adelson-Velsky Biography, Dynkin Collection
Interview with Georgy Adelson-Velsky (pdf) by Eugene Dynkin, Moscow, September 1, 1990
Facts about Georgy Adelson-Velsky - Evi
Photos of Georgy M Adelson-Velsky (1922 - 2014) - ForeverMissed.com
Памяти Г. М. Адельсон-Вельского | Facebook
Адельсон Вельский Г.М. рассказывает 2002 год, YouTube Video

References

^ Georgy Adelson-Velsky, Evgenii Landis (1962). An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences, 146: 263–266. (Russian) English translation by Myron J. Ricci in Soviet Mathematics Doklady, No. 3
^ The Mathematics Genealogy Project - Georgiy Adelson-Velsky
^ Interview with Georgy Adelson-Velsky (pdf) by Eugene Dynkin, Moscow, September 1, 1990
^ Georgi Maximowitsch Adelson-Welski - Wikipedia.de (German)
^ Kaissa & Botvinik by Shay Bushinsky, rgcc, October 16, 1997
^ Georgy Adelson-Velsky from Wikipedia
^ Misha Furman - RIP: Георгий Максимович Адельсон-Вельский, April 26, 2014
^ Photo by Monroe Newborn from History of Computer Chess from The Computer History Museum
^ История компьютерных игр. Виртуальный компьютерный музей. Англо-Русский компьютерный словарь. Вычисления в докомпьютерную эпоху. Технологии. Компьютерные игры. История развития электросвязи. История развития ПО. История вычислительной техники в России и за рубежом from the Russian Virtual Computer Museum
^ International Grandmaster and World Champion Mikhail Botvinnik in Moscow, 1980, Gift of Monroe Newborn, "Botvinnik served as a consultant to Soviet computer chess developers who developed an early program at ITEP which won a correspondence chess match against a Stanford University chess program led by John McCarthy in 1967. Later he advised the team that created the chess program Kaissa at Moscow’s Institute for Control Science"
^ The Fast Universal Digital Computer M-2 from the Russian Virtual Computer Museum
^ Photos of Georgy M Adelson-Velsky (1922 - 2014) - ForeverMissed.com, shared by: Семен Карпенко, June 01, 2014
^ Tony Marsland, Monty Newborn (1981). A brighter future for Soviet computer chess? ICCA Newsletter, Vol. 4, No. 1, pdf
^ Photo Computer chess pioneer Adelson-Velsky at chalkboard in Moscow 1980 by Monroe Newborn, History of Computer Chess from The Computer History Museum
^ История “Каиссы” Михаил Донской from Russian Virtual Computer Museum (no longer available) translated with the help of Babel Fish and promt translator
^ 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)
^ Михаил Донской: Жизненный цикл программиста - ПОЛИТ.РУ (Russian) Mikhail Donskoy - The life cycle of a programmer translated by Google Translate, polit.ru August 20, 2008
^ Yefim Dinitz talk at Shimon Even's Party (2003) hosted by Oded Goldreich
^ Yefim Dinitz (2006). Dinitz' Algorithm: The Original Version and Even's Version. Theoretical Computer Science, Springer, pdf, transliteration of names adapted
^ Dinic's algorithm from Wikipedia
^ Vladimir Arlazarov, E. A. Dinic, M. A. Kronrod, I. A. Faradzhev (1970). On economical construction of the transitive closure of a directed graph. Doklady Akademii Nauk (in English) 194, No. 11, 1209-1210
^ Alexander V. Karzanov (1974). Determining the maximal flow in a network by the method of preflows. Soviet Mathematics - Doklady, Vol. 15, No. 1
^ Andrey Ershov, Mikhail R. Shura-Bura (1980). The Early Development of Programming in the USSR. in Nicholas C. Metropolis (ed.) A History of Computing in the Twentieth Century. Academic Press, preprint pp. 44
^ Радио Свобода: Программы: Интернет - Not very serious about digital, Radio Liberty interview with Michael Schwartzman and Mikhail Donskoy, December 31, 2002, translated by Google Translate
^ Lecture Materials | Algorithms and Data Structures | University of Waterloo
^ "Каисса" - Историю программы рассказывает один из ее создателей Михаил Донской - Kaissa by Mikhail Donskoy, translated by Google Translate
^ Tony Marsland, Monty Newborn (1981). A brighter future for Soviet computer chess? ICCA Newsletter, Vol. 4, No. 1, pdf
^ Персоналии: Адельсон-Вельский Г М
^ zbMATH - Adelson-Velsky, George M.
^ dblp: George M. Adelson-Velsky
^ dblp: Georgii M. Adelson-Velsky
^ dblp: G. M. Adelson-Velskiy
^ AVL tree from Wikipedia
^ Method of Analogies?? by Bruce Cleaver, CCC, May 29, 1998

What links here?

Page	Date Edited
Alexander Bitman	Jun 2, 2015
Alexander Brudno	Apr 9, 2018
Alexander Kronrod	Apr 9, 2018
Alexander Zhivotovsky	Sep 10, 2013
Algorithms	May 5, 2017
Anatoly Uskov	Jan 7, 2016
Bar-Ilan University	Feb 15, 2017
Bitboards	Nov 14, 2017
CAPS	Dec 23, 2017
Chess	Jan 21, 2018
Computer Chess Compendium	Dec 29, 2015
Data	Nov 26, 2017
Efficient Generation of Sliding Piece Attacks	Nov 5, 2016
Evaluation Overlap	Jul 19, 2016
Games	Feb 20, 2018
Georgy Adelson-Velsky	Apr 9, 2018
Hartmut Tanke	Sep 7, 2014
Hex	Dec 29, 2017
History	Jan 2, 2018
Institute of Control Sciences	Jun 2, 2015
Institute of Theoretical and Experimental Physics	Sep 8, 2015
ITEP Chess Program	Apr 2, 2014
John McCarthy	Jan 5, 2017
Kaissa	Apr 9, 2018
M-2	Sep 10, 2013
M-20	Oct 9, 2013
Mathematician	Apr 9, 2018
Mikhail Botvinnik	Jul 15, 2017
Mikhail Donskoy	Dec 23, 2017
Moscow State University	May 20, 2016
Null Move Pruning	Dec 2, 2017
People	Feb 28, 2018
Pioneer	Dec 23, 2017
Point Value by Regression Analysis	Aug 26, 2017
Quote Donskoy	Dec 2, 2013
Quote Donskoy on AVL	Apr 2, 2014
Quote Remembering Kronrod	Dec 2, 2013
Quote Shura-Bura	Dec 2, 2013
Quote Yershov	Dec 2, 2013
Search	Feb 1, 2018
Search Tree	Dec 23, 2016
Sloppy	Sep 17, 2016
Stanford-ITEP Match	Apr 9, 2018
Trajectory	Jan 3, 2015
University of Waterloo	Jan 29, 2018
Vladimir Arlazarov	May 20, 2016
WCCC 1974	Jan 19, 2018
WCCC 1977	Dec 22, 2017
WCCC 1989	Dec 5, 2017

Up one level

Go

GerdIsenberg — Wed, 24 Jan 2018 15:08:02 GMT

Home * Games * Go

		The game of Go has attracted game researchers and programmers as an ambitious AI-challenge. Albert Zobrist was a pioneer, who wrote the first Go program in 1968 as part of his Ph.D. Thesis on pattern recognition ^[1]. Chess programmers, beside others, Rémi Coulom and Gian-Carlo Pascutto became successful Go programmers with their programs CrazyStone and Leela respectively. Competitive computer Go, as organized by the ICGA ^[2], is played on boards with 9x9 as well with default 19x19 grids. Since Go lacks a simple evaluation function mainly based on counting material, attempts to apply similar techniques and algorithms as in chess were less successful. The breakthrough in computer Go was accomplished by Monte-Carlo tree search and deep learning.
19*19 Go board ^[3]

Progress

Monte-Carlo Go

After early trials to apply Monte Carlo methods to a Go playing program by Bernd Brügmann in 1993 ^[4], recent developments since the mid 2000s by Bruno Bouzy ^[5], and by Rémi Coulom, who coined the term Monte-Carlo Tree Search ^[6], in conjunction with UCT (Upper Confidence bounds applied to Trees) introduced by Levente Kocsis and Csaba Szepesvári ^[7], led to a breakthrough in computer Go ^[8].

CNNs

As mentioned by Ilya Sutskever and Vinod Nair in 2008 ^[9], convolutional neural networks are well suited for problems with a natural translation invariance, such as object recognition. Go has some translation invariance, because if all the pieces on a hypothetical Go board are shifted to the left, then the best move will also shift (with the exception of pieces that are on the boundary of the board). Many applications of neural networks to Go have already used convolutional neural networks, such as Nicol N. Schraudolph et al. ^[10], Erik van der Werf et al. ^[11], and Markus Enzenberger ^[12], among others.

In 2014, two teams independently investigated whether deep convolutional neural networks ^[13] could be used to directly represent and learn a move evaluation function for the game of Go. Christopher Clark and Amos Storkey trained an 8-layer convolutional neural network by supervised learning from a database of human professional games, which without any search, defeated the traditional search program Gnu Go in 86% of the games ^[14] ^[15] ^[16] ^[17] ^[18]. In their paper Move Evaluation in Go Using Deep Convolutional Neural Networks ^[19], Chris J. Maddison, Aja Huang, Ilya Sutskever, and David Silver report they trained a large 12-layer convolutional neural network in a similar way, to beat Gnu Go in 97% of the games, and matched the performance of a state-of-the-art Monte-Carlo Tree Search that simulates a million positions per move ^[20].

AlphaGo

In 2015, a team affiliated with Google DeepMind around David Silver, Aja Huang, Chris J. Maddison, and Demis Hassabis, supported by Google researchers John Nham and Ilya Sutskever, build a Go playing program dubbed AlphaGo, combining Monte-Carlo tree search with their 12-layer networks ^[21], the “policy network,” to select the next move, the “value network,” to predict the winner of the game. The neural networks were trained on 30 million moves from games played by human experts, until it could predict the human move 57 percent of the time. AlphaGo achieved a huge winning rate against other Go programs, and defeated European Go champion Fan Hui ^[22] in October 2015 with a 5 - 0 score ^[23] ^[24]. On March 9 to 15, 2016, AlphaGo won a $1M 5-game challenge match in Seoul versus Lee Sedol with 4 - 1 ^[25] ^[26] ^[27].

During The Future of Go Summit from May 23 to 27, 2017 in Wuzhen, China, AlphaGo won a three-game match versus current world No. 1 ranking player Ke Ji. After the Summit, AlphaGo is now retired from competitive play while DeepMind continues AI research in other areas ^[28].

AlphaGo Zero & AlphaZero

However, in October 2017, AlphaGo Zero, an evolution of AlphaGo was introduced. While previous versions were initially trained on thousands of human amateur and professional games to learn how to play Go, AlphaGo Zero learns exclusively by playing games against itself, starting from completely random play, to quickly surpass human level of play and defeated the previously published champion-defeating version of AlphaGo by 100 games to 0 ^[29] ^[30]. AlphaGo Zero was further improved and even generalized for other games now dubbed AlphaZero, as published in December 2017 ^[31].

Fine Art

Fine Art is a Go playing entity developed since 2016 under the patronage of the Chinese media company Tencent by a team around Liu Yongsheng, along with Ma Bo, Tang Shanmin, Wu Guangyu, and Zhang Kaixu. It won the Computer Go UEC Cup at the University of Electro-Communications, Chōfu, Tokyo, Japan, in March 2017 against a field of 27 other programs including DeepZenGo and Crazy Stone ^[32]. In January 2018, it defeated Ke Jie 9P in 77 moves after giving two stones handicap ^[33] on Fox Weiqi ^[34] server ^[35] ^[36].

Quotes

Quote by Gian-Carlo Pascutto in 2010 ^[37]:

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.

Computer Olympiads

Selected Publications

^[38]

1960 ...

Jack Good (1965). The Mystery of Go. Literature: Reports hosted by Atlas Computer Laboratory

1970 ...

Albert Zobrist (1970). Feature Extraction and Representation for Pattern Recognition and the Game of Go. Ph.D. Thesis (152 pp.), University of Wisconsin, also published as technical report, pdf
Walter R. Reitman, James Kerwin, Robert Nado, Judith S. Reitman, Bruce Wilcox (1974). Goals and Plans in a Program for Playing Go. Proceedings of the 29th ACM Conference, reprinted in David Levy (ed.) (1988). Computer Games II. google books
Walter R. Reitman, Bruce Wilcox (1975). Perception and representation of spatial relations in a program for playing Go. Proceedings of the 30th ACM Conference, reprinted in David Levy (ed.) (1988). Computer Games II.
Judith S. Reitman (1976). Skilled Perception in Go: Deducing Memory Structures from Inter-Response Times. Cognitive Psychology, Vol. 8, No, 3
Walter R. Reitman, Bruce Wilcox (1977). Pattern Recognition and Pattern-Directed Inference in a Program for Playing Go. ACM SIGART Bulletin, No. 63, reprinted in David Levy (ed.) (1988). Computer Games II.
Editor (1979). Computer GO Has Come. Personal Computing, Vol. 3, No. 5, pp. 55
Walter R. Reitman, Bruce Wilcox (1979). Modelling Tactical Analysis and Problem Solving in Go. Proceedings of the Tenth Annual Pittsburgh Conference on Modelling and Simulation
Walter R. Reitman, Bruce Wilcox (1979). The Structure and Performance of the INTERIM.2 Go Program. IJCAI 1979, reprinted in David Levy (ed.) (1988). Computer Games II.

1980 ...

Editor (1980). The Challenge of Computer Go. Personal Computing, Vol. 4, No. 8, pp. 79
Editor (1980). Zobrist Program in Action. Personal Computing, Vol. 4, No. 8, pp. 81 » Albert Zobrist
Bruce Wilcox (1985). Reflections on building two Go programs. ACM SIGART Bulletin, No. 94
Anders Kierulf (1985). Smart Go Board: Algorithms for the Tactical Calculator. Diploma thesis (unpublished), ETH Zurich.
David Levy (ed.) (1988). Computer Games II. Springer, ISBN: 978-1-4613-8756-5, Chapter 5 - Go
Janusz Kraszek (1988). Heuristics in the life and death algorithm of a Go playing program. Computer Go 9 (Winter 1988-89)
Anders Kierulf, Jürg Nievergelt (1989). Swiss Explorer blunders its way into winning the first computer Go Olympiad. Heuristic Programming in AI 1
Ken Chen (1989). Group Identification in Computer Go. Heuristic Programming in AI 1

1990

Ken Chen (1990). The Move Decision Process of Go Intellect, Computer Go, No.14, pp. 9-17.
Ken Chen, Anders Kierulf, Martin Müller, Jürg Nievergelt (1990). The Design and Evolution of Go Explorer. Computers, Chess, and Cognition
Kiyoshi Shirayanagi (1990). Knowledge Representation and its Refinement in Go Programs. Computers, Chess, and Cognition

1991

David Wolfe (1991). Mathematics of Go: Chilling Corridors. Ph.D. thesis, University of California, Berkeley, advisor Elwyn Berlekamp
Herbert D. Enderton (1991). The Golem Go Program. Technical Report CMU-CS-92-101, Carnegie Mellon University
Ken Chen (1991). Go Intellect wins two Gold Medals. Heuristic Programming in AI 2
Barney Pell (1991). Exploratory Learning in the Game of GO. Heuristic Programming in AI 2
Thomas Wolf (1991). Investigating Tsumego Problems with "RisiKo". Heuristic Programming in AI 2

1992

Warren D. Smith (1992). Hash functions for Binary and Ternary Words. NEC Research Institute, ps
Thomas Wolf (1992). Generating tsume go problems with GoTools. Heuristic Programming in AI 4 ^[39]

1993

David Fotland (1993). Knowledge representation in the Many Faces of Go.
Bernd Brügmann (1993). Monte Carlo Go. pdf ^[40]

1994

Elwyn Berlekamp, David Wolfe (1994). Mathematical Go - Chilling Gets the Last Point. A K Peters Ltd., also in paperback as Mathematical Go Endgames: Nightmares For the Professional Go Player. Ishi Press ^[41]
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sejnowski (1994). Temporal Difference Learning of Position Evaluation in the Game of Go. Advances in Neural Information Processing Systems 6 ^[42]

1995 ...

Jay Burmeister, Janet Wiles (1995). CS-TR-339 Computer Go Tech Report. Departments of Computer Science and Psychology, The University of Queensland, QLD 4072, Australia (permanently - under construction)
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
Tristan Cazenave (1995). Learning and Problem Solving in Gogol, a Go playing program. pdf

1996

Bruce Wilcox, Sue Wilcox (1996). EZ-GO-Oriental Strategy in a Nutshell. KI Press, ISBN13 978-0965223546 ^[43]
Markus Enzenberger (1996). The Integration of A Priori Knowledge into a Go Playing Neural Network.
Martin Müller, Ralph Gasser (1996). Experiments in Computer Go Endgames. Games of No Chance edited by Richard J. Nowakowski
Martin Müller, Elwyn Berlekamp, Bill Spight (1996). Generalized thermography: Algorithms, implementation, and application to Go endgames. Technical Report 96-030, ICSI Berkeley, 1996. postscript
Bruno Bouzy, Tristan Cazenave (1996). Shared concepts between complex systems and the game of Go. pdf

1997

Tristan Cazenave (1997). Gogol (an Analytical Learning Program). IJCAI'97, pdf
Bruno Bouzy, Tristan Cazenave (1997). Using the Object Oriented Paradigm to Model Context in Computer Go. Context'97, pdf

1998

Ken Chen (1998). Heuristic Search in Go Game Tree, Proceedings of Joint Conference on Information Sciences ’98, Vol. II, pp. 274-278. The Association for Intelligent Machinery, Inc. ISBN 0-9643456-7-6.
Tristan Cazenave (1998). Integration of Different Reasoning Modes in a Go Playing and Learning System. pdf
Bill Spight (1998). Extended Thermography for Multiple Kos in Go. CG 1998
Martin Müller (1998). Computer Go: A Research Agenda. CG 1998
Shinichi Sei, Toshiaki Kawashima (1998). Memory-Based Approach in Go-program KATSUNARI. Fujitsu Social Science Laboratory, pdf
Morihiko Tajima, Noriaki Sanechika (1998). Estimating the Possible Omission Number for Groups in Go by the Number of n -th Dame. CG 1998

1999

Ken Chen, Zhixing Chen (1999). Static Analysis of Life and Death in the Game of Go. Information Sciences, Vol. 121, Nos. 1-2, pdf

2000 ...

Thomas Thomsen (2000). Lambda-Search in Game Trees - with Application to Go. CG 2000 also published in ICGA Journal, Vol. 23, No. 4, winning the 2001 ICGA Journal Award, preprint as pdf » Lambda-Search
Jan Ramon, Tom Francis, Hendrik Blockeel (2000). Learning a Go Heuristic with Tilde. CG 2000
Martin Müller (2000). Review: Computer Go 1984–2000. CG 2000
Jay Burmeister (2000). Studies in Human and Computer Go: Assessing the Game of Go as a Research Domain for Cognitive Science. Ph.D. thesis, School of Computer Science and Electrical Engineering and School of Psychology, The University of Queensland, Australia, pdf
Jay Burmeister, Yasuki Saito, Atsushi Yoshikawa, Janet Wiles (2000) Memory Performance of Master Go Players. in Jaap van den Herik, Hiroyuki Iida (eds.) (2000). Games in AI Research. pp. 271-286
Ken Chen (2000). Some Practical Techniques for Global Search in Go. ICGA Journal, Vol. 23, No. 2
Kuo-Yuan Kao (2000). Mean and Temperature Search for Go Endgames. Information Sciences, Vol. 122, No. 1
Marcel Crâsmaru, John Tromp (2000). Ladders Are PSPACE-Complete. CG 2000
Shinichi Sei, Toshiaki Kawashima (2000). A Solution of Go on 4x4 Board by Game Tree Search Program. Fujitsu Social Science Laboratory, Japanese pdf
Thomas Wolf (2000). Forward Pruning and Other Heuristic Search Techniques in Tsume Go. Special Issue of Information Sciences, Vol. 122, No. 1, CiteSeerX

2001

Bruno Bouzy (2001). Go Patterns Generated by Retrograde Analysis. 6th Computer Olympiad Workshop, pdf
Erik van der Werf, Jaap van den Herik (2001). Visual Learning in Go. 6th Computer Olympiad Workshop, pdf
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sejnowski (2001). Learning to Evaluate Go Positions via Temporal Difference Methods. in Norio Baba, Lakhmi C. Jain (eds.) (2001). Computational Intelligence in Games, Studies in Fuzziness and Soft Computing. Physica-Verlag, revised version of 1994 paper
Tristan Cazenave (2001). Generating Patterns with External Conditions for the Game of Go. Advances in Computer Games 9, pdf
Jeng-Chi Yan, Shun-Chin Hsu (2001). A Positional Judgment System for computer Go. Advances in Computer Games 9
Bruno Bouzy, Tristan Cazenave (2001). Computer Go: an AI-oriented Survey. Artificial Intelligence Journal, Vol. 132, pdf
Alex B. Meijer, Henk Koppelaar (2001). A learning architecture for the game of Go. Game-On 2001
Alex B. Meijer, Henk Koppelaar (2001). Pursuing abstract goals in the game of Go. BNAIC 2001
Ken Chen (2001). Computer Go: Knowledge, Search, and Move Decision. ICGA Journal, Vol. 24, No. 4, pdf

2002

Tristan Cazenave (2002). Admissible Moves in Two-Player Games. SARA 2002, pdf
Ken Chen (2002). GO4++ wins 19x19 Go tournament. ICGA Journal, Vol. 25, No. 3 » 7th Computer Olympiad
Erik van der Werf (2002). GO4++ wins 9x9 Go tournament. ICGA Journal, Vol. 25, No. 3 » 7th Computer Olympiad
Erik van der Werf (2002). Solving Ponnuki-Go on Small Boards. 7th Computer Olympiad Workshop
Erik van der Werf, Jos Uiterwijk, Jaap van den Herik (2002). Solving Ponnuki-Go on Small Boards. BNAIC’02, pdf
Bruno Bouzy (2002). A Small Go Board Study of Metric and Dimensional Evaluation Functions. CG 2002
Erik van der Werf, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). Local Move Prediction in Go. CG 2002
Bill Spight (2002). Evaluating Kos in a Neutral Threat Environment: Preliminary Results. CG 2002
Teigo Nakamura, Elwyn Berlekamp (2002). Analysis of Composite Corridors. CG 2002
David Fotland (2002). Static Eye in "The Many Faces of Go". ICGA Journal, Vol. 25, No. 4
Zhixing Chen (2002). Semi-Empirical Quantitative Theory of Go Part I: Estimation of the Influence of a Wall. ICGA Journal, Vol. 25, No. 4
Martin Müller (2002). Position Evaluation in Computer Go. ICGA Journal, Vol. 25, No. 4
David Wolfe (2002). Go endgames are PSPACE-hard. in Richard J. Nowakowski (ed) (2002). More Games of No Chance. Cambridge University Press

2003

Matthew Pratola, Thomas Wolf (2003). Optimizing GOTOOLS' Search Heuristics using Genetic Algorithms. ICGA Journal, Vol. 26, No. 1, also arXiv:cs/0302002 » Genetic Programming
Ken Chen (2003). Soft decomposition search and binary game forest model for move decision in Go, Information Sciences, Vol. 154, Issues 3-4, 157-172, pdf
Markus Enzenberger (2003). Evaluation in Go by a Neural Network using Soft Segmentation. Advances in Computer Games 10, pdf
Akihiro Kishimoto, Martin Müller. (2003). Df-pn in Go: An Application to the One-Eye Problem. Advances in Computer Games 10, pdf » Proof-Number Search ^[44]
Bruno Bouzy, Bernard Helmstetter (2003). Monte Carlo Go Developments. Advances in Computer Games 10, pdf
Bruno Bouzy (2003). Mathematical morphology applied to computer go. IJPRAI Vol. 17, No. 2
Bruno Bouzy (2003). The move decision strategy of Indigo. ICGA Journal, Vol. 26, No. 1
Ken Chen (2003). The Way to Go is Bottom Up. ICGA Journal, Vol. 26, No. 2
Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2003). Solving Go on Small Boards. ICGA Journal, Vol. 26, No. 2, pdf
Ken Chen (2003). GNUGo wins 19x19 Go tournament. ICGA Journal, Vol. 26, No. 4 » 8th Computer Olympiad
Erik van der Werf (2003). Aya wins 9x9 Go tournament. ICGA Journal, Vol. 26, No. 4 » 8th Computer Olympiad
Alex B. Meijer, Henk Koppelaar (2003). Towards Multi-Objective Game Theory - with Application to Go. Game-On 2003, pdf

2004

Bruno Bouzy (2004). Associating Shallow and Selective Global Tree Search with Monte Carlo for 9 × 9 Go. CG 2004
Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2004). Learning to Estimate Potential Territory in the Game of Go. CG 2004, pdf
Xiaozhen Niu, Martin Müller (2004). An Improved Safety Solver for Computer Go. CG 2004
Jan Ramon, Tom Croonenborghs (2004). Searching for Compound Goals Using Relevancy Zones in the Game of Go. CG 2004
David Fotland (2004). Go Intellect wins 19x19 Go tournament. ICGA Journal, Vol. 27, No. 3 » 9th Computer Olympiad
Bruno Bouzy (2004). Go Intellect wins 9x9 Go tournament. ICGA Journal, Vol. 27, No. 3 » 9th Computer Olympiad
Erik van der Werf (2004). AI techniques for the game of Go. Ph.D. thesis, Universiteit Maastricht, Maastricht, The Netherlands. ISBN 90 5278 445 0, pdf
Bruno Bouzy (2004). Toward a go player computational model. Habilitation to Supervise Research document, Paris 6 University

2005 ...

Tristan Cazenave, Bernard Helmstetter (2005). Combining tactical search and Monte-Carlo in the game of Go. IEEE CIG 2005, pdf, pdf
Tristan Cazenave (2005). The separation game. JCIS 2005, pdf
Shi-Jim Yen, Jr-Chang Chen (2005). Handtalk III wins 19x19 Go tournament. ICGA Journal, Vol. 28, No. 3 » 10th Computer Olympiad
Shi-Jim Yen, Jeng-Chi Yan (2005). Go Intellect wins 9x9 Go tournament. ICGA Journal, Vol. 28, No. 3 » 10th Computer Olympiad
Xiaozhen Niu, Akihiro Kishimoto, Martin Müller (2005). Recognizing Seki in Computer Go. Advances in Computer Games 11
Bruno Bouzy (2005). Move-Pruning Techniques for Monte-Carlo Go. Advances in Computer Games 11
Bruno Bouzy (2005). Associating domain-dependent knowledge and Monte Carlo approaches within a go program. Information Sciences, Heuristic Search and Computer Game Playing IV

2006

Ken Chen, Peigang Zhang (2006). A New Heuristic Search Algorithm for Capturing Problems in Go. CG 2006
Xiaozhen Niu, Martin Müller (2006). An Open Boundary Safety-of-Territory Solver for the Game of Go. CG 2006
Jahn-Takeshi Saito, Guillaume Chaslot, Jos Uiterwijk, Jaap van den Herik (2006). Monte-Carlo Proof-Number Search for Computer Go. CG 2006
Tristan Cazenave (2006). Virtual Global Search: Application to 9×9 Go. CG 2006
Rémi Coulom (2006). Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. CG 2006, pdf
John Tromp, Gunnar Farnebäck (2006). Combinatorics of Go. CG 2006
Rémi Coulom, Ken Chen (2006). Crazy Stone wins 9x9 Go tournament. ICGA Journal, Vol. 29, No. 2 » 11th Computer Olympiad
Rémi Coulom, Ken Chen (2006). Gnu Go wins 19x19 Go tournament. ICGA Journal, Vol. 29, No. 2 » 11th Computer Olympiad
Bruno Bouzy (2006). History and Territory Heuristics for Monte-Carlo Go. New Mathematics and Natural Computation
Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kaneko, Akihiro Kishimoto, Kenjiro Taura (2006). Monte Carlo Go Has a Way to Go. AAAI 2006, pdf
Julio César Hernández-Castro, Ignacio Blasco-López, Juan M. Estevez-Tapiador, Arturo Ribagorda-Garnacho (2006). Steganography in games: A general methodology and its application to the game of Go. Computers & Security, Vol. 25, pdf ^[45]

2007

Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller (2007). Lambda Depth-First Proof-Number Search and Its Application to Go. 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pdf » Proof-Number Search
Tristan Cazenave (2007). Playing the Right Atari. ICGA Journal, Vol. 30, No. 1, pdf
Erik van der Werf (2007). Steenvreter wins 9x9 Go tournament. ICGA Journal, Vol. 30, No. 2 » 12th Computer Olympiad
Sylvain Gelly, Yizao Wang (2007). MoGo wins 19x19 Go tournament. ICGA Journal, Vol. 30, No. 2 » 12th Computer Olympiad
Ken Chen, Peigang Zhang (2007). Monte-Carlo Go with Knowledge-Guided Simulations. CGW 2007
Esa A. Seuranen (2007). Introducing Playing Style to Computer Go. CGW 2007, pdf
Thomas Wolf, Lei Shen (2007). Checking Life & Death Problems in Go. I: The Program SCANLD. CGW 2007, pdf
Rémi Coulom (2007). Computing Elo Ratings of Move Patterns in the Game of Go. CGW 2007
Rémi Coulom (2007). Computing Elo Ratings of Move Patterns in the Game of Go. ICGA Journal, Vol. 30, No. 4, pdf
Nobuo Araki, Kazuhiro Yoshida, Yoshimasa Tsuruoka, Jun'ichi Tsujii (2007). Move Prediction in Go with the Maximum Entropy Method. CIG 2007, pdf

2008

Ken Chen, Peigang Zhang (2008). Monte-Carlo Go with Knowledge-Guided Simulations. ICGA Journal, Vol. 31, No. 2
Tristan Cazenave (2008). Multi-player Go. CG 2008
Ling Zhao, Martin Müller (2008). Using Artificial Boundaries in the Game of Go. CG 2008
Ken Chen, Dawei Du, Peigang Zhang (2008). A Fast Indexing Method for Monte-Carlo Go. CG 2008
Xiaozhen Niu, Martin Müller (2008). An Improved Safety Solver in Go Using Partial Regions. CG 2008
Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Mei-Hui Wang, Shang-Rong Tsai, Shun-Chin Hsu (2008). Human-Computer Go Revolution 2008. ICGA Journal, Vol. 31, No. 3
Shogo Takeuchi, Tomoyuki Kaneko, Kazunori Yamaguchi (2008). Evaluation of Monte Carlo tree search and the application to Go. CIG 2008
Peigang Zhang, Ken Chen (2008). Monte-Carlo Go Capturing Tactic Search. New Mathematics and Natural Computation, Vol. 4, No. 3
Ilya Sutskever, Vinod Nair (2008). Mimicking Go Experts with Convolutional Neural Networks. ICANN 2008, pdf
Thomas Wolf (2008). Mastering Ladders. Slate & Shell

2009

Esa A. Seuranen (2009). Entropy in Go. ICGA Journal, Vol. 32, No. 1
Mark Winands (2009). Many Faces of Go wins 9x9 and 19x19 Go tournaments. ICGA Journal, Vol. 32, No. 1 » 13th Computer Olympiad
Markus Enzenberger, Martin Müller (2009). Fuego - An Open-source Framework for Board Games and Go Engine Based on Monte-Carlo Tree Search. pdf
Martin Müller (2009). Fuego at the Computer Olympiad in Pamplona 2009: A Tournament Report. TR09-09, pdf
Rémi Coulom (2009). The Monte-Carlo Revolution in Go. JFFoS'2008: Japanese-French Frontiers of Science Symposium, slides as pdf
Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai, Shun-Chin Hsu, Tzung-Pei Hong (2009). The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. pdf
Chang-Shing Lee, Mei-Hui Wang, Tzung-Pei Hong, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yau-Hwang Kuo (2009). A Novel Ontology for Computer Go Knowledge Management. IEEE FUZZ (2009), pdf
Vincent Berthier, Amine Bourki, Matthieu Coulm, Guillaume Chaslot, Christophe Fiter, Sylvain Gelly, Jean-Baptiste Hoock, Rémi Munos, Julien Pérez, Arpad Rimmel, Philippe Rolet, Olivier Teytaud, Paul Vayssière, Yizao Wang, Ziqin Yu (et al.) (2009). Computer-Go is not only for Go. Korea, August 2009 slides as pdf
Ken Chen (2009). Fuego wins 9x9 Go tournaments. ICGA Journal, Vol. 32, No. 2 » 14th Computer Olympiad
Ken Chen (2009). Zen wins 19x19 Go tournaments. ICGA Journal, Vol. 32, No. 2 » 14th Computer Olympiad
John Tromp, Gunnar Farnebäck (2009). Combinatorics of Go. (revisited version of the CG 2006 paper)
Ken Chen, Dawei Du, Peigang Zhang (2009). Monte-Carlo Tree Search and Computer Go. Advances in Information and Intelligent Systems 2009
Seth Pellegrino, Andrew Hubbard, Jason Galbraith, Peter D. Drake, Yung-Pin Chen (2009). Localizing Search in Monte-Carlo Go using Statistical Covariance. ICGA Journal, Vol. 32, No. 3
Thomas Wolf (2009). A library of eyes in Go, I: A life & death definition consistent with `bent-4'. in Michael H. Albert, Richard J. Nowakowski (eds) (2009). Games of No Chance 3. Cambridge University Press, pdf
Thomas Wolf, Matthew Pratola (2009). A library of eyes in Go, II: Monolithic eyes. in Michael H. Albert, Richard J. Nowakowski (eds) (2009). Games of No Chance 3. Cambridge University Press, pdf

2010 ...

Frank Karger, Michael Babar (2010). MyGoFriend wins Go 9x9 Tournament. ICGA Journal, Vol. 33, No. 3 » 15th Computer Olympiad
Shih-Chieh Huang, Shi-Jim Yen (2010). Many Faces of Go wins Go 13x13 Tournament. ICGA Journal, Vol. 33, No. 3 » 15th Computer Olympiad
David Fotland (2010). Erica wins Go 19x19 Tournament. ICGA Journal, Vol. 33, No. 3 » 15th Computer Olympiad
Shih-Chieh Huang, Rémi Coulom, Shun-Shii Lin (2010). Monte-Carlo Simulation Balancing applied to 9x9 Go. ICGA Journal, Vol. 33, No. 4
Krzysztof Krawiec, Marcin Szubert (2010). Coevolutionary Temporal Difference Learning for small-board Go. IEEE Congress on Evolutionary Computation
Hendrik Baier (2010). Adaptive Playout Policies for Monte-Carlo Go. Master's thesis, University of Osnabrück, pdf
Hendrik Baier, Peter D. Drake (2010). The power of forgetting: Improving the last-good-reply policy in Monte Carlo Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2, No. 4
Chang-Shing Lee, Mei-Hui Wang, Shi-Jim Yen, Yu-Jen Chen, Cheng-Wei Chou, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Hassen Doghmen (2010). An ontology-based fuzzy inference system for computer Go applications. International Journal of Fuzzy Systems, Vol. 12, No. 2, pdf

2011

Abdallah Saffidine (2011). Moccos wins the Panthom-Go Tournament. ICGA Journal, Vol. 34, No. 1 » 15th Computer Olympiad
Ingo Althöfer (2011). John Tromp in the Style of David Levy: 4-0 win in the Go bet. ICGA Journal, Vol. 34, No. 2 » John Tromp ^[46]
Shih-Chieh Huang, Rémi Coulom, Shun-Shii Lin (2011). Time Management for Monte-Carlo Tree Search Applied to the Game of Go. TAAI 2010, pdf
Shih-Chieh Huang (2011). New Heuristics for Monte Carlo Tree Search Applied to the Game of Go. Ph.D. thesis, pdf
Hendrik Baier, Mark Winands (2011). Active Opening Book Application for Monte-Carlo Tree Search in 19x19 Go. BNAIC 2011, pdf
Petr Baudiš, Jean-Loup Gailly (2011). Pachi: State of the Art Open Source Go Program. Advances in Computer Games 13
Hendrik Baier, Mark Winands (2011). Time Management for Monte-Carlo Tree Search in Go. Advances in Computer Games 13
Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Hui-Ming Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen (2011). Towards a Solution of 7x7 Go with Meta-MCTS. Advances in Computer Games 13
Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir, David Spies (2011). Blunder Cost in Go and Hex. Advances in Computer Games 13
Jiao Wang, Shiyuan Li, Jitong Chen, Xin Wei, Huizhan Lv, Xinhe Xu (2011). 4*4-Pattern and Bayesian Learning in Monte-Carlo Go. Advances in Computer Games 13
Sylvain Gelly, David Silver (2011). Monte-Carlo tree search and rapid action value estimation in computer Go. Artificial Intelligence, Vol. 175, No. 11
Łukasz Lew (2011). Modeling Go Game as a Large Decomposable Decision Process. Ph.D. thesis, University of Warsaw
Krzysztof Krawiec, Wojciech Jaśkowski, Marcin Szubert (2011). Evolving small-board Go players using Coevolutionary Temporal Difference Learning with Archives. Applied Mathematics and Computer Science, Vol. 21, No. 4
Thomas Wolf (2011). A Dynamical Systems Approach for Static Evaluation in Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 3, No 2, also arXiv:1108.4220 ^[47]

2012

Sylvain Gelly, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Levente Kocsis, David Silver, Csaba Szepesvári (2012). The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions. Communications of the ACM, Vol. 55, No. 3, pdf preprint
Chang-Shing Lee, Mei-Hui Wang, Olivier Teytaud, Shi-Jim Yen (2012). Human vs. Machine Go Competitions in IEEE WCCI 2012. ICGA Journal, Vol. 35, No. 4
Ching-Nung Lin, Shi-Jim Yen (2012). The Computer Go Tournaments in TCGA 2012. ICGA Journal, Vol. 35, No. 4
Ping-Chiang Chou, Shi-Jim Yen, Cheng-Wei Chou, Ching-Nung Lin, Chang-Shing Lee, Olivier Teytaud, Hassen Doghmen (2012). A simple Tsumego Generator. GPW 2012

2013

Cheng-Wei Chou, Ching-Nung Lin, Shi-Jim Yen, Hideki Kato, Jr-Chang Chen (2013). The 6th GPW Cup 9x9 and 13x13 Computer Go Tournaments. ICGA Journal, Vol. 36, No. 1
Ching-Nung Lin, Shi-Jim Yen (2013). The TAAI 2012 Computer Go Tournaments and Human vs. Computer Go Competition. ICGA Journal, Vol. 36, No. 1
Mark Boon (2013). The Beginning of Computer-Go Programs. ICGA Journal, Vol. 36, No. 2
Kokolo Ikeda, Simon Viennot (2013). Production of various strategies and position control for Monte-Carlo Go - Entertaining human players. CIG 2013
Shih-Chieh Huang, Martin Müller (2013). Investigating the Limits of Monte Carlo Tree Search Methods in Computer Go. CG 2013
Tobias Graf, Lars Schaefers, Marco Platzner (2013). On Semeai Detection in Monte-Carlo Go. CG 2013, pdf ^[48]
Sumudo Fernando, Martin Müller (2013). Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go. CG 2013
David Silver, Richard Sutton, Martin Mueller (2013). Temporal-Difference Search in Computer Go. Proceedings of the ICAPS-13 Workshop on Planning and Learning, pdf
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
Chun-Hsiang Hsieh, Jeng-Chi Yan (2013). The Design and Development of a 9 by 9 GO Opening Game Knowledge Base System. International Journal of Information and Education Technology, Vol. 3, No. 4

2014

Lars Schaefers (2014). Parallel Monte-Carlo Tree Search for HPC Systems and its Application to Computer Go. Ph.D. thesis, University of Paderborn, advisors Marco Platzner, Ulf Lorenz, pdf, pdf
S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik, Jos Vermaseren (2014). Performance analysis of a 240 thread tournament level MCTS Go program on the Intel Xeon Phi. CoRR abs/1409.4297 » MCTS, Parallel Search, x86-64
Christopher Clark, Amos Storkey (2014). Teaching Deep Convolutional Neural Networks to Play Go. arXiv:1412.3409 » DCNN in Go
Chris J. Maddison, Aja Huang, Ilya Sutskever, David Silver (2014). Move Evaluation in Go Using Deep Convolutional Neural Networks. arXiv:1412.6564v1 » DCNN in Go
Ingo Althöfer, Raymond Georg Snatzke (2014). The codecentric Go Challenge 2014: Franz-Josef Dickhut vs. CRAZY STONE. ICGA Journal, Vol. 37, No. 4 ^[49] ^[50] ^[51]

2015 ...

Olivier Teytaud, Abdallah Saffidine, Shi-Jim Yen (2015). The complexities of Go. Advances in Computer Games 14
Kokolo Ikeda, Takanari Shishido, Simon Viennot (2015). Machine-Learning of Shape Names for the Game of Go. Advances in Computer Games 14
Yuandong Tian, Yan Zhu (2015). Better Computer Go Player with Neural Network and Long-term Prediction. arXiv:1511.06410 ^[52] ^[53] » Neural Networks
Thomas Wolf (2015). A Classification of Semeai with Approach Moves. ICGA Journal, Vol. 38, No. 4, arXiv:1608.02890
Peter H. Jin, Kurt Keutzer (2015). Convolutional Monte Carlo Rollouts in Go. arXiv:1512.03375
Lars Schaefers, Marco Platzner (2015). Distributed Monte Carlo Tree Search: A Novel Technique and its Application to Computer Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 7, No. 4 ^[54]

2016

David Silver, Aja Huang, Chris J. Maddison, Arthur Guez, Laurent Sifre, George van den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, Sander Dieleman, Dominik Grewe, John Nham, Nal Kalchbrenner, Ilya Sutskever, Timothy Lillicrap, Madeleine Leach, Koray Kavukcuoglu, Thore Graepel, Demis Hassabis (2016). Mastering the game of Go with deep neural networks and tree search. Nature, Vol. 529 » AlphaGo
Tobias Graf, Marco Platzner (2016). Using Deep Convolutional Neural Networks in Monte Carlo Tree Search. 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
Aja Huang (2016). AlphaGo: Combining Deep Neural Networks with Tree Search. CG 2016, Keynote Lecture
Ingo Althöfer (2016). Computer-Aided Go: Chess as a Role Model. CG 2016
Peter H. Jin , Kurt Keutzer (2016). Convolutional Monte Carlo Rollouts for Computer Go. CG 2016
Chang-Shing Lee, Mei-Hui Wang, Shi-Jim Yen, Ting-Han Wei, I-Chen Wu, Ping-Chiang Chou, Chun-Hsun Chou, Ming-Wan Wang, Tai-Hsiung Yang (2016). Human vs. Computer Go: Review and Prospect. arXiv:1606.02032
Jonathan Rosenthal (2016). Deep Learning for Go. B.Sc. thesis, ETH Zurich

2017

Tristan Cazenave (2017). Residual Networks for Computer Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. PP, No. 99, pdf
Ti-Rong Wu, I-Chen Wu, Guan-Wun Chen, Ting-Han Wei, Tung-Yi Lai, Hung-Chun Wu, Li-Cheng Lan (2017). Multi-Labelled Value Networks for Computer Go. arXiv:1705.10701
Tristan Cazenave (2017). Improved Policy Networks for Computer Go. Advances in Computer Games 15, pdf
Thomas Wolf (2017). Seki with 2 Liberties per Chain in the Game of Go. ICGA Journal, Vol. 39, No. 2
Jon Diamond (2017). A History of Go-playing Programs. ICGA Journal, Vol. 39, No. 2
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 » AlphaZero

Forum Posts

2005 ...

Ongoing GO programming? by Shivkumar Shivaji, CCC, October 25, 2007
A thought about ratings by Dave Dyer, Computer Go Archive, December 10, 2007 » Playing Strength
Re: A thought about ratings by Don Dailey, Computer Go Archive, December 10, 2007
Re: A thought about ratings by Edward de Grijs, Computer Go Archive, December 10, 2007
Re: A thought about ratings by Don Dailey, Computer Go Archive, December 10, 2007

2010 ...

[Computer-go] learning patterns for mc go by Hendrik Baier, Computer Go Archive, April 26, 2010
WinBoard, exotic version by Harm Geert Muller, CCC, January 15, 2011 » WinBoard
Go questions by Kai Laskos, CCC, February 13, 2012
Wired Article on Computer GO by Edmund Moshammer, CCC, May 13, 2014 ^[55]
How many chess programmers are turning to Go? by Eelco de Groot, CCC, August 12, 2014
Teaching Deep Convolutional Neural Networks to Play Go by Hiroshi Yamashita, The Computer-go Archives, December 14, 2014 » DCNN in Go
Teaching Deep Convolutional Neural Networks to Play Go by Michel Van den Bergh, CCC, December 16, 2014
Move Evaluation in Go Using Deep Convolutional Neural Networks by Aja Huang, The Computer-go Archives, December 19, 2014 » DCNN in Go

2015 ...

Number of Go positions computed at last by John Tromp, The Computer-go Archives, January 22, 2016
Go has fallen to computer domination? by Isaac Haïk Dunn, CCC, January 27, 2016 » AlphaGo
Computer Go at master level? by Nicu Ionita, CCC, January 27, 2016
Game Over by Rémi Coulom, The Computer-go Archives, January 27, 2016 » AlphaGo
Mastering the Game of Go with Deep Neural Networks and Tree Search by Aja Huang, The Computer-go Archives, January 27, 2016
AlphaGo by Alvaro, Game-AI Forum, January 29, 2016 » AlphaGo
longest 3x3 game by John Tromp, Computer Go Archive, February 18, 2016
Deep Zen Go - A new Zen to counter AlphaGo by pookpooi, Computer Go, February 29, 2016
Lee Sedol vs. AlphaGo [link to live feed] by Jesse Gersenson, CCC, March 07, 2016
AlphaGo won first game! by Hiroshi Yamashita, The Computer-go Archives, March 09, 2016
Congratulations to AlphaGo by Lukas van de Wiel, The Computer-go Archives, March 12, 2016
UEC cup 1st day result by Hiroshi Yamashita, Computer Go Archive, March 19, 2016
Animation : Ratings of go players since 1974 ! by Vincent Lejeune, CCC, March 20, 2016
World #1 Go Player Ke Jie accepts Google Alpha Go Match.. by AA Ross, CCC, June 07, 2016 » ... Re: World #1 ...
The scaling of Deep Learning MCTS Go engines by Kai Laskos, CCC, October 23, 2016 » Deep Learning, Go, MCTS

2017

mini-max with Policy and Value network by Hiroshi Yamashita, Computer Go Archive, May 20, 2017
Re: World #1 Go Player Ke Jie accepts Google Alpha Go Match. by Kai Laskos, CCC, May 22, 2017 » The Future of Go Summit
Neural nets for Go - chain pooling? by David Wu, Computer Go Archive, August 18, 2017
We are doomed - AlphaGo Zero, learning only from basic rules by Vincent Lejeune, CCC, October 18, 2017
AlphaGo Zero by Alberto Sanjuan, CCC, October 19, 2017
Zero performance by Gian-Carlo Pascutto, Computer Go Archive, October 20, 2017
Re: AlphaGo Zero by Hendrik Baier, Computer Go Archive, October 20, 2017
AlphaGo's evaluation function by Jens Kipper, CCC, November 26, 2017

2018

Breakthrough: FineArt beating Ke Jie with 2 Handicap Stones by Ingo Althöfer, Computer Go Archive, January 20, 2018 » Fine Art

External Links

Tournaments

Computer Go Archives

Computer Go Pages

Sensei's Library: Starting Points
Go Servers at Sensei's Library
John's Go Page by John Tromp
Counting Legal Positions in Go by John Tromp, January 20, 2016
Computer Go Research by Martin Müller
SmartGo Blog by Anders Kierulf

Open Source

GitHub - gcp/leela-zero: Go engine with no human-provided knowledge, modeled after the AlphaGo Zero paper by Gian-Carlo Pascutto et al.
skybrian/Gongo - GitHub, a Go program, written in Go by Brian Slesinsky

Misc

Go Variants
GTP - Go Text Protocol
Cracking GO by Feng-Hsiung Hsu, IEEE Spectrum, October 01, 2007
The Mystery of Go, the Ancient Game That Computers Still Can’t Win by Alan Levinovitz, Wired, May 12, 2014 » Rémi Coulom ^[56]
AIs Have Mastered Chess. Will Go Be Next? by Jonathan Schaeffer, Martin Müller & Akihiro Kishimoto, IEEE Spectrum, June 25, 2014
Facebook trains AI to beat humans at Go board game by Leo Kelion, BBC News, January 27, 2016

Go Challenge

codecentric go challenge

AlphaGo

AlphaGo from Wikipedia
DeepMind - YouTube Channel
Game Over? AlphaGo Beats Pro 5-0 in Major AI Advance « American Go E-Journal, January 27, 2016 » AlphaGo
Google’s AlphaGo Beats Professional Go Player by Anders Kierulf, SmartGo Blog, January 27, 2016
Computer Beats Go Champion for the First Time by Annie Sneed, Scientific American, January 27, 2016
Artificial Intelligence Just Mastered Go, But One Game Still Gives AI Trouble by Carl Engelking, The Crux, January 27, 2016 » Poker, Jonathan Schaeffer, Bart Selman
Official Google Blog: AlphaGo: using machine learning to master the ancient game of Go by Demis Hassabis, January 27, 2016
AlphaGo | Google DeepMind » AlphaGo
The computer that mastered Go, with Demis Hassabis and David Silver, YouTube Video
Match: Lee Sedol vs AlphaGo, Photo Report by Ingo Althöfer, March 09, 2016
Google’s AI beats world Go champion in first of five matches, BBC News, March 09, 2016
Google AI wins second Go game against world champion, BBC News, March 10, 2016
Computer beating top human Go professional by Frederic Friedel, ChessBase News, March 10, 2016
Artificial intelligence: Google's AlphaGo beats Go master Lee Se-dol, BBC News, March 12, 2016
AlphaGo vs Lee Sedol: history in the making by Albert Silver, ChessBase News, March 13, 2016
Artificial intelligence: Go master Lee Se-dol wins against AlphaGo program, BBC News, March 13, 2016
Google's AI wins final Go challenge, BBC News, March 15, 2016
What Google’s winning Go algorithm will do next by Elizabeth Gibney, Nature | News, March 15, 2016
Exploring the mysteries of Go with AlphaGo and China's top players by Demis Hassabis, DeepMind, April 10, 2017
The Future of Go Summit, May 23 - 27, Wuzhen, China ^[57] ^[58]
Google's Go-playing AI still undefeated with victory over world number one by Alex Hern, The Guardian, May 25, 2017
Google’s AlphaGo Continues Dominance With Second Win in China by Cade Metz, Wired, May 25, 2017
Google’s AlphaGo Trounces Humans—But It Also Gives Them a Boost by Cade Metz, Wired, May 26, 2017
AlphaGo’s Designers Explore New AI After Winning Big in China by Cade Metz, Wired, May 27, 2017
AlphaGo's next move by Demis Hassabis and David Silver, DeepMind, May 27, 2017
AlphaGo Zero: Learning from scratch by Demis Hassabis and David Silver, DeepMind, October 18, 2017

Fine Art

References

^ Albert Zobrist (1970). Feature Extraction and Representation for Pattern Recognition and the Game of Go. Ph.D. thesis , University of Wisconsin, also published as technical report, pdf
^ Go at the Computer Olympiad
^ Go (Spiel) from Wikipedia.de
^ Bernd Brügmann (1993). Monte Carlo Go. pdf
^ Bruno Bouzy (2005). Associating domain-dependent knowledge and Monte Carlo approaches within a go program. Information Sciences, Heuristic Search and Computer Game Playing IV
^ Rémi Coulom (2006). Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. CG 2006, pdf
^ Levente Kocsis, Csaba Szepesvári (2006). Bandit based Monte-Carlo Planning. ECML-06, LNCS/LNAI 4212, pdf
^ Sylvain Gelly, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Levente Kocsis, David Silver, Csaba Szepesvári (2012). The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions. Communications of the ACM, Vol. 55, No. 3, pdf preprint
^ Ilya Sutskever, Vinod Nair (2008). Mimicking Go Experts with Convolutional Neural Networks. ICANN 2008, pdf
^ Nicol N. Schraudolph, Peter Dayan, Terrence J. Sejnowski (1994). Temporal Difference Learning of Position Evaluation in the Game of Go. Advances in Neural Information Processing Systems 6
^ Erik van der Werf, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). Local Move Prediction in Go. CG 2002
^ Markus Enzenberger (2003). Evaluation in Go by a Neural Network using Soft Segmentation. Advances in Computer Games 10, pdf
^ Convolutional neural network from Wikipedia
^ Christopher Clark, Amos Storkey (2014). Teaching Deep Convolutional Neural Networks to Play Go. arXiv:1412.3409
^ Deep learning for… Go by Erik Bernhardsson, December 11, 2014
^ Teaching Deep Convolutional Neural Networks to Play Go by Hiroshi Yamashita, The Computer-go Archives, December 14, 2014
^ Why Neural Networks Look Set to Thrash the Best Human Go Players for the First Time | MIT Technology Review, December 15, 2014
^ Teaching Deep Convolutional Neural Networks to Play Go by Michel Van den Bergh, CCC, December 16, 2014
^ Chris J. Maddison, Aja Huang, Ilya Sutskever, David Silver (2014). Move Evaluation in Go Using Deep Convolutional Neural Networks. arXiv:1412.6564v1
^ Move Evaluation in Go Using Deep Convolutional Neural Networks by Aja Huang, The Computer-go Archives, December 19, 2014
^ David Silver, Aja Huang, Chris J. Maddison, Arthur Guez, Laurent Sifre, George van den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, Sander Dieleman, Dominik Grewe, John Nham, Nal Kalchbrenner, Ilya Sutskever, Timothy Lillicrap, Madeleine Leach, Koray Kavukcuoglu, Thore Graepel, Demis Hassabis (2016). Mastering the game of Go with deep neural networks and tree search. Nature, Vol. 529
^ Fan Hui at Sensei's Library
^ Game Over? AlphaGo Beats Pro 5-0 in Major AI Advance « American Go E-Journal, January 27, 2016
^ Official Google Blog: AlphaGo: using machine learning to master the ancient game of Go by Demis Hassabis, January 27, 2016
Google DeepMind: Ground-breaking AlphaGo masters the game of Go, YouTube Video
^ DeepMind - YouTube Channel
^ Video Interview with Rémi Coulom on AlphaGo, February 2016
^ Artificial intelligence: Google's AlphaGo beats Go master Lee Se-dol, BBC News, March 12, 2016
^ AlphaGo’s Designers Explore New AI After Winning Big in China by Cade Metz, Wired, May 27, 2017
^ AlphaGo Zero: Learning from scratch by Demis Hassabis and David Silver, DeepMind, October 18, 2017
^ 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
^ 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
^ Fine Art (software) from Wikipedia
^ Two stones! Fine Art defeated Ke Jie 9P after giving two stones handicap. – Website of The International Go Federation, January 19, 2018
^ Go Servers at Sensei's Library - Fox Weiqi
^ Breakthrough: Fine Art beating Ke Jie with 2 Handicap Stones by Ingo Althöfer, Computer Go Archive, January 20, 2018
^ 7% Documentary: Behind the scenes of Fine Art AI - 纪录片《7%》：揭秘人工智能“绝艺”夺冠幕后腾讯网 - English subtitles, YouTube Video
featuring Fine Art team Liu Yongsheng, Ma Bo, Tang Shanmin, Wu Guangyu and Zhang Kaixu
further Rémi Coulom, Simon Viennot, I-Chen Wu, Hideki Kato, David Fotland, Shun-Chin Hsu et al. at the Computer Go UEC Cup 2017
^ Re: Chess vs Go // AI vs IA by Gian-Carlo Pascutto, June 02, 2010
^ Computer Go Bibliography, University of Alberta
^ GoTools - TsumeGo Solving Software
^ Gobble
^ Mathematical Go from Sensei's Library
^ Nici Schraudolph’s go networks, review by Jay Scott
^ EZ-GO at Sensei's Library
^ Tsumego at Sensei's Library
^ steganography from Wikipedia
^ The Shodan Go Bet
^ Re: Teaching Deep Convolutional Neural Networks to Play Go by Erik van der Werf, The Computer-go Archives, December 15, 2014
^ Capturing race from Wikipedia
^ Franz-Josef Dickhut from Wikipedia, Rémi Coulom
^ codecentric go challenge 2014: Interviews with Franz-Josef Dickhut and Rémi Coulom - codecentric Blog by Raymond Georg Snatzke, October 1, 2014
^ codecentric go challenge 2014: Final Interviews - codecentric Blog by Raymond Georg Snatzke, November 27, 2014 (German)
^ How Facebook’s AI Researchers Built a Game-Changing Go Engine | MIT Technology Review, December 04, 2015
^ Combining Neural Networks and Search techniques (GO) by Michael Babigian, CCC, December 08, 2015
^ Re: Minmax backup operator for MCTS by Brahim Hamadicharef, CCC, December 30, 2017
^ The Mystery of Go, the Ancient Game That Computers Still Can’t Win by Alan Levinovitz, Wired, May 12, 2014
^ Wired Article on Computer GO by Edmund Moshammer, CCC, May 13, 2014
^ World #1 Go Player Ke Jie accepts Google Alpha Go Match.. by AA Ross, CCC, June 07, 2016
^ Ke Jie from Wikipedia

What links here?

Page	Date Edited
10th Computer Olympiad	Jul 22, 2017
11th Computer Olympiad	Jul 22, 2017
12th Computer Olympiad	Jul 22, 2017
13th Computer Olympiad	Jul 22, 2017
14th Computer Olympiad	Jul 23, 2017
15th Computer Olympiad	Aug 12, 2017
16th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
19th Computer Olympiad	Sep 19, 2017
1st Computer Olympiad	Jul 25, 2017
20th Computer Olympiad	Feb 5, 2018
2nd Computer Olympiad	Jul 12, 2017
3rd Computer Olympiad	Jul 25, 2017
4th Computer Olympiad	Jul 15, 2017
5th Computer Olympiad	Jan 17, 2017
7th Computer Olympiad	Jul 23, 2017
8th Computer Olympiad	Jul 22, 2017
9th Computer Olympiad	Jul 22, 2017
AI Factory	Dec 26, 2015
Akihiro Kishimoto	Jan 22, 2018
Alan Blair	Jan 22, 2018
Alan Frank	Dec 19, 2016
Alan Turing	Feb 8, 2017
Albert Zobrist	Jun 12, 2016
Alex B. Meijer	Aug 31, 2014
Alexander Bitman	Jun 2, 2015
Alexander Schmidt	May 17, 2016
Alfred Knöpfle	Jan 19, 2017
Algorithms	May 5, 2017
AlphaZero	Feb 10, 2018
Amine Bourki	Jan 19, 2016
Amos Storkey	Jan 23, 2017
Anders Kierulf	Dec 28, 2016
Arpad Rimmel	Mar 16, 2016
Artificial Intelligence	Apr 9, 2018
Aske Plaat	Jun 26, 2017
BBC Micro	Dec 16, 2016
Bernard Helmstetter	May 23, 2016
Bernd Brügmann	Jul 30, 2016
Bert Enderton	Sep 16, 2012
Bojun Huang	Jan 22, 2018
Broderick Arneson	Jan 8, 2017
Bruce Wilcox	Sep 24, 2014
Bruno Bouzy	Aug 12, 2017
Chang-Shing Lee	Jul 18, 2017
Cheng-Wei Chou	Jul 17, 2017
Chess	Jan 21, 2018
ChessBase Best-Publication Awards to Include	Jan 7, 2017
Ching-Nung Lin	Jul 17, 2017
Chris J. Maddison	Dec 8, 2017
Christophe Fiter	Jan 19, 2016
Christopher Clark	Jan 23, 2017
Complexity to include	Jun 16, 2011
Csaba Jergler	Dec 18, 2016
Daniel Shawul	Jan 28, 2018
David Forsyth	May 2, 2011
David Fotland	Jan 6, 2017
David J. Wu	Jan 28, 2016
David Silver	Feb 11, 2018
David Wolfe	Jun 25, 2015
Dawei Du	Dec 28, 2016
Deep Learning	Feb 12, 2018
DeepMind	Dec 9, 2017
Demis Hassabis	Dec 8, 2017
Dharshan Kumaran	Dec 9, 2017
Don Dailey	Dec 7, 2016
Ed Northam	Sep 4, 2016
Edward de Grijs	Dec 30, 2016
Elwyn Berlekamp	Jun 25, 2015
Engine Rating Lists	Dec 13, 2017
Erik Bernhardsson	Jan 22, 2017
Erik van der Werf	Dec 31, 2016
Fabien Letouzey	Feb 5, 2018
Feng-hsiung Hsu	Dec 27, 2016
Fridel Fainshtein	Oct 8, 2014
Games	Feb 20, 2018
Gary Boos	Apr 10, 2013
Gary Linscott	Jan 16, 2018
Genetic Programming	Dec 26, 2017
Gerald Tesauro	Dec 13, 2016
Gian-Carlo Pascutto	Jan 16, 2018
Go	Jan 24, 2018
Go (Programming Language)	Nov 2, 2017
Gosu	Dec 7, 2017
GPU	Dec 16, 2017
Guan-Wun Chen	Jul 19, 2017
Guillaume Chaslot	Jan 2, 2017
Gunnar Farnebäck	Jan 23, 2017
Hank Dietz	May 3, 2011
Harm Geert Muller	Mar 31, 2018
Haruhiro Yoshimoto	Jun 25, 2013
Hassen Doghmen	Mar 16, 2016
Hendrik Baier	Jan 22, 2018
Henk Koppelaar	Aug 31, 2014
Hideki Kato	Jan 6, 2017
Hiroshi Yamashita	May 28, 2017
Historical Examples	Jan 16, 2017
Hung-Jui Chang	Jul 16, 2017
I-Chen Wu	Sep 19, 2017
Ian Osgood	Jun 14, 2013
ICGA	Jul 8, 2017
ICGA Journal	Dec 21, 2017
Ilya Sutskever	Jan 28, 2017
Jaap van den Herik	Sep 18, 2017
Jahn-Takeshi Saito	Jan 2, 2017
James Kerwin	Sep 24, 2014
Janusz Kraszek	Jan 17, 2017
Jean-Baptiste Hoock	Jan 2, 2017
Jean-Loup Gailly	Nov 27, 2011
Jean-Yves Audibert	Apr 29, 2015
Jeng-Chi Yan	Dec 28, 2016
Jinqiang Lu	Jan 17, 2017
Joe Leslie-Hurd	Aug 15, 2013
Johan de Koning	Jul 3, 2017
John Hamlen	Jul 12, 2017
John Tromp	Jan 6, 2017
Jonathan Rosenthal	Jan 9, 2018
Jos Vermaseren	Jan 12, 2016
Joshua Shriver	Nov 24, 2017
Judith Spencer Olson	Sep 24, 2014
Julian Schrittwieser	Dec 7, 2017
Julien Pérez	Jan 19, 2016
Julio César Hernández-Castro	Sep 3, 2015
Junichi Hashimoto	Jan 4, 2017
Jürg Nievergelt	Dec 28, 2016
Kai Laskos	Jan 21, 2018
Katsuki Ohto	Aug 11, 2017
Keh-Hsun Chen	Jan 16, 2017
Kenta Sasaki	Jun 24, 2011
Kiyoshi Shirayanagi	May 23, 2016
Kokolo Ikeda	Mar 15, 2016
Kuo-Yuan Kao	Jul 22, 2017
Kurt Keutzer	Jul 9, 2016
Lars Schaefers	Dec 30, 2017
Laurent Sifre	Dec 7, 2017
LCZero	Apr 18, 2018
Learning	Feb 20, 2018
Levente Kocsis	Dec 23, 2016
Ling Zhao	Jun 24, 2015
Louis Chatriot	Jan 19, 2016
Marcin Szubert	Dec 13, 2014
Mark Boon	Dec 15, 2016
Mark Watson	Apr 14, 2013
Markus Enzenberger	May 23, 2016
Martin Müller	Aug 12, 2017
Mathematician	Apr 9, 2018
Matthew Lai	Dec 6, 2017
Matthieu Coulm	Oct 22, 2010
Matthieu Walraet	Jul 10, 2016
Mei-Hui Wang	Jul 17, 2017
Michael Reiss	Dec 15, 2016
Mikko Aarnos	Mar 14, 2015
Ming-Cheng Cheng	Jul 22, 2017
Monte-Carlo Tree Search	Apr 26, 2018
National Chiao Tung University	Jul 23, 2017
National Taiwan University	Jul 21, 2017
Nebiyu	Dec 10, 2017
Neural Networks	Mar 12, 2018
Nicol N. Schraudolph	Jan 23, 2017
Noah Weninger	Aug 13, 2017
Nobuo Araki	Jan 3, 2017
Nobusuke Sasaki	Jan 19, 2016
Olivier Teytaud	Jan 7, 2017
Oxford Softworks	May 6, 2013
Parallel Search	Dec 30, 2017
Peigang Zhang	Jan 2, 2017
Personal Computing	Dec 27, 2017
Peter Dayan	Feb 10, 2018
Peter H. Jin	Jul 9, 2016
Petr Baudiš	Dec 9, 2017
Phantom Go	Jun 29, 2017
Ping-Chiang Chou	Jul 17, 2017
Playing Strength	Mar 31, 2018
ProbCut	Mar 25, 2016
Proof-number search	Jan 22, 2018
Pseudorandom number generator	May 11, 2017
Quote McCarthy	Sep 10, 2013
Raghuram Ramanujan	Dec 26, 2017
Raymond Georg Snatzke	May 26, 2015
Rémi Coulom	Feb 5, 2018
Rémi Munos	Dec 8, 2017
Richard Sutton	Feb 20, 2018
Robert Nado	Sep 24, 2014
S. Ali Mirsoleimani	Jan 15, 2016
Scorpio	Mar 28, 2018
Shang-Rong Tsai	Jan 7, 2017
Shi-Jim Yen	Jul 22, 2017
Shih-Chieh Huang	Oct 18, 2017
Shinichi Sei	Jan 3, 2017
Shivkumar Shivaji	Oct 24, 2017
Shogo Takeuchi	Jun 16, 2016
Shun-Chin Hsu	Jul 22, 2017
Shun-Shii Lin	Jan 21, 2017
Stephen B. Streater	Dec 17, 2016
Sumudo Fernando	May 27, 2014
Sylvain Gelly	Dec 31, 2016
TAAI	Dec 8, 2014
Takanari Shishido	Jan 19, 2016
Takeshi Ito	Jan 6, 2017
TCGA 2011	Dec 8, 2014
TCGA 2012	Jan 21, 2017
Terrence J. Sejnowski	Jan 24, 2017
Thomas Hérault	May 11, 2013
Thomas Hubert	Dec 7, 2017
Thomas Thomsen	Mar 25, 2015
Thomas Wolf	Sep 18, 2017
Thore Graepel	Jan 10, 2018
Ti-Rong Wu	Jul 19, 2017
Timothy Lillicrap	Dec 9, 2017
Ting-Fu Liao	Jul 19, 2017
Ting-Han Wei	Jul 19, 2017
Tobias Graf	Jul 8, 2016
Tristan Cazenave	Jan 22, 2018
Tsan-Cheng Su	Jan 8, 2017
UCT	Jan 22, 2018
Ulf Lorenz	Dec 22, 2016
University of Paderborn	Aug 17, 2014
Vincent Danjean	Nov 18, 2012
Walter Knöpfle	Jan 19, 2017
Walter R. Reitman	Sep 24, 2014
WMCCC 2000	Feb 27, 2018
Wojciech Jaśkowski	Dec 13, 2014
Workshop Chess and Mathematics	Mar 5, 2015
x86-64	Mar 6, 2018
Yasushi Tanase	Jan 1, 2017
Yizao Wang	Dec 31, 2016
Yoji Ojima	Dec 3, 2016
Zen	Aug 4, 2016
Zhixing Chen	Jan 17, 2017
Zillions of Games	May 29, 2017
Łukasz Lew	Jun 9, 2015

Up one Level

Harvard Cup 1994

GerdIsenberg — Tue, 22 Apr 2014 06:50:26 GMT

Home * Tournaments * Harvard Cup * 1994
< Prev Next >

Fifth Hardvard Cup, The Computer Museum, Boston, Massachusetts, October 1-2, 1994. Game in 25 minutes per side.

Final Standing

Humans versus computers: 29½ - 18½

#	Name	C	01	02	03	04	05	06	07	08	09	10	11	12	13	14	P	SoDOS	G
1	Joel Benjamin		X	.	.	b½	.	.	w½	b1	.	b1	w1	w1	b½	w1	6½	14	8
2	Boris Gulko		.	X	.	b½	.	.	b1	b0	.	w½	w1	b1	w1	b1	6	12½	8
3	Alex Yermolinsky		.	.	X	w0	.	.	w½	b1	.	w1	w1	w1	b1	b0	5½	11¼	8
4	WChess	1	w½	w½	b1	X	w1	b1	.	.	b1	.	.	.	.	.	5	23¼	6
5	Patrick Wolff		.	.	.	b0	X	.	b½	w1	.	b½	b0	w1	w1	w1	5	9¼	8
6	Michael Rohde		.	.	.	w0	.	X	w1	w½	.	b½	b1	b0	b0	w1	4	7¾	8
7	Chessmaster 4000 Turbo	2	b½	w0	b½	.	w½	b0	X	.	w1	.	.	.	.	.	2½	11	6
8	Socrates 4.0	3	w0	w1	w0	.	b0	b½	.	X	b1	.	.	.	.	.	2½	10½	6
9	Alexander Shabalov		.	.	.	w0	.	.	b0	w0	X	w½	b	b0	w1	b1	2½	3½	8
10	Hiarcs 3.0	4	w0	b½	b0	.	w½	w½	.	.	b½	X	.	.	.	.	2	8¾	6
11	Now	5	b0	b0	b0	.	w1	w0	.	.	w1	.	X	.	.	.	2	7½	6
12	MChess Pro 3.85X	6	b0	b0	w0	.	b0	w1	.	.	w1	.	.	X	.	.	2	6½	6
13	Rebel 6.0	7	w½	b0	w0	.	b0	w1	.	.	b0	.	.	.	X	.	1½	7¼	6
14	Zarkov X	8	b0	w0	w1	.	b0	b0	.	.	w0	.	.	.	.	X	1	5½	6

SoDOS: Sum of Defeated Opponent Scores

Play-off

5th Harvard Cup Play-off, November 9, 1994

#	Name	1	2	3	4	5	P
1	Joel Benjamin	w1	b1	w½	b½	w1	4
2	WChess	b0	w0	b½	w½	b0	1

Reports

Danny Kopec (1994). The Fifth Harvard Cup Human Versus Computer Intel Chess Challenge. pdf
Christopher Chabris, Danny Kopec (1994). Report on the Fifth Harvard Cup Human versus Computer Intel Chess Challenge. ICCA Journal, Vol. 17, No. 4
Larry Kaufman (1995). 1994 Harvard Cup. Computer Chess Reports, Vol. 5, No. 1

External Links

Harvard Cup 1994, CSVN site
Harvard Cup Human vs. Computer Chess Challenge, old CSVN site
Ajedrez - Joel Benjamin vs. Comp. WChess (Harvard Cup 1994), YouTube Video ^[1]

References

^ Spanish video of Dave Kittinger in action by Bryan Whitby, CCC, April 29, 2012 » David Kittinger

What links here?

Page	Date Edited
Christopher Chabris	Aug 15, 2015
Danny Kopec	Oct 1, 2016
David Kittinger	Dec 27, 2017
Harvard Cup	Jan 11, 2013
Harvard Cup 1993	Nov 8, 2016
Harvard Cup 1994	Apr 21, 2014
Harvard Cup 1995	Nov 9, 2012
ICGA Journal	Dec 21, 2017
WChess	Jan 7, 2016

Up one Level

Wikispaces : chessprogramming - items matching description

Advances in Computer Games 13

Table of Contents

Proceedings

Lectures

See also

Reports

External Links

References

What links here?

Aegon 1995

Table of Contents

Final Standing

Selected Games

Publications

External Links

References

What links here?

Aegon 1997

Table of Contents

Final Standing

Photos & Games

Opening Ceremony

Woman vs. Machines

Zugzwang Team

Publications

Forum Posts

External Links

References

What links here?

Alex Bernstein

Table of Contents

Quotes

See also

Publications

External Links

References

What links here?

AlphaZero

Table of Contents

Description

Network Architecture

Training

See also

Publications

Forum Posts

2017

2018

External Links

Reports

Stockfish Match

Misc

References

What links here?

Azlan Iqbal

Table of Contents

See also

Selected Publications

2006 ...

2010 ...

2015 ...

ChessBase Articles

2009

2010 ...

2015 ...

External Links

References

What links here?

CHEKMO-II

Table of Contents

Abstract

Known Deficiencies

See also

Forum Posts

External Links

References

What links here?

Chess for Android

Table of Contents

Images