Wikispaces : chessprogramming - items matching description

Home * Organizations * AAAI

AAAI, the Association for the Advancement of Artificial Intelligence is a nonprofit scientific society devoted to advancing the scientific understanding of the mechanisms underlying thought and intelligent behavior and their embodiment in machines. AAAI was founded in 1979 under the name American Association for Artificial Intelligence and changed its name in 2007 ^[1] .

Presidents

Since 1985, Presidents have served a two-year term, preceded by two years as President-Elect, and followed by two years as Past President. Prior to that time, presidents served one year in each position ^[2] .

President	term
Allen Newell	1979-1980
Edward Feigenbaum	1980-1981
Marvin Minsky	1981-1982
Nils J. Nilsson	1982-1983
John McCarthy	1983-1984
Woodrow W. Bledsoe	1984-1985
Patrick Winston	1985-1987
Raj Reddy	1987-1989
Daniel Bobrow	1989-1991
Patrick Hayes	1991-1993
Barbara Grosz	1993-1995
Randall Davis	1995-1997
David Waltz	1997-1999
Bruce Buchanan	1999-2001
Tom Mitchell	2001-2003
Ron Brachman	2003-2005
Alan Mackworth	2005-2007
Eric Horvitz	2007-2009
Martha E. Pollack	2009-2010
Henry A. Kautz	2010-2012
Manuela M. Veloso	2012-2014
Thomas G. Dietterich	2014-2016
Subbarao Kambhampati	2017

Publications and Journals

Selected Publications

Edward Feigenbaum (2005). Stories of AAAI - Before the Beginning and After: A Love Letter. AI Magazine, Vol. 26, No. 4

External Links

References

What links here?

Page	Date Edited
4th Computer Olympiad	Jul 15, 2017
AAAI	Mar 21, 2017
Abdallah Saffidine	Aug 11, 2017
Akihiro Kishimoto	Jan 22, 2018
Albert Silver	Feb 25, 2018
Allen Newell	Jun 12, 2017
Alpha-Beta	Jan 28, 2018
Amitava Bagchi	May 23, 2016
Artificial Intelligence	Apr 9, 2018
Ashish Sabharwal	Dec 26, 2017
Aske Plaat	Jun 26, 2017
Barney Pell	Jul 21, 2017
Bart Selman	Dec 26, 2017
Bernhard Pfahringer	May 23, 2016
Bojun Huang	Jan 22, 2018
Byoung-Tak Zhang	Jul 4, 2016
Chao Ma	Feb 6, 2017
Charles Elkan	Jan 23, 2017
Chess	Jan 21, 2018
Chunking	Jun 12, 2017
Cognition	Dec 8, 2017
Dana Nau	Apr 25, 2017
Darse Billings	Feb 14, 2017
Dave Gomboc	May 6, 2015
David J. Stracuzzi	Mar 28, 2015
David Silver	Feb 11, 2018
David Waltz	Oct 12, 2016
Deep Blue	Aug 1, 2017
Deep Fritz versus Deep Junior 2007	Oct 15, 2016
Deep Learning	Feb 12, 2018
Dictionary	Aug 24, 2017
Duane Szafron	Feb 20, 2018
Edward Hamilton	Aug 25, 2016
Eric B. Baum	Sep 11, 2015
Games	Feb 20, 2018
General Game Playing	Dec 22, 2017
Genetic Programming	Dec 26, 2017
Henri Bal	Aug 5, 2016
Jaap van den Herik	Sep 18, 2017
Johannes Heinrich	Aug 14, 2017
John Romein	Aug 5, 2016
Jonathan Schaeffer	Jan 29, 2018
Junior	Feb 27, 2018
Justin A. Boyan	Jan 10, 2017
Learning	Feb 20, 2018
Manuela Veloso	Aug 5, 2015
Mathematician	Apr 9, 2018
Matthew L. Ginsberg	May 23, 2016
MCαβ	Jan 28, 2018
Mephisto Best-Publication Awards to Include	Dec 8, 2016
Michael Buro	Dec 21, 2016
Michael Greenspan	Dec 29, 2016
Michael L. Littman	Feb 11, 2018
Minimax	Dec 29, 2017
Monte-Carlo Tree Search	Apr 26, 2018
Morph	Dec 7, 2017
Neural Networks	Mar 12, 2018
Opponent Model Search	Aug 14, 2017
Organizations	Jul 19, 2017
Othello	Jan 4, 2018
Parallel Search	Dec 30, 2017
Paul S. Rosenbloom	Jun 13, 2017
Periodical	Dec 22, 2017
Peter Norvig	Jun 7, 2016
Planning	Feb 12, 2018
Pruning	Jan 1, 2018
Repetitions	Jan 16, 2018
Richard Fikes	May 23, 2016
Robert Levinson	Aug 25, 2016
Robert Nado	Sep 24, 2014
Search	Feb 1, 2018
Shared Hash Table	Sep 11, 2017
Shaul Markovitch	Jan 8, 2015
Shay Bushinsky	Aug 28, 2016
Shivkumar Shivaji	Oct 24, 2017
SSS* and Dual*	Jan 22, 2018
Stavros Vassos	May 25, 2015
Stefan Kramer	Apr 1, 2016
Stephan Schiffel	Jul 8, 2016
Stephen J.J. Smith	Apr 7, 2014
Stuart Russell	Mar 16, 2015
Susan L. Epstein	Dec 17, 2016
Thomas A. Throop	Dec 25, 2017
UCT	Jan 22, 2018
Victor Allis	Dec 19, 2016
Woodrow W. Bledsoe	Oct 24, 2016
Yngvi Björnsson	Jun 26, 2017

Up one level

Alan Blair

GerdIsenberg — Mon, 22 Jan 2018 16:50:35 GMT

Home * People * Alan Blair

		Alan David Blair, an Australian computer scientist, Ph.D. in Mathematics from MIT ^[1], and senior lecturer at School of Computer Science and Engineering ^[2], University of New South Wales (UNSW). His research interests include co-evolutionary learning, mobile robots and language processing. Alan Blair worked on a multi-player chess variant board game called Duchess ™ ^[3], and is author of the Go playing program thcGo, applying a recurrent cellular neural network ^[4] ^[5].
Alan Blair ^[6]

Selected Publications

^[7] ^[8]

Alan Blair (1994). Path Integrals on Ultrametric Spaces. Ph.D. thesis, MIT, advisor Gian-Carlo Rota
Alan Blair (1999). Co-evolutionary learning - lessons for human education? Proceedings of the Fourth Conference of the Australasian Cognitive Science Society, Newcastle, Australia, pdf
Joel Veness, Alan Blair (2007). Effective Use of Transposition Tables in Stochastic Game Tree Search. IEEE Symposium on Computational Intelligence and Games, pdf
Joel Veness, David Silver, William Uther, Alan Blair (2009). Bootstrapping from Game Tree Search. pdf

External Links

References

^ Alan Blair (1994). Path Integrals on Ultrametric Spaces. Ph.D. thesis, MIT, advisor Gian-Carlo Rota
^ UNSW - School of Computer Science and Engineering
^ Welcome to the Duchess™ page!
^ computer-go.info - Details of Program: thcGo
^ 24th KGS Computer Go Tournament
^ Alan Blair's Home Page
^ Alan Blair's publications
^ Joel Veness - Publications

What links here?

Page	Date Edited
Alan Blair	Jan 22, 2018
Artificial Intelligence	Apr 9, 2018
Automated Tuning	Feb 27, 2018
Bodo	Oct 6, 2016
David Silver	Feb 11, 2018
Joel Veness	Dec 8, 2017
Learning	Feb 20, 2018
Massachusetts Institute of Technology	Jan 24, 2017
Mathematician	Apr 9, 2018
Meep	Sep 4, 2016
People	Feb 28, 2018
Temporal Difference Learning	Feb 20, 2018
Transposition Table	Apr 19, 2018
William Uther	Aug 7, 2015

Up one level

Alan H. Bond

GerdIsenberg — Tue, 07 Oct 2014 13:11:52 GMT

Home * People * Alan H. Bond

		Alan Hale Bond (October 18, 1940), a British American physicist, electrical engineer, computer scientist, AI researcher, and neuroscientist at Semel Institute for Neuroscience and Human Behavior, University of California, Los Angeles, California, and as president of Expert Software, Inc. ^[1] working on theory, design, development, and implementation of Artificial Intelligence, Logic programming, and Brain models for every occasion ^[2]. Alan Bond received the B.A. in Physics in 1961 and the M.A. degree in 1966 from Magdalen College, Oxford and the Ph.D. in Theoretical Physics from Imperial College London ^[3] . Since then he had various research and lecturer positions in the UK and US, beside others at Carnegie Mellon University and Queen Mary, University of London ^[4] . He was tutor and advisor of John J. Scott, an early British computer chess programmer, and was along with Alex Bell supporter and promoter of early Computer Chess Conferences, the forerunner of Advances in Computer Chess ^[5] .
Alan H. Bond ^[6]

Photos

Photos

Alan Bond at Pittsburgh Zoo: 1966 ^[7]

Selected Publications

^[8] ^[9]

1968

Alan H. Bond (1968). Interactive Programming at Carnegie Tech. Artificial Intelligence 3, Literature: Reports hosted by Atlas Computer Laboratory
Alan H. Bond, Jerry Rightnour, L. Steven Coles (1969). An Interactive Graphical Display Monitor in a Batch-processing Environment with Remote Entry. Communications of the ACM, Vol. 12, No. 11, pdf

1970 ...

Alan H. Bond (1973). A Descriptor Indexed Bibliography of Computer Chess. in Alex Bell (ed.) (1973). Computer Chess. Proceedings May 1973 Meeting on chess playing by computer. Science Research Council, Atlas Computer Laboratory
Alan H. Bond (1973). Psychology and Computer Chess. in Alex Bell (ed.) (1973). Computer Chess. Proceedings May 1973 Meeting on chess playing by computer. Science Research Council, Atlas Computer Laboratory
Alan H. Bond (1979). An Approach to Artificial Intelligence. pdf

1980 ...

Alan H. Bond, David H. Mott (1981). Learning of Sensory-Motor Schemas in a Mobile Robot. IJCAI 1981, pdf
Alan H. Bond, David H. Mott (1985). An investigation of a learning system with a mobile robot. Queen Mary, University of London, pdf
Alan H. Bond (1987). Broadcasting Arrays - A Highly Parallel Computer Architecture Suitable For Easy Fabrication. pdf

1990 ...

Alan H. Bond (1990). What I have in Mind. draft as pdf
Alan H. Bond (1996). A Computational Architecture for Social Agents. pdf
Alan H. Bond (1999). A system model of the primate neocortex. Neurocomputing, vol 26-27, pp. 617-623, pdf ^[10]

2000 ...

Alan H. Bond (2004). A Computational Model for the Primate Brain based on its Functional Architecture. Journal of Theoretical Biology, vol 227, pp. 81-102, pdf
Alan H. Bond (2005). Representing episodic memory in a system-level model of the brain. Neurocomputing, vol 65-66, pp. 261-273, pdf
Alan H. Bond (2007). BAD, a Declarative Logic-Based Language for Brain Modeling. PADL 2007: 200-214

External Links

Books

Other Alan Bonds

from Wikipedia:

References

^ Expert Software Inc - Santa Monica, California (CA) | Company Profile
^ Expert Software home page
^ NSF bio
^ Alan Bond. Curriculum Vitae
^ Alex Bell (1978). MASTER at IFIPS. Excerpt from: The Machine Plays Chess? from Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)
^ Alan Bond's home page
^ Alan H. Bond (1968). Interactive Programming at Carnegie Tech. Artificial Intelligence 3, Literature: Reports hosted by Atlas Computer Laboratory
^ Alan Bond's publications page
^ DBLP: Alan H. Bond
^ Neocortex from Wikipedia

What links here?

Page	Date Edited
Advances in Computer Chess 1	Oct 22, 2015
Alan H. Bond	Oct 7, 2014
Artificial Intelligence	Apr 9, 2018
Carnegie Mellon University	Feb 12, 2018
CMU Chess Program	Oct 6, 2014
Cognition	Dec 8, 2017
John J. Scott	Aug 30, 2016
Joseph S. Rubenfeld	Oct 6, 2014
L. Stephen Coles	Jan 5, 2017
Mathematician	Apr 9, 2018
Memory	Dec 8, 2017
People	Feb 28, 2018
Queen Mary, University of London	Jul 12, 2017
Robots	Feb 20, 2018
Sequential Logic	May 10, 2017

Up one level

Daisaku Yokoyama

GerdIsenberg — Mon, 23 May 2016 09:32:49 GMT

Home * People * Daisaku Yokoyama

Daisaku Yokoyama,
a Japanese computer scientist, Shogi programmer, and research associate at University of Tokyo with interests in parallel computing, programming languages, robot programming, game-tree search, and computer-shogi ^[1]. Daisaku Yokoyama is co-author of the Shogi engine Gekisashi, Gold medal winner of the 15th Computer Olympiad, Shogi in Kanazawa.

Selected Publications

^[2]

Yoshimasa Tsuruoka, Daisaku Yokoyama, Takashi Chikayama (2002). Game-Tree Search Algorithm based on Realization Probability. ICGA Journal, Vol. 25, No. 3 ^[3]
Daisaku Yokoyama, Yoshimasa Tsuruoka, Takashi Maruyama, Takashi Chikayama (2002). Implementation of "Gekisashi". A Computer Shogi Player. Joho Shori Gakkai Natsu no Puroguramingu, Shinpojiumu Hokokushu, Makoto Miwa, Daisaku Yokoyama, Takashi Chikayama (2006). Automatic Construction of Static Evaluation Functions for Computer Game Players. ALT ’06 ^[4]
Makoto Miwa, Daisaku Yokoyama, Takashi Chikayama (2007). Automatic Generation of Evaluation Features for Computer Game Players. pdf
Akira Ura, Daisaku Yokoyama, Takashi Chikayama (2013). Two-level Task Scheduling for Parallel Game Tree Search Based on Necessity. Journal of Information Processing, Vol. 21, No. 1

External Links

References

^ Daisaku Yokoyama - Japan, LinkedIn
^ ICGA Reference Database (pdf)
^ David Levy (2002). SOME COMMENTS ON REALIZATION PROBABILITIES AND THE SEX ALGORITHM.ICGA Journal, Vol. 25, No. 3
^ The 17th International Conference on Algorithmic Learning Theory (pdf)

What links here?

Page	Date Edited
15th Computer Olympiad	Aug 12, 2017
Akira Ura	Jun 26, 2017
Automated Tuning	Feb 27, 2018
Capture Extensions	Oct 26, 2012
Daisaku Yokoyama	May 23, 2016
David Levy	Jan 3, 2017
Extensions	Apr 19, 2018
ICGA Journal	Dec 21, 2017
Learning	Feb 20, 2018
Makoto Miwa	Jun 26, 2017
People	Feb 28, 2018
SEX Algorithm	Nov 25, 2014
Shogi	Feb 19, 2018
Takashi Chikayama	Jun 26, 2017
Yoshimasa Tsuruoka	Aug 14, 2017

Up one level

Data

GerdIsenberg — Sun, 26 Nov 2017 19:00:32 GMT

Home * Programming * Data

		Data is anything in a form suitable for use with a computer to represent information or knowledge. Bits, bytes, characters, strings, numbers, codes, sets, sequences and structures, as well as references (pointers, addresses) to related data, retrievable stored in memory of any kind of hardware. A variable in the context of programming languages, associates a symbolic name with a memory address.
Data mining ^[1]

Processor's View

From processor's point of view, an atomic fixed sized data item with a unique memory address is a primitive data item, today usually with a size of one, two, four, or up to eight bytes, sometimes even 16 or 32 bytes. One of these data items may represent numbers in various formats and value ranges, finite sets, codes like a character of a text or a piece on the chessboard, or even instruction codes and memory addresses. It fits into one processor register and is subject of arithmetical or logical operations, or, if interpreted as (part of an) address, to perform random memory access, that is to store and retrieve primitive data items. Program code is decoded and interpreted as instruction to control the combinatorial and sequential logic while executing a program within its processor, usually distinct from application specific data, if the application is not an assembler, compiler or debugger or anything related to self-modifying code or self-replication ^[2] .

A collection of primitive data types, located consecutively in memory may be accessed relative to the address of its first element via another data item, an index, or - specially if the primitive data items have different sizes, via constant offsets. From machine perspective, this covers array (vector) and structure, while the latter may be interpreted as concrete implementation of abstract objects.

Lifetime of Data

Data may resist in persistent non-volatile memory or volatile random-access memory. The lifetime of volatile data depends on the data declaration of various programming languages, in C related to storage class specifiers ^[3] .

Static Data

Global or static data as determined and may be initialized at compile time requires static memory allocation. Static data resides in an object file or in segmentated memory in a data- or bss-segment, dependent on their initialization. For instance, some chess programs keep material- and other lookup tables initialized in their object file and data segment, for huge tables likely by generated source code with appropriate data declarations and static initialization. Assuming the initialization code is (much) shorter than the generated data, others prefer to reduce the size of the object file to initialize stuff located in the bss-segment or elsewhere after program startup.

Dynamic Data

Dynamic data is created during the runtime of a process, it might be allocated from a memory pool (heap), and freed if no longer needed, depending on the framework or programming languages, either explicitly, or implicitly by garbage collection.

Automatic Data

Automatic data and variables like local variables and actual parameters have a limited lifetime inside the scope of a subroutine or block. Automatic variables either reside on the processor stack, or inside a processor register.

Algorithms + Data

Data structures are inherently related to algorithms and their efficiency, as for instance elaborated by Niklaus Wirth in Algorithms + Data Structures = Programs ^[4] .

Primitive Types

General Purpose

Chess Specific

Scalar integers as numbers, enumerations or simple structures related to Chess and Search basics.

Structured Data

General Purpose

Chess Specific

Persitant Data

Endianness

Publications

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

1970 ...

Burton H. Bloom (1970). Space/time trade-offs in hash coding with allowable errors. Comm. of the ACM, Vol. 13, No. 7, pdf ^[6]
Niklaus Wirth (1976). Algorithms + Data Structures = Programs

1980 ...

Guy Jacobson (1989). Succint Static Data Structures. Ph.D. thesis, Carnegie Mellon University, CMU-CS-89-112, pdf
Guy Jacobson (1989). Space-efficient Static Trees and Graphs. SFCS'89, pdf

1990 ...

Keith E. Gorlen, Sanford M. Orlow, Perry S. Plexico (1990). Data abstraction and object-oriented programming in C++. Wiley ^[7] ^[8] » C++
Bernhard Balkenhol (1994). Data Compression in Encoding Chess Positions. ICCA Journal, Vol. 17, No. 3, zipped ps » Chess Position
Robert Levinson (1994). UDS: A Universal Data Structure. UCSC CRL-94-15
Leen Ammeraal (1996). Algorithms and Data Structures in C++. ISBN 0-471-96355-0, Chichester: John Wiley
Liwu Li (1998). Java - Data Structures and Programming. Springer

2000 ...

Julio César Hernández-Castro, Ignacio Blasco-López, L.Javier Garcéa-Villalba (2004). Hiding Data in Games. ICGA Journal, Vol. 27, No. 2
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 ^[9]
Carl Burch, Data & Procedure. On-line Book
Kurt Mehlhorn, Peter Sanders (2008). Data Structures and Algorithms: The Basic Toolbox. Springer, ISBN 978-3540779773
Denis Xavier Charles, Kumar Chellapilla (2008). Bloomier Filters: A Second Look. ESA 2008 ^[10]
Anthony Cozzie, Frank Stratton, Hui Xue, Samuel T. King (2008). Digging for Data Structures. OSDI 2008, pdf
Felix Putze, Peter Sanders, Johannes Singler (2009). Cache-, hash-, and space-efficient bloom filters. ACM Journal of Experimental Algorithmics Vol. 14

External Links

References

What links here?

Page	Date Edited
68030	Jun 7, 2016
Algorithms	May 5, 2017
Array	Dec 1, 2016
Attack and Defend Maps	Nov 5, 2016
Barbara Liskov	Oct 30, 2014
Big-endian	Jan 25, 2015
Bit	Oct 29, 2012
Butterfly Boards	Jan 27, 2015
Byte	Apr 5, 2013
Chafitz	Dec 25, 2017
Data	Nov 26, 2017
David Eppstein	Oct 10, 2013
De Bruijn sequence	Feb 20, 2018
Deep Learning	Feb 12, 2018
Donna	Aug 17, 2017
Double	May 30, 2016
Double Word	Jan 25, 2015
Endianness	Jan 25, 2015
Ferranti Mark 1	Jun 2, 2015
Float	Nov 11, 2016
Fredrik Niemelä	Dec 29, 2016
Generic Programming	Jul 7, 2012
Gerard Zielinski	Sep 25, 2014
Hash Table	Jan 1, 2018
Joe Culberson	Dec 13, 2016
Kazunori Yamaguchi	Jun 20, 2016
Keith Gorlen	May 23, 2016
Linked List	Oct 11, 2016
Little-endian	Jan 25, 2015
Memory	Dec 8, 2017
Move List	Jul 19, 2017
MVC to include	May 7, 2011
Nibble	Jan 25, 2015
Node	Jul 20, 2015
NoonianChess	Jan 7, 2016
Oliver Vornberger	Oct 23, 2015
Process	Jul 31, 2017
Programming	Dec 16, 2017
Protocols	Jan 20, 2018
Quad Word	Jan 25, 2015
Queue	Apr 4, 2017
Shared Hash Table	Sep 11, 2017
Shy	Jul 19, 2016
Sinclair ZX81	Sep 14, 2015
Sloppy	Sep 17, 2016
Space-Time Tradeoff	Jun 17, 2015
Stack	Nov 18, 2016
Steven Walczak	May 23, 2016
Triangular PV-Table	Jun 12, 2017
Wee Chong Oon	Jul 16, 2015
Wojciech Wieczorek	Mar 17, 2015
Word	Jan 25, 2015

Up one Level

David Kittinger

GerdIsenberg — Wed, 27 Dec 2017 11:00:47 GMT

Home * People * David Kittinger

		David (Dave) Kittinger, an American electrical engineer and computer chess programmer, active since 1979 with his first program MyChess, which was quite successful during its ACM 1979 debut. Short after, David started to work for Novag in developing programs for dedicated chess computers, beside others Savant, Robot Adversary, Constellation and the mighty Super Constellation with its pre scan heuristics ^[1]. He later also wrote the chess engine for Chessmaster 2000 and was further involved in developing the Chessmaster 3000 ^[2] ^[3] ^[4]. In 1995 David Kittinger released his new DOS-Program WChess, also the engine of Sierra's Power Chess ^[5], market since 1996 as Windows 95 program ^[6], and of Interplay's USCF Chess in 1998 ^[7]. The further developed WChess 2000 was incorporated as game AI in Majestic Chess, released in 2003 by Sierra and Vivendi ^[8], and inside Sierra's Disney's Aladdin Chess Adventures in 2004 ^[9]. His long time collaboration with Novag still yields in new dedicated units from time to time, for instance Novag Citrine in 2006. In 1995 during the WCCC 1995 in Hong Kong, David told Bruce Moreland about a move generation scheme, which was later called 0x88 ^[10] .
David Kittinger ^[11]

Photos



David Kittinger, WCCC 1983 ^[12]

Thompson and Kittinger at WCCC 1989 in Edmonton, Alberta ^[13]

Publications

Harry Shershow (1981). The MyChess-CSC Confrontation at San Jose. Personal Computing, Vol. 5, No. 1, pp. 79 » MCC 1980, Interviews with David Kittinger and Mike Samole
Dave Kittinger (1984). MyChess - Chess Playing Program. The Software Toolworks, pdf hosted by garlanger.com
David Kittinger, Scott McDonald (1984). Report from the U.S. Open. Computer Chess Digest Annual 1984 pp. 15-33
David Kittinger (1984). Report from Budapest. Computer Chess Digest Annual 1984 pp. 34
David Kittinger (1985). 15th North American Computer Chess Championship. 1985 Computer Chess Digest Supplement
The Editor (1994). David Kittinger, Professional Biography. Computer Chess Reports, Vol. 5, No. 1, p. 21

Forum Posts

Hello all by Dave Kittinger, CCC, April 25, 2012
Re: Hello all by Dave Kittinger, CCC, April 25, 2012
Consumer Computer Chess History Trivia by ChessChallenger, Hiarcs Forum, December 22, 2015

External Links

David Kittinger's ICGA Tournaments
David Kittinger - Interview by Bryan Whitby
David Kittinger from MobyGames
Meet the Authors by Ed Schröder
Kittinger, David from Schachcomputer.info Wiki (German)

References

^ PSH from Schachcomputer.info Wiki (German)
^ Re: Historical Chessmaster ? by John Merlino, CCC, April 24, 2005
^ Re: Historical Chessmaster ? by John Merlino, CCC, April 24, 2005
^ Re: Hello all by Dave Kittinger, CCC, April 25, 2012
^ Meet the Authors by Ed Schröder
^ Power Chess from Wikipedia
^ USCF Chess for Windows (1998) - MobyGames
^ Hoyle Majestic Chess Review - GameSpot.com
^ Disney's Aladdin Chess Adventures for Windows (2004) - MobyGames
^ 0x88 Move Generation by Bruce Moreland
^ Echecs Electroniques pour Tous - Programmeurs (French)
^ László Lindner, A SZÁMÍTÓGÉPES SAKK KÉPEKBEN című melléklete - The pictures of the Beginning of Chess Computers
^ Thompson and Kittinger at 6th World Computer Chess Championship in Edmonton, Alberta, Gift of Monroe Newborn 1989 from The Computer History Museum

What links here?

Page	Date Edited
0x88	Nov 28, 2016
ACM 1979	Apr 3, 2017
ACM 1980	Dec 25, 2017
ACM 1981	Jan 19, 2018
ACM 1982	Jul 19, 2016
ACM 1984	Jul 19, 2016
ACM 1986	Dec 5, 2017
ACM 1987	Dec 5, 2017
ACM 1988	Dec 5, 2017
ACM 1989	Jun 7, 2016
ACM 1994	May 5, 2017
Atari ST	Dec 7, 2016
Bebe	Dec 23, 2017
Blitz Monster	Jan 8, 2016
Canadian Computer Chess Invitational Championship 1984	Mar 2, 2013
Cartoons	Dec 1, 2017
Chess Challenger	Dec 27, 2017
Chess-Master	Sep 7, 2017
Chessmaster	Jan 21, 2018
Computer Chess Reports	May 15, 2016
Constellation	Oct 2, 2016
CPWTIPC 1981	Oct 12, 2013
CXG Star Chess	Jun 23, 2017
Dan Spracklen	Jan 17, 2017
David Kittinger	Dec 27, 2017
Disney's Aladdin Chess Adventures	May 15, 2014
Enterprise	Jun 23, 2017
European MCC 1983	May 22, 2016
Fairchild F8	Jul 31, 2015
Harold Bogner	Oct 12, 2012
Harry Shershow	Dec 27, 2017
Harvard Cup 1994	Apr 21, 2014
James Parker	Oct 20, 2013
John Merlino	Feb 26, 2015
John Urwin	Dec 23, 2017
Kasparov simul vs 32 micro Hamburg 1985	Dec 22, 2017
Lars Hjörth	Sep 5, 2017
Majestic Chess	Jan 20, 2018
MCC 1980	Dec 27, 2017
Michael E. Duffy	Apr 19, 2014
MyChess	Dec 25, 2017
Myron Samole	Dec 27, 2017
Novag	Aug 19, 2015
Novag Citrine	Aug 19, 2015
Novag Expert	Aug 3, 2013
Novag Forte	Aug 3, 2013
Novag Micro Chess	Jan 16, 2013
Novag Sapphire	Aug 19, 2015
Novag X	Jan 7, 2016
Oracle	Sep 4, 2016
PCW-MCC 1979	Dec 23, 2017
People	Feb 28, 2018
Personal Computing	Dec 27, 2017
Peter Auge	Jul 13, 2017
Piece-Square Tables	Mar 31, 2018
Pioneer	Dec 23, 2017
Power Chess	Feb 6, 2015
Revelation	Jul 15, 2016
Revelation II	Jan 8, 2018
Rex	Jan 7, 2016
RexChess	Dec 7, 2016
Robot Adversary	Mar 14, 2015
Ron Nelson	Feb 4, 2016
Savant	Feb 4, 2017
Scorpio	Mar 28, 2018
Scott McDonald	Jan 7, 2016
Sensory 9	Jan 8, 2016
Stockholm MCCT 1980	Sep 5, 2017
Stockholm MCCT 1981	Oct 12, 2013
Super Constellation	Oct 1, 2016
Ulf Rathsman	Jan 7, 2016
USCF Chess	Feb 6, 2015
USOCCC 1986	Dec 1, 2017
USOCCC 1987	Nov 30, 2017
Walt Bilofsky	Apr 18, 2014
Walter Faxon	Mar 6, 2015
WCCC 1980	Dec 25, 2017
WCCC 1983	Jan 20, 2018
WCCC 1989	Dec 5, 2017
WCCC 1995	Jul 12, 2017
WChess	Jan 7, 2016
WMCCC 1981	Apr 3, 2017
WMCCC 1983	Jun 5, 2017
WMCCC 1985	Feb 6, 2018
Xenarbor	Sep 6, 2014
ZX Spectrum	Aug 3, 2016

Up one level

David Levy

GerdIsenberg — Tue, 03 Jan 2017 09:05:35 GMT

Home * People * David Levy

		David Neil Lawrence Levy, (born 1945 in London) a Scottish International Master chess player (IM Title 1969), Bachelor of Science in Pure Maths, Physics and Statistics ^[1] , renowned computer chess expert and promoter, tournament organizer, businessman, and president of the ICGA, the International Computer Games Association. David Levy authored and co-authored an enormous number of articles and books on Chess, Computer Chess and AI-Topics. Noteworthy is the commercial edition of his Ph.D. thesis Love and Sex With Robots: The Evolution of Human-Robot Relationships ^[2] , which he defended successfully on October 11, 2007, at Maastricht University, The Netherlands.
David Levy ^[3]

Photos



David Levy ponders next move against Chess 4.6 ^[4]

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

The Gambler

The Levy Bet

		In 1968, Donald Michie, founder of the Department of Machine Intelligence and Perception at the University of Edinburgh, invited Levy, already a strong international chess player and graduated computer scientist, to the Artificial Intelligence (AI) workshop in Edinburgh ^[6] . Levy played a friendly game of chess against John McCarthy, which Levy won. McCarthy remarked that David was able to beat him, but predicted a computer program would beat David within ten years. David then offered the famous bet, that within that time no chess program would beat him in a tournament match. McCarthy took the bet after consulting Michie ^[7] . The two made a 500 Pound bet, which was later more than doubled when Donald Michie, Seymour Papert from MIT and Ed Kozdrowicki from the University of California, joined in the wager ^[8] . David Levy redeemed the bet ten years later, winning a match against Chess 4.7 in Toronto, 1978 ^[9] . He won a second 5 year bet in 1984, versus Cray Blitz, and then offered a price for the first computer chess team beating him. He finally got crashed 0-4 by Deep Thought in 1989 ^[10].
Cartoon by Jeff Ragsdale ^[11]

Did they all pay up?

Following letter by David Levy was published in the ICCA Newsletter, Vol. 2, No 1, February 1979:

Since my match in Toronto, last August and September, in which I won my ten years old bet, many people have asked me the inevitable question, "Did they all pay up?", meaning the four people with whom I made the bet. I should like to use the pages of the Newsletter to answer this question and to save people from writing to me or asking me about it.

Donald Michie, John McCarthy and Seymour Papert all paid promptly and with good sportsmanship, just as I would have done had I lost. Edward Kozdrowicki, currently of the Aerospace Corporation in El Segundo, California, has not paid and has refused to respond in a positive fashion to a number of telephone calls and letters.

I trust that this answers all questions relating to the payment of the bet.

Advent of EGT

CHAOS failed

Quote by David Levy from his Computer Chess Compendium, The Endgame, pp. 293-294:

The Ending of KRPKR, first attracted the attention of chess programmers in 1974. I was talking to the programmers of CHAOS, during the ACM 1974 in San Diego, and they expressed doubt at my statement that within a year they would not be able to program a computer to play this configuration correctly for both sides, winning with the extra pawn whenever a win was possible, drawing with a pawn less whenever the game really should end in a draw. The discussion closed with a $100 bet, and at the following year's tournament they paid up, admitting that the task was so difficult that they had not even been able to start on it.

Thompson's Databases

The discussion on KRPKR at ACM 1974 further inspired Ken Thompson to work some 10 years on chess endgames and to develop the Thompson's Databases ^[12] :

The second tournament I was in was in San Diego in about '75, '74. And in that tournament David Levy, who is a famous chess personality, was the tournament director. And after the games we were in the bar talking and he was saying that "computers can't play endgames, even simple endgames and they never will." And he said "I am an expert in the rook and pawn against rook endgame and a computer will never play a rook and pawn against rook endgame." And so, I went to my room that evening and was calculating the numbers and came to the conclusion that this was doable, that you could solve that game, absolutely solve it by a different mechanism, you know, not by normal computer chess but by a different mechanism. You could just have the answer and look it up and make a table of everything you are supposed to do. And I came back the next day and told him about it and he say's "nah, it takes too many plys, you know", and I said "no, it is ply independent, this is a different method", so he say's "ah no" so he just "poo poo'd me" and I got sort of, angry is not the right word but I got, you know, you know, so I went home and I worked probably for about ten years on endgames.

Scotch versus Vodka

David Levy further on a second KRPKR bet in Computer Chess Compendium, The Endgame, pp. 293-294:

Being rather greedy, I made a similar bet with Dr. Arlazarov of Kaissa fame during the 1977 World Computer Championship in Toronto. This time the bet was a case of Scotch (if I lost) against a case of Vodka. We agreed that Yuri Averbakh, President of the U.S.S.R. Chess Federation and a renowned endgame expert, would act as arbiter. Just about one year later I heard that I owed Arlazarov a case of Scotch, and section 8.3 of this compendium describes how he and his colleagues collected the wager ^[13] .

WCCC and ICCA

WCCC

David Levy, already associated with Monroe Newborn and Ben Mittman from the early ACM Computer Chess Championships, was initiator and co-founder of the World Computer Chess Championship in 1974, as suggested by the Soviet programmers of Kaissa ^[14] :

Since 1972 (1970 Editor) in the USA and Canada were hold the yearly championships of North America among the chess programs, organized by the ACM. The team of Kaissa directed the organizers of these tournaments to the thought to conduct a world championship, whose organization within the framework its regular congress took upon itself.

ICCA

Three years later at the 2nd WCCC 1977 in Toronto, together with more enthusiastic chess programmers and suggested by Barend Swets, David Levy co-founded the International Computer Chess Association ICCA - Ben Mittman was elected as its first president. David Levy organized a lot of computer chess championships, acting as tournament director, reporter or as participant. He was founder and organizer of the Computer Olympiad and the Mind Sports Olympiads.

President

From 1986 to 1992, David Levy was president of the ICCA, then vice president until 1999 and since then until the present president again, since 2002 of the renamed ICGA ^[15] .

Computer Chess and AI Business

Intelligent Software

In 1979, along with his business partner Kevin O’Connell, David Levy founded Philidor Software, and in 1981 Intelligent Software ^[16] . Business was developing and trading dedicated chess computers ^[17] ^[18] and programs for home computers and PCs. Intelligent Software had several computer chess programmers under contract, Mark Taylor, David Broughton, Mike Johnson, Richard Lang and a Checkers programmer called Martin Bryant ^[19] . Primary business and trading partners were Eric Winkler ^[20] and Eric White ^[21] with their respective companies.

Intelligent Toys

David Levy is now CEO of Intelligent Toys Ltd., a London-based company founded in 2001 that develops toys that incorporate AI, and led the teams that won the Loebner Prize two times in 1997 and 2009 ^[22] ^[23] .

Programs

Levy is mentioned as co-author ^[24] of following chess programs, competing at ICCA-tournaments, while he actually was not a programmer but advisor:

Man vs. Machine

Selected Publications

^[25] ^[26] ^[27]

1976 ...

Jean E. Hayes, David Levy (1976). The world computer chess championship, Stockholm 1974. University Press (Edinburgh) ISBN 0852242859
David Levy (1976). Chess and Computers. Batsford
David Levy (1976). 1975 U.S. Computer chess championship. Computer Science Press » ACM 1975
David Levy (1977). 1976 US Computer Chess Championship. Computer Science Press, Woodland Hills, CA » ACM 1976
David Levy (1978). ACM '78. ICCA Newsletter, Vol. 1, No. 1 » ACM 1978
David Levy (1978). How I won. ICCA Newsletter, Vol. 1, No. 2
David Levy (1978). The PCW Microcomputer Chess Championships, Personal Computer World, November 1978, pdf ^[28]
David Levy (1979). Computer and Chess - How the monster thinks. Elektor, January 1979 ^[29]
David Levy (1979). How I beat the monster. Elektor, January 1979
Allan Gottlieb, Peter W. Frey, David Levy, Johann Joss (1979). Letters on Handicapping Computer Chess Programs, ICCA Newsletter, Vol. 2, No. 1
David Levy (1979). Chess Programming - Before You Begin. Personal Computer World, May 1979

1980 ...

David Levy (1980). Intelligent Games. Creative Computing, Vol. 6, No. 4, hosted by the Internet Archive
David Levy, Ben Mittman, Monroe Newborn (1980). 3rd World Computer Chess Championship. ICCA Newsletter, Vol. 3, No. 3 » WCCC 1980
David Levy, Kevin O’Connell (1981). The Best Chess Computer Yet? Chess, July 1981 » Philidor ^[30]
David Levy, Kevin O’Connell (1981). A New World Champion. Chess, October/November 1981 » WMCCC 1981 ^[31]
David Levy, Monroe Newborn (1981). More Chess and Computers, The Microcomputer Revolution, The Challenge Match. Computer Science Press, Inc., Potomac, Maryland. ISBN 0-914894-07-2
David Levy, Monroe Newborn (1982, 1983). All About Chess and Computers. Springer
David Levy (1982). Robots. Translation of Henri Vigneron (1914). Les Automates. also in David Levy (ed.) (1988). Computer Chess Compendium, pp. 273-278. pdf from cyberneticzoo.com » El Ajedrecista
David Levy (1983). Computer Gamesmanship: Elements of Intelligent Game Design. Simon & Schuster, ISBN 0-671-49532-1.
David Levy (1984). Chess Master versus Computer. ICCA Journal, Vol. 7, No. 2

1985 ...

David Levy (1986). When will Brute Force Programs beat Kasparov? ICCA Journal, Vol. 9, No. 2
David Levy (1986). ICCA's Future. ICCA Journal, Vol. 9, No. 2 » ICCA
David Levy (ed.) (1988). Computer Chess Compendium. Batsford, London
David Levy (ed.) (1988). Computer Games I. Springer, ISBN: 978-1-4613-8718-3
David Levy (ed.) (1988). Computer Games II. Springer, ISBN: 978-1-4613-8756-5
David Levy (1988). 8th World Microcomputer Chess Championship. ICCA Journal, Vol. 11, No. 4 » WMCCC 1988
David Levy, David Broughton, Mark Taylor (1989). The SEX Algorithm in Computer Chess. ICCA Journal, Vol. 12, No. 1 » SEX Algorithm
David Levy (1989). Evaluation Functions from Chess Endgame Databases. Workshop on New Directions in Game-Tree Search
David Levy (1989). The Netherlands versus the Computer World. ICCA Journal, Vol. 12, No. 2 » Netherlands-vs-Computers-1989
Jaap van den Herik, David Levy (1989). Disqualification at Portorož. ICCA Journal, Vol. 12, No. 4 » WMCCC 1989
David Levy (1989). The 20th North American Computer-Chess Championship. ICCA Journal, Vol. 12, No. 4 » ACM 1989
David Levy, Don Beal (eds.) (1989). Heuristic Programming in Artificial Intelligence - The First Computer Olympiad. Ellis Horwood » 1st Computer Olympiad

1990 ...

David Levy (1990). The End of an Era. ICCA Journal, Vol. 13, No. 1 » Levy versus Deep Thought 1989
David Levy (1990). How Will Chess Programs Beat Kasparov? Computers, Chess, and Cognition
David Levy, Don Beal (Eds.) (1991). Heuristic Programming in Artificial Intelligence - The Second Computer Olympiad. Ellis Horwood » 2nd Computer Olympiad
David Levy, Monroe Newborn (1991). How Computers Play Chess. Freeman & Co. ISBN 0-7167-8121-2
David Levy (1991). First Among Equals. ICCA Journal, Vol. 14, No. 3
David Levy, Harry Nefkens (1992). Before Databases. ICCA Journal, Vol. 15, No. 1
David Levy (1994). Straight on to Kasparov. ICCA Journal, Vol. 17, No. 2

1995 ...

David Levy (1995). Extrapolation and Speculation. ICCA Journal, Vol. 18, No. 3
David Levy (1997). Crystal Balls: The Meta-Science of Prediction in Computer Chess. ICCA Journal, Vol. 20, No. 2

2000 ...

David Levy (2002). ICCA BECOMES ICGA. ICGA Journal, Vol. 25, No. 3
David Levy (2002). SOME COMMENTS ON REALIZATION PROBABILITIES AND THE SEX ALGORITHM. ICGA Journal, Vol. 25, No. 3 ^[32]
David Levy (2003). The State of the Art in Man vs. “Machine” Chess. ICGA Journal, Vol. 26, No. 1 » Kasparov versus Deep Junior 2003
David Levy (2003). Kasparov vs X3D Fritz. ICGA Journal, Vol. 26, No. 4 » Kasparov versus X3D Fritz 2003

2005 ...

ChessBase, the Editor, John Nunn, David Levy (2005). Adams Outclassed by HYDRA. ICGA Journal, Vol. 28, No. 2 » Hydra
David Levy (2005). Man vs. Machine – What Next? ICGA Journal, Vol. 28, No. 2
David Levy (2005). Robots Unlimited: Life in a Virtual Age. AK Peters ISBN: 978-1-56881-239-7
David Levy (2005). The 2nd Bilbao Man vs. Machine Team Championship. ICGA Journal, Vol. 28, No. 4
David Levy (2007). Love and Sex With Robots: The Evolution of Human-Robot Relationships. Harper Collins ISBN: 978-0-06156-212-9, amazon, Audiobook MP3 CD from amazon
David Levy (2007). Obituary Donald Michie (1923-2007). ICGA Journal, Vol. 30, No. 3 » Donald Michie
David Levy (2009). Mikhail Donskoy - An Obituary. ICGA Journal, Vol. 32, No. 1 » Mikhail Donskoy
David Levy, Monty Newborn (2009). How Computers Play Chess. Ishi Press, amazon

2010 ...

David Levy (2011). Attack of the Clones. ICGA Journal, Vol. 34, No. 1 ^[33]
David Levy (2011). Rybka Disqualified and Banned from World Computer Chess Championships. ICGA Journal, Vol. 34, No. 2 » Rybka
David Levy (2011). A Very Sad Case. ICGA Journal, Vol. 34, No. 2 » ICGA Investigations
David Levy (2012). No Miscarriage of Justice - Just Biased Reporting. doc ^[34]
David Levy (2012). From Computer Games to a Global Brain. ICGA Journal, Vol. 35, No. 4 ^[35]
Jaap van den Herik, Aske Plaat, David Levy, Daniel Dimov (2014). Plagiarism in Game Programming Competitions. Entertainment Computing, Vol. 5, No. 3, pdf preprint
David Levy (2014). The RYBKA Case – Progress and Verdict. ICGA Journal, Vol. 37, No. 4 » Rybka Controversy

2015 ...

David Levy (2015). The "Horizon Effect" in Politics. ICGA Journal, Vol. 38, No. 2 » Horizon Effect

External Links

David Levy from Wikipedia
David Levy's ICGA Tournaments
Chess Computers - The UK Story from Chess Computer UK by Mike Watters
David Levy interview from Schachcomputer.info - Wiki
David Levy - The Othello Wiki Book Project
The History of 8bit Gaming in the UK - Popular Computing Weekly 11-17 Aug 1983
Author Archive: David Levy from Powell's Blog
Chandler Cornered Chess Sci-Fi + Traitors Mate + Blunder Table covering David Levy by Chess Edinburgh
Levy, David Neil Lawrence(Scotland) Men's Chess Olympiads
David Levy's games at chessgames.com
David Neil Lawrence Levy chess games at 365Chess.com
David Levy on the Brain Games Scandal, 2000-2003 from Kingpin Chess Magazine — the satirical chess magazine
David Levy on Kasparov vs X3D Fritz, ChessBase News, December 21, 2003
Robots unlimited – life in a virtual age, ChessBase News, May 02, 2006
Elections 2006: Does democracy work in FIDE? by David Levy, ChessBase News, May 11, 2006
Breaking news: Kirsan Ilyumzhinov reelected by David Levy, ChessBase News, June 02, 2006
Amir Ban on Deep Junior from Combinatorics and more - Gil Kalai’s blog
Robots Unlimited: Life in a Virtual Age full Bibliography by David Levy
Riz Khan Love and sex with robots - February 12, 2008, YouTube Video
Attack of the clones : ChessVibes by David Levy, 19 February, 2011 » Rybka, Fruit, Strelka
David Levy - Sex with Robots An Interview with Author David Levy by Cory Silverberg, About.com, May 18, 2011
ICGA/Rybka controversy: An interview with David Levy (1), ChessBase News, February 06, 2012
ICGA/Rybka controversy: An interview with David Levy (2), ChessBase News, February 10, 2012

References

^ Bachelor of Science in Pure Maths, Physics & Statistics at St Andrew University, Scotland 1963-67
^ David Levy (2007). Love and Sex With Robots: The Evolution of Human-Robot Relationships. Harper Collins ISBN: 978-0-06156-212-9, amazon
^ Interview with David Levy by Mig Greengrad at chessninja.com January 8, 2002
^ David Levy ponders next move against CHESS 4.6running on a CDC Cyber 176 supercomputer in Toronto August 1978, Gift of David Levy, from The Computer History Museum
^ Chess pioneers in Sacher Hotel Vienna, Austria, Gift of Benjamin Mittman, The Computer History Museum
^ Machine Intelligence Volume 4
^ Oral History of David Levy from The Computer History Museum
^ David Levy on Kasparov vs X3D Fritz, ChessBase News, December 21, 2003
^ International Master David Levy ponders next move against CHESS 4.6 running on a CDC Cyber 176 supercomputer in Toronto from The Computer History Museum
^ BBC - Future - The cyborg chess players that can’t be beaten by Chris Baraniuk, December 04, 2015
^ King Moves - Welcome to the 1989 AGT World Computer Chess Championship. Edmonton, Alberta, Canada, Courtesy of Peter Jennings from The Computer History Museum, available as pdf reprint
^ Highlights Kenneth Thompson Oral History March 7, 2005 Video © 2005 The Computer History Museum
^ Vladimir Arlazarov, Aaron L. Futer (1979). Computer Analysis of a Rook End-Game. Machine Intelligence 9 (eds. Jean Hayes Michie, Donald Michie and L.I. Mikulich), pp. 361-371. Ellis Horwood, Chichester. Reprinted in Computer Chess Compendium, already in August 1977 following paper appeared in Russian: A. G. Alexandrov, A. M. Baraev, Ya. Yu. Gol'fand, Edward Komissarchik, Aaron L. Futer (1977). Computer analysis of rook end game. Avtomatika i Telemekhanika, No. 8, 113–117, and further in 1977 A. G. Alexandrov, Vladimir Arlazarov, A. M. Baraev, Ya. Yu. Gol'fand, V. N. Deza, T. P. Il’ina, Edward Komissarchik, Anatoly Uskov, I. A. Faradzhev, Aaron L. Futer (1977). Processing of large files of information on the example of the analysis of the rook’s end game. Programming and Computer Software, No. 3
^ История “Каиссы” Михаил Донской History of Kaissa by Mikhail Donskoy, (Russian), from Russian Virtual Computer Museum
^ A Welcome from the ICGA President
^ Tony Harrington (1983). Intelligent Software. Personal Computer World, April 1983, pdf hosted by Mike Watters
^ SciSys Chess Computers 1979-1986 from Chess Computer UK by Mike Watters
^ SciSys Intelligent Chess from Chess Computer UK by Mike Watters
^ David Levy interview from Schachcomputer.info - Wiki
^ Chess Computers - The UK Story from Chess Computer UK by Mike Watters
^ De firma Millennium 2000 GmbH Hegener & Weiner in vogelvlucht by Hein Veldhuis, Dutch and German pdf
^ Home of the Worlds Best Chat Bot
^ Corporate History
^ David Levy's ICGA Tournaments
^ ICGA Reference Database (pdf)
^ Books by David N. L. Levy from amazon
^ Books by David Levy from Bookstores.com
^ Publication Archive from Chess Computer UK by Mike Watters
^ Publication Archive from Chess Computer UK by Mike Watters
^ The Best Chess Computer Yet? part 1, part 2, part 3 by Chewbanta
^ Publication Archive from Chess Computer UK by Mike Watters
^ Yoshimasa Tsuruoka, Daisaku Yokoyama, Takashi Chikayama (2002). Game-Tree Search Algorithm based on Realization Probability. ICGA Journal, Vol. 25, No. 3, pdf, pdf
^ Attack of the clones : ChessVibes by David Levy, 19 February, 2011
^ A Gross Miscarriage of Justice in Computer Chess by Søren Riis
^ Global brain from Wikipedia

Up one level

Dedicated Chess Computers

GerdIsenberg — Tue, 20 Feb 2018 21:27:00 GMT

Home * Dedicated Chess Computers

		Dedicated chess computers are for the sole purpose to play or analyze a game of chess. Minimalistic models provide a rudimentary, modal user interface, realized by seven-segment displays or LCD to display move-coordinates and short messages or symbols, and one or more push-buttons to enter moves or commands, and to switch modes. Most commercial dedicated board models, provide a sensory board to recognize moves, and light-emitting diodes to indicate coordinates of a move to be made by an operator on behalf of the computer. The first dedicated chess computer was the Chess Challenger 1, designed and created by Sidney Samole and Ron Nelson, sold by Fidelity Electronics since early 1977. In the 80s, modular systems became quite popular, to make the game playing core component exchangeable and easier and cheaper to update, while leaving the device appearance identifying parts and user interface the same.
Mephisto X aka Mephisto Portorose at ACM 1989 ^[1]

High and Fall

In the 80s and early 90s, there was a competitive market for strong dedicated chess computers, and they dominated the early computer chess tournaments dedicated for mikroprocessors. Mephisto Montreux was the last and lonesome competitor of its genre at the WMCCC 1995. Today, most dedicated units sold are of beginner and intermediate strength, and have to compete with mobile phone chess programs, for instance engines for Android or iPhone.

Nostalgia

A trend driven by collectors and enthusiasts of exclusive chess board computers, is addressed by Ruud Martin and his company Phoenix Chess Systems with the Mephisto compatible Resurrection and his own complete system Revelation.

Dedicated Topics

Dedicated Systems

Companies

Tournaments

Dynamic Lists

Dedicated Computers

To expand this list, create a new engine or dedicated chess computers page with the tag "dedicated".

Video Game Console

To expand this list, create a new engine or hardware page with the tag "gameconsole".

Publications

^[2]

1979

Evan Katz (1979). A Glimpse at the World of Micro-Chess. Personal Computing, Vol. 3, No. 7, pp. 83
Editor (1979). A Review of Chess Devices and Programs. Personal Computing, Vol. 3, No. 11, pp. 73
Schachcomputer: Markt und Müll, Der Spiegel 49/1979, December 03, 1979 (German) pdf

1980 ...

Schachcomputer: Tricks und Trug, Der Spiegel 50/1980, December 08, 1980 (German) pdf
John F. White (1982). Review-Chess Computers. Your Computer, March 1982
Schachcomputer: Lästig, nicht lustig, Der Spiegel 49/1982, December 06, 1982, (German) pdf
Tom Fürstenberg (1984). Micro Chess Computers. ICCA Journal, Vol. 7, No. 3
Göran Grottling (1984). The Truth about their Strength. ICCA Journal, Vol. 7, No. 4

1985 ...

Tom Fürstenberg (1985). Micro Chess Computers (Part 2). ICCA Journal, Vol. 8, No. 1
Göran Grottling (1985). How to Bracket the Truth in Playing Strength. ICCA Journal, Vol. 8, No. 1
Gute Taktiker, schlechte Strategen, Der Spiegel 25/1985, June 17, 1985 (German)
Danny Kopec (1985). Chess Computers - A critical descriptive Analysis of the currently available commercial Chess Computers. Abacus Vol. 2 No. 4, Editor-shortened version as pdf, pdf » Super Constellation, Elite
Hans-Peter Ketterling (1987). Neuigkeiten aus Nürnberg. Europa-Rochade, 03-1987, 04-1987, pdf hosted by Hein Veldhuis (German)

2000 ...

Timothée Cour, Rémy Lauranson, Matthieu Vachette (2002). Autonomous Chess-playing Robot. École Polytechnique, pdf
Stewart Gracie, Jonathan Matthey, David Rankin, Konstantinos Topoglidis (2005). Lego Chess Robot. University of Glasgow, pdf ^[3] ^[4] ^[5]

Forum Posts

2005 ...

New wooden chess computer by me by Fernando Villegas, CCC, January 28, 2005

2010 ...

Soviet chess computers by IvenGO, Hiarcs Forum, November 22, 2011
It's Magic by Spacious Mind, Hiarcs Forum, November 23, 2011 » Mysticum
Raspberry Pi / Stockfish dedicated chess computer/board by Jean-Francois Romang, CCC, August 26, 2012 » Raspberry Pi
PicoChess stand alone chess computer has born :-) by Jean-Francois Romang, CCC, August 28, 2012 » PicoChess
PicoChess finally on Raspberry Pi by Jean-Francois Romang, CCC, September 25, 2012
The Ultimate Dedicated Challenge by Harvey Williamson, Hiarcs Forum, May 15, 2013
The dedicated chess computer thread by Thorsten Czub, CCC, August 12, 2014

2015 ...

Millennium Chess Genius is here by Thorsten Czub, CCC, October 09, 2015 » Chess Genius
For fans of old chess computers by Franz Huber, CCC, July 31, 2016
new chess computer: CT800 by Rasmus Althoff, CCC, September 05, 2016 » CT800, NG-play

External Links

Chess Computer Links

Blitzchess Nostalgie by Eric Belot (French)
chesscomputers.org by Ismenio Sousa
ChessComputers - World's Strongest Dedicated Chess Module
Chess Computer by Pit (mostly German) ^[6]
Chess Computer UK by Mike Watters
Chess Computer | Collectors Magazine
ChessEval Journal, Editor of Chief: Maurice M. Ohayon, Associate Editor: Hans van Mierlo
Computer Collection on Flickr by Steve Blincoe
Electronic Chess Computers & Computer Chess by The Spacious Mind
miclangschach.de by Michael Lang (German)
Museo Computadoras (Spanish)
Schaakcomputers en computerschaak by Luuk Hofman (Dutch)
Schaakcomputer database by Hein Veldhuis
Schachcomputer.info Wiki (German)
Tom's Chess Computer Collection by Thomas McBurney
Welcome to Phoenix Chess Systems

Self-made

Arduino & Raspberry PI Chess Computer running Stockfish on Raspberry Pi, by Max Dobres » Arduino, Sensory Board
Berger's Projects - DIY » SolusChess by Berger
Mysticum by Michael Lang (German) » Mysticum ^[7]
Sish - Computer Interfacing DIY Chessboards » USB Chess Board
Sish - Computer Interfacing DIY Chessboards: Building a Sish Board, a tutorial
Self-made Chess Computer SHAH based on an Atmel-ATmega88 Microcontroller and Micro-Max-port by Andre Adrian (German)
AVR-Max-Schachzwerg from Schachcomputer.info - Wiki (German)
ATM18 Mini Chess Computer from ELEKTOR.com – Platform for electronics and microcontrollers
Der CC2-Schachzwerg - ELEKTOR.de
Mini-ajedrez con AVR-Max - ELEKTOR.es
CC2, le génie des échecs - ELEKTOR.fr
Schaakmat gezet! - ELEKTOR.nl
Harm Geert Muller's Matchbox Computer ^[8]
Tiny Chess Playing Computer by James Hobson, Hackaday, September 15, 2013
Lonely? Build Yourself a Chess Robot! by Will Sweatman, Hackaday, March 15, 2015

References

^ Mephisto X computer chess board at the 20th ACM North American Computer Chess Championship in Reno, Nevada, Gift of Monroe Newborn, The Computer History Museum
^ Publication Archive from Chess Computer UK by Mike Watters
^ LegoLab
^ Lego from Wikipedia
^ Lego Mindstorms from Wikipedia
^ Excellent Chess Computer Web Site by Chessmaster Ireland, Hiarcs Forum, February 08, 2014
^ It's Magic by Spacious Mind, Hiarcs Forum, November 23, 2011
^ Harm Geert Muller (1990). A Matchbox Chess Computer. ICCA Journal, Vol. 13, No. 4

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

Fidelity Phantom

GerdIsenberg — Fri, 01 Dec 2017 17:59:19 GMT

Home * Engines * Fidelity Phantom

		Fidelity Phantom, a series of robot type dedicated chess computers by Fidelity Electronics with a 6502 program by Dan and Kathe Spracklen, released in three models since 1988, the normal Phantom (model 6100), and the talking Chesster Phantom (model 6124) and Chesster Phantom “Eyeball” (model 6126, “Hi I’m Chesster. How about a nice game of chess ...”) ^[1]. The Fidelity Phantom was basically a re-launch of the 1982 Milton Bradley Phantom with a Spracklen program within 64 KiB of ROM. Sidney Samole had bought the rights on the Robot from Milton Bradley International Inc.. After the acquisition of Fidelity Electronics by Hegener & Glaser in 1989, the same computer was sold under the new brand name Mephisto Phantom ^[2].
Fidelity Chesster Phantom 6124 ^[3]

Reports

Phantom Computer Has All The Chess Moves by Phil Vettel, Chicago Tribune, November 25, 1988

Forum Posts

Phantom Chesster Eyeball by Michael Watters, CCC, November 11, 2004
Re: Automated piece mover Chess Computer? by Robert Hyatt, CCC, January 08, 2008
Rare Fidelity Phantom by Sargon1972, Hiarcs Forum, November 11, 2013
Question regarding Milton Bradley Phantom by Larry, Hiarcs Forum, November 18, 2013

External Links

Fidelity Phantom

Phantom

References

^ Re: Phantom Chesster Eyeball by Steve B, CCC, November 11, 2004
^ Fidelity Phantom from Schachcomputer.info Wiki (German)
^ 1.The Ultra Rare Collection: Flickr by Chewbanta

What links here?

Page	Date Edited
Aegon 1989	Jan 22, 2017
Engines	Mar 10, 2018
Fidelity Electronics	Dec 1, 2017
Fidelity Phantom	Dec 1, 2017
Milton Bradley	Jun 30, 2013
Milton Bradley Phantom	Apr 18, 2016
Robots	Feb 20, 2018
Terry Everett	Dec 1, 2017

Up one level

Guofeng Tong

GerdIsenberg — Mon, 23 May 2016 15:22:59 GMT

Home * People * Guofeng Tong

Guofeng Tong,
a Chinese computer scientist and professor at the Institute of Artificial Intelligence and Robotics, Northeastern University, Shenyang, Liaoning. His research interests include artificial intelligence, machine learning, pattern recognition, mobile robots, computer vision and computer games.

Selected Publications

^[1]

Guofeng Tong, Wendong Xiao, Xinhe Xu (2000). Design of RoboCup robot soccer global vision system. Proceedings of the 3rd World Congress on Intelligent Control and Automation
Guofeng Tong, Ying Qu, Tong Cheng (2009). Human-computer interactive gaming system - a chinese chess robot. IROS 2009, pp. 984-987
Guofeng Tong, Ran Liu, Jindong Tan (2011). 3D Information retrieval in Mobile Robot Vision based on spherical compound eye. ROBIO 2011
Guofeng Tong, Xinhe Xu (2011). Progress of Computer Games in China. ICGA Journal, Vol. 34, No. 3

External Links

Guofeng Tong from Microsoft Academic Search

References

^ DBLP: Guofeng Tong

What links here?

Page	Date Edited
Chinese Chess	Jan 16, 2018
Guofeng Tong	May 23, 2016
ICGA Journal	Dec 21, 2017
People	Feb 28, 2018
Robots	Feb 20, 2018
Xinhe Xu	Jan 3, 2017

Up one level

Henri Vigneron

GerdIsenberg — Tue, 20 Nov 2012 10:26:13 GMT

Home * People * Henri Vigneron

Henri Vigneron was a French physicist. From 1911 until 1915 he wrote articles in the French scientific journal La Nature, in 1914 about the chess machine El Ajedrecista by Leonardo Torres y Quevedo, Les Automates ^[1], which was translated in the 80s by David Levy, also published in the Computer Chess Compendium ^[2].

Publications

^[3]

Henri Vigneron (1911). Les preuves de la réalité moléculaire. La Nature, N°2010 - 2 Décembre 1911
Henri Vigneron (1911). Les grains d’électricité et la dynamique électromagnétique. La Nature, N°2012 - 16 Décembre 1911
Henri Vigneron (1911). La théorie électronique des métaux. La Nature, N°2014 - 30 Décembre 1911
Henri Vigneron (1912). La structure discontinue de l’énergie. La Nature, N°2017 - 20 Janvier 1912
Henri Vigneron (1913). Les bases modernes de la thermodynamique. La Nature, N°2077 - 15 Mars 1913
Henri Vigneron (1913). La pompe à vide moléculaire. La Nature, N°2078 - 22 Mars 1913
Henri Vigneron (1913). Bulles de savon. La Nature, N°2079 - 29 Mars 1913
Henri Vigneron (1913). La longueur d’onde des rayons X. La Nature, N°2093 - 5 Juillet 1913
Henri Vigneron (1913). Bouteille inviolable. La Nature, N°2097 - 2 Aout 1913
Henri Vigneron (1913). La fabrication mécanique des chaussures. La Nature, N°2106 - 4 Octobre 1913
Henri Vigneron (1913). La vision dans l’eau. La Nature, N°2115 - 6 Décembre 1913
Henri Vigneron (1914). La physique du discontinu. La Nature, N°2120 - 10 Janvier 1914
Henri Vigneron (1914). Les progrès de nos connaissances concernant les rayons de RŒTGEN. La Nature, N°2122 - 24 Janvier 1914
Henri Vigneron (1914). Les cristaux liquides. La Nature, N°2126 - 21 Février 1914
Henri Vigneron (1914). Les radioéléments et leur classification. La Nature, N°2129 - 14 mars 1914
Henri Vigneron (1914). La biréfringence des liquides purs. La Nature, N°2133 — 11 avril 1914
Henri Vigneron (1914). Symétrie des cristaux et symétrie moléculaire. La Nature, N°2134 - 18 Avril 1914
Henri Vigneron (1914). Les atomes rendus visibles par les rayons X : Une révolution dans l’analyse spectrale. La Nature, N°2143 - 20 Juin 1914
Henri Vigneron (1914). Le mouvement des particules lumineuses dans les gaz. La Nature, N°2147 - 18 Juillet 1914
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. » El Ajedrecista
Henri Vigneron (1915). La démolition des obus non éclatés. La Nature, N°2161 - 27 Février 1915
Henri Vigneron (1919). Les applications de la physique pendant la guerre.

External Links

References

^ Henri Vigneron (1914). Les Automates. La Nature, pdf from cyberneticzoo.com
^ Translation of Henri Vigneron (1914). Les Automates 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. pdf from cyberneticzoo.com
^ La Nature, année 1914 - Gloubik Sciences

What links here?

Page	Date Edited
Computer Chess Compendium	Dec 29, 2015
David Levy	Jan 3, 2017
El Ajedrecista	Feb 25, 2015
Electro-Mechanical	May 2, 2016
Henri Vigneron	Nov 20, 2012
KRK	Nov 26, 2016
Leonardo Torres y Quevedo	Feb 25, 2015
People	Feb 28, 2018
Robots	Feb 20, 2018

Up one level

Ivan Bratko

GerdIsenberg — Wed, 16 Aug 2017 18:30:37 GMT

Home * People * Ivan Bratko

		Ivan Bratko, a Slovenian computer scientist and researcher in artificial intelligence and computer chess, Professor at the Faculty of Computer and Information Science University of Ljubljana. In 1982, at the University of Edinburgh, Ivan Bratko and Danny Kopec designed the Bratko-Kopec Test ^[1]^[2]
Ivan Bratko ^[3]

Quotes

Research Interests

Quote from Ivan Bratko's Homepage ^[4]:

Professor Bratko has conducted research in machine learning, knowledge-based systems, qualitative modeling, intelligent robotics, heuristic programming and computer chess. His main interests in machine learning have been in learning from noisy data, combining learning and qualitative reasoning, constructive induction, Inductive Logic Programming and various applications of machine learning, including medicine and control of dynamic systems.

Chess Endgames

Quote by Maarten van Emden in I remember Donald Michie ^[5]:

In 1980 I spent another summer in Edinburgh as a guest of Donald Michie. Since the low point of 1975, thanks to assiduous and inventive joint pursuit of funding possibilities by Donald and Jean, the Machine Intelligence Research Unit was alive with work focused on chess endgames. There were students, including Tim Niblett and Alen Shapiro. Danny Kopec was there, perhaps formally as a student, but de facto as the resident chess consultant. Ivan Bratko visited frequently. Alen was the administrator of the dream computing environment of that time: a small PDP-11 running Unix.

CLESS

In 1979/80, as visiting researcher at University of Edinburgh, Ivan Bratko worked with Zdenek Zdrahal and Alen Shapiro on Pattern Recognition applied to Chess. In fact they used Bitboards, called cellular 8x8 arrays, to implement their Cellular logic processing emulator for chess (CLESS) ^[6] . CLESS used three kinds of instructions to recognize simple and more complex chess patterns:

bitwise boolean operations without any interactions between squares
shifts as expand instructions
fill-like propagation instructions, internally using the first two kinds of instructions and conditions in loops

Selected Publications

^[7] ^[8]

1978 ...

Ivan Bratko (1978). Proving Correctness of Strategies in the AL1 Assertional Language. Information Processing Letters, Vol. 7, No. 5, pp. 223-230. ^[9]
Ivan Bratko, Danny Kopec, Donald Michie (1978). Pattern-Based Representation of Chess Endgame Knowledge. The Computer Journal, Vol. 21, No. 2, pp. 149-153. pdf
Donald Michie, Ivan Bratko (1978). Advice Table Representations of Chess End-Game Knowledge. Proceedings 3rd AISB/GI Conference, pp. 194-200.
Ivan Bratko (1979). Implementing Search Heuristics using the AL1 Advice-Taking System. Proc. Sixth Int. Joint Conf. on Art. Intell., pp. 95-97. ^[10]
Ivan Bratko, Tim Niblett (1979). Conjectures and Refutations in a Framework for Chess Endgames. in Expert Systems in the Micro-Electronic Age (Donald Michie, ed.), Edinburgh: Edinburgh University Press.

1980 ...

Ivan Bratko, Donald Michie (1980). An Advice Program For a Complex Chess Programming Task. Computer Journal, Vol. 23, No. 4, pp. 350-353.
Ivan Bratko, Donald Michie (1980). A Representation of Pattern-Knowledge in Chess Endgames. Advances in Computer Chess 2
Zdenek Zdráhal, Ivan Bratko, Alen Shapiro (1981). Recognition of Complex Patterns Using Cellular Arrays. The Computer Journal, Vol. 24, No. 3, pp. 263-270
Ivan Bratko (1982). Knowledge-Based Problem-Solving in AL3. Machine Intelligence 10 (eds. Jean Hayes Michie, Donald Michie and Y.H. Pao), pp. 73-100. Ellis Horwood Ltd., Chichester, UK. ISBN 0-85312-431-0.
Ivan Bratko, Matjaž Gams (1982). Error Analysis of the Minimax Principle. Advances in Computer Chess 3
Ivan Bratko, Danny Kopec (1982). A Test for Comparison of Human and Computer Performance in Chess. Advances in Computer Chess 3
Danny Kopec, Ivan Bratko (1982). The Bratko-Kopec experiment: a comparison of human and computer performance in chess. Advances in Computer Chess 3
Danny Kopec, Enrique Irazoqui, Ivan Bratko (1983). The Updated Bratko-Kopec Test. Computer Chess Digest Annual pp. 45-63
Ivan Bratko (1984). Advice and Planning in Chess Endgames. Artificial and Human Thinking (eds. S. Amarel, A. Elithorn and R. Banerji). North-Holland.
Ivan Bratko, Peter Tancig, Simona Tancig (1984). Detection of Positional Patterns in Chess. ICCA Journal, Vol. 7, No. 2 (abridged version)
Ivan Bratko, Peter Tancig, Simona Tancig (1984,1986). Detection of Positional Patterns in Chess. Advances in Computer Chess 4 (full paper)
Ivan Bratko (1985). Symbolic Derivation of Chess Patterns. Progress in Artificial Intelligence (eds. L. Steels and J.A. Campbell), pp. 281-290. Ellis Horwood Ltd., Chichester, UK.
Ivan Bratko (1986, 1990). Game Playing. Prolog Programming for Artificial Intelligence. 2nd Edition 1990. Addison Wesley, Reading, MA. ISBN 0-201-41606-9..
Ivan Bratko, Igor Kononenko (1986). Learning Rules from Incomplete and Noisy Data. Proceedings Unicom Seminar on the Scope of Artificial Intelligence in Statistics. Technical Press
Donald Michie, Ivan Bratko (1987). Ideas on Knowledge Synthesis Stemming from the KBBKN Endgame. ICCA Journal, Vol. 10, No. 1
Donald Michie, Ivan Bratko (1987). Ideas on Knowledge Synthesis ..... a Correction. ICCA Journal, Vol. 10, No. 2
Tim Niblett, Ivan Bratko (1987). Learning decision rules in noisy domains, in Research and Development in Expert Systems III (Max Bramer, ed.), pp. 25-34, Cambridge University Press.

1990 ...

Donald Michie, Ivan Bratko (1991). Comments to `Chunking for Experience'. ICCA Journal, Vol. 14, No. 1
Ryszard Michalski, Ivan Bratko, Miroslav Kubat (eds.) (1998). Machine Learning and Data Mining: Methods and Applications. John Wiley & Sons
Miroslav Kubat, Ivan Bratko, Ryszard Michalski (1998). A Review of Machine Learning Methods. pdf

2000 ...

Ivan Bratko (2001, 2010). Prolog programming for artificial intelligence. Harlow England, Addison Wesley
Mitja Luštrek, Matjaž Gams, Ivan Bratko (2003). A Program for Playing Tarok, ICGA Journal, Vol. 26, No. 3
Aleksander Sadikov, Ivan Bratko, Igor Kononenko (2003). Search versus Knowledge: An Empirical Study of Minimax on KRK. Advances in Computer Games 10, pdf

2005 ...

Mitja Luštrek, Matjaž Gams, Ivan Bratko (2005). Why Minimax Works: An Alternative Explanation. IJCAI 2005
Aleksander Sadikov, Ivan Bratko, Igor Kononenko (2005). Bias and pathology in minimax search. Theoretical Computer Science, Vol. 349, 2, pdf
Matej Guid, Ivan Bratko (2006). Computer Analysis of World Chess Champions. ICGA Journal, Vol. 29, No. 2, pdf ^[11]^[12]
Mitja Luštrek, Matjaž Gams, Ivan Bratko (2006). Is Real-Valued Minimax Pathological? Artificial Intelligence 170. pdf
Matej Guid, Ivan Bratko (2006). Computer Analysis of Chess Champions. CG 2006
Aleksander Sadikov, Martin Možina, Matej Guid, Jana Krivec, Ivan Bratko (2006). Automated Chess Tutor. CG 2006
Aleksander Sadikov, Ivan Bratko (2006). Search Versus Knowledge Revisited Again. CG 2006
Matej Guid, Ivan Bratko (2007). Factors affecting diminishing returns for searching deeper. CGW 2007 » Crafty, Rybka, Shredder, Diminishing Returns
Matej Guid, Ivan Bratko (2007). Factors affecting diminishing returns for searching deeper. ICGA Journal, Vol. 30, No. 2, pdf
Aleksander Sadikov, Ivan Bratko (2007). Solving 20x20 Puzzles. CGW 2007
Matej Guid, Aritz Pérez, Ivan Bratko (2007). How trustworthy is Crafty's analysis of world chess champions? CGW 2007 » Crafty
Matej Guid, Aritz Pérez, Ivan Bratko (2008). How trustworthy is Crafty's analysis of world chess champions? ICGA Journal, Vol. 31, No. 3, pdf
Matej Guid, Martin Možina, Jana Krivec, Aleksander Sadikov, Ivan Bratko (2008). Learning Positional Features for Annotating Chess Games: A Case Study. CG 2008, pdf
Martin Možina, Matej Guid, Jana Krivec, Aleksander Sadikov, Ivan Bratko (2008). Fighting Knowledge Acquisition Bottleneck with Argument Based Machine Learning. 18th European Conference on Artificial Intelligence (ECAI 2008), Patras, Greece. pdf
Jana Krivec, Matej Guid, Ivan Bratko (2009). Identification and Characteristic Descriptions of Procedural Chunks. ComputationWorld conference: Cognitive 2009. pdf

2010 ...

Matej Guid, Martin Možina, Aleksander Sadikov, Ivan Bratko (2010). Deriving Concepts and Strategies from Chess Tablebases. Advances in Computer Games 12, pdf
Dana S. Nau, Mitja Luštrek, Austin Parker, Ivan Bratko, Matjaž Gams (2010). When is it better not to look ahead?. Artificial Intelligence, Vol. 174, No. 16–17, preprint as pdf
Matej Guid, Ivan Bratko (2011). Using Heuristic-Search Based Engines for Estimating Human Skill at Chess. ICGA Journal, Vol. 34, No. 2
Mitja Luštrek, Ivan Bratko, Matjaž Gams (2011). Independent-valued minimax : Pathological or beneficial? Theoretical Computer Science, Vol. 422, pdf
Matej Guid, Ivan Bratko (2012). Detecting Fortresses in Chess. Elektrotehniški vestnik, Vol. 79, Nos. 1-2, pdf » Rybka, Houdini ^[13]
Matej Guid, Ivan Bratko (2013). Search-Based Estimation of Problem Difficulty for Humans. AIED 2013, pdf
Matej Guid, Martin Možina, Ciril Bohak, Aleksander Sadikov, Ivan Bratko (2013). Building an Intelligent Tutoring System for Chess Endgames. CSEDU 2013

2015 ...

Matej Guid, Ivan Bratko (2017). Influence of Search Depth on Position Evaluation. Advances in Computer Games 15

External Links

Professor Ivan Bratko, PhD - FRI
Ivan Bratko's Homepage
Ivan Bratko from Wikipedia
The Mathematics Genealogy Project - Ivan Bratko
Handling noisy data, Videolecture
Evolutionary Portrait Art by Günter Bachelier: Ivan Bratko

References

^ The Kopec Chess Services
^ Sanny: Some test positions for you post in rec.games.chess.misc August 18, 2008
^ Ivan Bratko's Homepage
^ Ivan Bratko's Homepage
^ I remember Donald Michie (1923 – 2007) « A Programmers Place by Maarten van Emden, June 12, 2009
^ Zdenek Zdráhal, Ivan Bratko, Alen Shapiro (1981). Recognition of Complex Patterns Using Cellular Arrays. The Computer Journal, Vol. 24, No. 3, pp. 263-270
^ ICGA Reference Database (pdf)
^ dblp: Ivan Bratko
^ Donald Michie (1976). AL1: a package for generating strategies from tables. ACM SIGART Bulletin, Issue 59
^ Donald Michie (1976). AL1: a package for generating strategies from tables. ACM SIGART Bulletin, Issue 59
^ Computers choose: who was the strongest player?, ChessBase News, October 30, 2006
^ Computer analysis of world champions by Søren Riis, ChessBase News, November 02, 2006
^ Re: Tony's positional test suite by Louis Zulli, CCC, August 01, 2017

What links here?

Page	Date Edited
Advances in Computer Chess 2	Dec 25, 2017
Advances in Computer Chess 3	Jul 23, 2015
Advances in Computer Chess 4	Jan 22, 2018
Advances in Computer Games 10	Dec 30, 2016
Advances in Computer Games 12	Jan 5, 2017
Advances in Computer Games 15	Aug 12, 2017
Aleksander Sadikov	Jan 2, 2017
Alen Shapiro	May 3, 2015
Aritz Pérez	Jan 2, 2017
Artificial Intelligence	Apr 9, 2018
Austin Parker	Apr 25, 2017
Bad bishop	Jun 22, 2015
Bitboards	Nov 14, 2017
Bratko-Kopec Test	Jun 1, 2015
CG 2006	Dec 28, 2016
CG 2008	Jan 3, 2017
CGW 2007	Jan 2, 2017
Chess	Jan 21, 2018
ChessBase	Nov 25, 2017
Chunking	Jun 12, 2017
Cognition	Dec 8, 2017
Computer Chess Reports	May 15, 2016
Crafty	Jan 28, 2018
Dana Nau	Apr 25, 2017
Danny Kopec	Oct 1, 2016
Depth	Feb 25, 2018
Donald Michie	Dec 23, 2017
Endgame	Sep 18, 2017
Endgame Tablebases	Mar 6, 2018
Enrique Irazoqui	Nov 22, 2014
Eye Movements	Jul 22, 2015
Fortress	Feb 1, 2018
Houdini	Apr 14, 2018
ICGA Journal	Dec 21, 2017
Igor Kononenko	May 23, 2016
Ivan Bratko	Aug 16, 2017
Jana Krivec	Jul 15, 2017
KBNK Endgame	Nov 26, 2016
Knowledge	Jul 22, 2017
KRK	Nov 26, 2016
Learning	Feb 20, 2018
Maarten van Emden	May 23, 2016
Martin Možina	Jun 11, 2016
Match Statistics	Mar 31, 2018
Matej Guid	Jan 6, 2018
Mathematician	Apr 9, 2018
Matjaž Gams	May 23, 2016
Michael Bain	Aug 8, 2013
Minimax	Dec 29, 2017
Miroslav Kubat	Jun 16, 2016
Mitja Luštrek	Jan 23, 2016
Pattern Recognition	Sep 8, 2017
People	Feb 28, 2018
Peter Tancig	Nov 7, 2012
Planning	Feb 12, 2018
Playing Strength	Mar 31, 2018
Ruslan Hajiev	Oct 2, 2014
Rybka	Mar 27, 2017
Ryszard Michalski	Jun 16, 2016
Score	Apr 14, 2018
Search Pathology	Nov 26, 2017
Shredder	Jan 21, 2018
Simona Tancig	Nov 7, 2012
Test-Positions	Feb 25, 2018
Tim Niblett	May 22, 2014
University of Edinburgh	Nov 26, 2017
University of Ljubljana	Aug 5, 2015
Zdenek Zdrahal	Apr 4, 2013

Up one level

James R. Slagle

GerdIsenberg — Sat, 12 Aug 2017 16:46:07 GMT

Home * People * James R. Slagle

		James Robert Slagle, (born March 1, 1934) an American mathematician, computer scientist, and since 1984 Distinguished Professor of Computer Science at the University of Minnesota, Minneapolis, with former appointments at Johns Hopkins University, National Institutes of Health, Bethesda, Maryland, Naval Research Laboratory, Lawrence Radiation Laboratory, University of California and Massachusetts Institute of Technology. As Freshman Calculus Student and Ph.D. candidate at MIT, supervised by Marvin Minsky ^[1] in 1961, he wrote his dissertation entitled Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus, Symbolic Automatic Integrator (Saint) ^[2], which is acknowledged as first Expert system ^[3]. His further research interests covers heuristic Theorem-Proving and as application heuristic search. President Dwight D. Eisenhower, in 1959, presented him with five hundred dollars, awarded by Recording for the Blind Inc., for outstanding work as a blind student ^[4].
James R. Slagle ^[5]

Saint

Theorem-Proving

M & N procedure

Saint

Quote by Marvin Minsky on Slagle's Symbolic Automatic Integrator, discussing his book The Emotion Machine ^[6] ^[7]:

Why don't we have artificial intelligence yet? There were some remarkable achievements in very early days of artificial intelligence. This is my favorite one, a young student who happened to be blind named James Slagle wrote a Ph.D. thesis in 1961 that was nearly as good as a good MIT freshman at doing intergroup calculus. Up until then there was no general theory of how to integrate functions. Isaac Newton invented the process but could not solve it. People like Gauss and others spent the next couple of centuries on it. By 1950, there was a great collection called the Bateman Manuscript Project run by the American Mathematical Society and they collected integrals.

Theorem-Proving

Abstract of Experiments With a Multipurpose, Theorem-Proving Heuristic Program. ^[8] from the ACM Portal:

The heuristic program discussed searches for a constructive proof or disproof of a given proposition. It uses a search procedure which efficiently selects the seemingly best proposition to work on next. This program is multipurpose in that the domains it can handle are varied. As an initial experiment, the program was given the task of searching for proofs and disproofs of propositions about Kalah end games. Kalah is a two-person game. In another experiment the program, after some modifications, played the game of Kalah. This program was compared with another tree-searching procedure, the Alpha-Beta minimax procedure; the results have been encouraging since the program is fast and efficient. Its greatest usefulness is in solving large problems. It is hoped that this program has added one more step toward the goal of eventually obtaining computer programs which can solve intellectually difficult problems.

M & N procedure

Abstract of Experiments with the M & N Tree-Searching Program ^[9] from the ACM Portal:

The M & N procedure is an improvement to the mini-max backing-up procedure widely used in computer programs for game-playing and other purposes. It is based on the principle that it is desirable to have many options when making decisions in the face of uncertainty. The mini-max procedure assigns to a MAX (MIN) node the value of the highest (lowest) valued successor to that node. The M & N procedure assigns to a MAX (MIN) node some function of the M (N) highest (lowest) valued successors. An M & N procedure was written in LISP to play the game of Kalah, and it was demonstrated that the M & N procedure is significantly superior to the mini-max procedure. The statistical significance of important conclusions is given. Since information on statistical significance has often been lacking in papers on computer experiments in the artificial intelligence field, these experiments can perhaps serve as a model for future work.

Selected Publications

^[10] ^[11] ^[12] ^[13]

1959

James R. Slagle (1959). Formal integration on a digital computer. 14th national meeting of the Association for Computing Machinery

1960 ...

James R. Slagle (1961). A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus, Symbolic Automatic Integrator (Saint). pdf
James R. Slagle (1963). A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus. Journal of the ACM, Vol. 10, No. 4
James R. Slagle (1963). Game Trees, M & N Minimaxing, and the M & N alpha-beta procedure. Artificial Intelligence Group Report 3, UCRL-4671, University of California
James R. Slagle (1964). An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions. Journal of the ACM, Vol. 11, No. 3
James R. Slagle (1964). On an algorithm for minimum-cost procedures. Communications of the ACM, Vol. 7, No. 11
James R. Slagle (1965). A multipurpose Theorem Proving Heuristic Program that learns. IFIP Congress 65, Vol. 2
James R. Slagle (1965). Experiments with a deductive question-answering program. Communications of the ACM, Vol. 8, No. 12
James R. Slagle (1967). Automatic Theorem Proving With Renamable and Semantic Resolution. Journal of the ACM, Vol. 14, No. 4
James R. Slagle, Philip Bursky (1968). Experiments With a Multipurpose, Theorem-Proving Heuristic Program. Journal of the ACM, Vol. 15, No. 1 ^[14]
James R. Slagle, John K. Dixon (1969). Experiments With Some Programs That Search Game Trees. Journal of the ACM, Vol. 16, No. 2, pdf, pdf
James R. Slagle, Chin-Liang Chang, Richard C. T. Lee (1969). Completeness Theorems for Semantic Resolution In Consequence-Finding. IJCAI-69, pdf

1970 ...

James R. Slagle, Chin-Liang Chang, Richard C. T. Lee (1970). A New Algorithm for Generating Prime Implicants. IEEE Transactions on Computers, Vol. 19, No. 4
James R. Slagle, John K. Dixon (1970). Experiments with the M & N Tree-Searching Program. Communications of the ACM, Vol. 13, No. 3
James R. Slagle (1971). Artificial Intelligence: The Heuristic Programming Approach. McGraw-Hill, New York. amazon
James R. Slagle, Carl D. Farell (1971). Experiments in automatic learning for a multipurpose hueristic program. Communications of the ACM, Vol. 14, No. 2
James R. Slagle, Richard C. T. Lee (1971). Application of game tree searching techniques to sequential pattern recognition. Communications of the ACM, Vol. 14, No. 2
Chin-Liang Chang, James R. Slagle (1979). Using Rewriting Rules for Connection Graphs to Prove Theorems. Artificial Intelligence

1980 ...

James R. Slagle, John K. Dixon (1980). Finding a good figure that approximately passes through given points. Pattern Recognition, 1980
John K. Dixon, Herbert A. Johnson, James R. Slagle (1980). The Prospect of an Under Water Naval Robot. Naval Engineers Journal, Vol. 92, No. 1
John K. Dixon, Susan A. Bouchard, William G. Kennedy, James R. Slagle (1981). MARK I Robot. IJCAI'1981, pdf
James R. Slagle, John K. Dixon (1984). Freedom descriptions: A way to find figures that approximate given points. Pattern Recognition, 1984
Henry Hamburger, James R. Slagle (1986). Heterogeneous discrete expenditure for diminishing returns. Naval Research Logistics Quarterly, Vol. 33, No. 2
Erach A. Irani, John P. Matts, John M. Long, James R. Slagle, POSCH group (1989). Using Artificial Neural Nets for Statistical Discovery: Observations after Using Backpropogation, Expert Systems, and Multiple-Linear Regression on Clinical Trial Data. University of Minnesota, Minneapolis, MN 55455, USA, Complex Systems 3, pdf

1990 ...

Erach A. Irani, James R. Slagle, John M. Long, John P. Matts (1990). Formulating an approach to develop a system for the temporal analysis of clinical trial data: The POSCH AI project. Annals of Mathematics and Artificial Intelligence, Volume 2, Numbers 1-4
James R. Slagle, Zbigniew Wieckowski a.k.a. Bishak (1994). Ideas for Intelligent User Interface Design.

2000 ...

Dean F. Hougen, Maria Gini, James R. Slagle (2000). An Integrated Connectionist Approach to Reinforcement Learning for Robotic Control. ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning

External Links

References

^ Personal page for Marvin Minsky
^ The Mathematics Genealogy Project - James Robert Slagle
^ SAINT (Inventions) - what-when-how (states James R. Slagle died in 1994)
^ Education: Their Best, Time, June 01, 1959
^ Jet, January 22, 1970, pp 21
^ Terasem Journal of Personal Cyberconsciousness - Marvin Lee Minsky discussing his book, The Emotion Machine
^ Marvin Minsky's Home Page
^ James R. Slagle, Philip Bursky (1968). Experiments With a Multipurpose, Theorem-Proving Heuristic Program. Journal of the ACM, Vol. 15, No. 1
^ James R. Slagle, John K. Dixon (1970). Experiments with the M & N Tree-Searching Program. Communications of the ACM, Vol. 13, No. 3
^ JACM Authors - James R. Slagle
^ ICGA Reference Database (pdf)
^ dblp: James R. Slagle
^ Bibliography for Artificial Intelligence: A Modern Approach
^ Cooper: Review: James R. Slagle, Philip Bursky, Experiments with a Multipurpose, Theorem-Proving Heuristic Program

What links here?

Page	Date Edited
cadre17 : home	Dec 9, 2011
Alpha-Beta	Jan 28, 2018
Artificial Intelligence	Apr 9, 2018
Chin-Liang Chang	May 23, 2016
Chunking	Jun 12, 2017
Gary Boos	Apr 10, 2013
Horizon Effect	Sep 10, 2017
James Mundstock	Apr 10, 2013
James R. Slagle	Aug 12, 2017
John K. Dixon	May 23, 2016
Kalah	Dec 22, 2016
Lawrence Livermore National Laboratory	Feb 7, 2017
Learning	Feb 20, 2018
Massachusetts Institute of Technology	Jan 24, 2017
Mathematician	Apr 9, 2018
Minimax	Dec 29, 2017
Mr. Turk	Feb 21, 2015
Neural Networks	Mar 12, 2018
Pattern Recognition	Sep 8, 2017
People	Feb 28, 2018
Philip Bursky	Jun 5, 2011
Proof-number search	Jan 22, 2018
Reinforcement Learning	Feb 12, 2018
Richard C. T. Lee	May 13, 2015
Robots	Feb 20, 2018
Search	Feb 1, 2018
User Interface	Feb 21, 2018

Up one level

John K. Dixon

GerdIsenberg — Mon, 23 May 2016 10:21:20 GMT

Home * People * John K. Dixon

		John Kent Dixon, (born September 1, 1934 ^[1]) an American electrical engineer, mathematician, physicist and computer scientist. He graduated with BSEE degree from Lawrence Institute of Technology in 1957, and worked as an electrical engineer on military projects at Chrysler Missile and Bendix Research in Detroit. While working, he earned an MBA in 1964 and a MA in mathematics in 1965 at Wayne State University. In 1965 he moved away to study at the University of California at Livermore, where he worked with James R. Slagle on Theorem-Proving and the M & N search algorithm. He received the MS in physics in 1966 and a Ph.D. in computer science in 1970. He moved to the Washington, D.C. area and worked as a computer scientist doing research in the field of artificial intelligence at the Naval Research Laboratory and various business companies.
Bruce and John Kent Dixon ^[2]

Selected Publications

^[3] ^[4]

James R. Slagle and John K. Dixon (1969). Experiments With Some Programs That Search Game Trees. Journal of the ACM, Vol. 16, No. 2, pdf, pdf
James R. Slagle and John K. Dixon (1970). Experiments with the M & N Tree-Searching Program. Communications of the ACM, Vol. 13, No. 3
John K. Dixon (1970). An improved method for solving deductive problems on a computer by compiled axioms. Doctoral Dissertation
John K. Dixon (1973). Z-Resolution: Theorem-Proving with Compiled Axioms. Journal of the ACM, Vol. 20, No. 1
Chin-Liang Chang, Richard C. T. Lee, John K. Dixon (1973). The Specialization of Programs by Theorem Proving. SIAM Journal on Computing, Vol 2, No. 1
James R. Slagle, John K. Dixon (1980). Finding a good figure that approximately passes through given points. Pattern Recognition, 1980
John K. Dixon, Herbert A. Johnson and James R. Slagle (1980). The Prospect of an Under Water Naval Robot. Naval Engineers Journal, Vol. 92, No. 1
John K. Dixon, Susan A. Bouchard, William G. Kennedy, James R. Slagle (1981). MARK I Robot. IJCAI'1981, pdf
James R. Slagle, John K. Dixon (1984). Freedom descriptions: A way to find figures that approximate given points. Pattern Recognition, 1984

External Links

19. Epilog - Whatever happened to ...? The Third Generation - John Kent Dixon from Dixon Family Page

References

What links here?

Page	Date Edited
Alpha-Beta	Jan 28, 2018
Chin-Liang Chang	May 23, 2016
James R. Slagle	Aug 12, 2017
John K. Dixon	May 23, 2016
Kalah	Dec 22, 2016
Lawrence Livermore National Laboratory	Feb 7, 2017
Minimax	Dec 29, 2017
People	Feb 28, 2018
Richard C. T. Lee	May 13, 2015
Robots	Feb 20, 2018
Search	Feb 1, 2018

Up one level

Konstantin Kosteniuk

GerdIsenberg — Sun, 04 Dec 2016 16:31:22 GMT

Home * People * Konstantin Kosteniuk

		Konstantin Kosteniuk, (Russian: Константин Костенюк) ^[1] a Russian chess master, and father and coach of Alexandra Kosteniuk, Women's World Chess Champion from 2008 until 2010. Konstantin Kosteniuk is involved in designing an industrial robot ^[2] to play chess, dubbed The Chess Terminator and later ChessKA ^[3] ^[4], able to play against three opponents simultaneously. At the opening ceremony of the The 60th Russian Women's Championship in Moscow ^[5] , November, 2010, The Chess Terminator drew a blitz game against Vladimir Kramnik, demonstrating its ability to move lightning fast and to press the clock. Terminator does not really "see" the board, but has a sensory board to recognize the pieces. Therefor Terminator was not (yet) able to shake Kramnik's hand when he offered a draw ^[6] . The controlling PC may run any chess program using standard protocols like UCI.
Konstantin Kosteniuk ^[7]

External Links

Grandmaster Alexandra Kosteniuk was a guest of honor at the 57th Russian Chess Superfinals in Moscow, November 2004
Russian presidential aide to play chess with robot, Sports, RIA Novosti, June 08, 2010
World’s first chess-playing robot defeats its creator from RIA Novosti
Chess grand masters outsmart robot from The Voice of Russia, June 10, 2010
I Robot – at Russian Women's Chess Championship, ChessBase News, November 17, 2010
Terminator (character concept) from Wikipedia
World Chess Blitz Championship among Chess Robots - ChessKA versus KUKA Monster from chessblog.com - Alexandra Kosteniuk's Chess Blog, May 2012

References

^ Due to different, but equally valid ways of transliterating Cyrillic, also Konstantin Kostenyuk
^ Russia-InfoCentre : First Russian Industrial Robot Presented
^ World Chess Blitz Championship among Chess Robots - ChessKA versus KUKA Monster from chessblog.com - Alexandra Kosteniuk's Chess Blog, May 2012
^ Robot Blitz Chess! CHESSka vs. KUKA Monster - Game One by Steve Lopez, Chess King, May 25, 2012
^ Alisa Galliamova wins Russian Women's Superfinal ChessBase News, November 28, 2010
^ Physics Inventions » Chess Terminator – Robotic Hand that Rivals Ex-World Champ Kramnik, posted February 5, 2011
^ World’s first chess-playing robot defeats its creator from RIA Novosti

What links here?

Page	Date Edited
Chess King	Dec 4, 2016
Konstantin Kosteniuk	Dec 4, 2016
People	Feb 28, 2018
Robots	Feb 20, 2018
Steve Lopez	Dec 4, 2016

Up one level

Manuela Veloso

GerdIsenberg — Wed, 05 Aug 2015 08:41:40 GMT

Home * People * Manuela Veloso

		Manuela Maria Veloso, a Portuguese American electrical engineer, computer scientist, Herbert A. Simon professor at School of Computer Science, Carnegie Mellon University, president of the AAAI from 2012 until 2014, and past president of the International RoboCup Federation. She received her M.Sc. in electrical engineering from the Instituto Superior Técnico in Lisbon in 1984, and her Ph.D. in CS from Carnegie Mellon with the thesis Learning by Analogical Reasoning in General Purpose Problem Solving under advisor Jaime Carbonell in 1992. Her multi-agent and multi-robot research interests have been motivated by and experimented in the domain of robot soccer - her long-term research goal is the effective construction of autonomous agents where cognition, perception, and action are combined to address planning, execution, and learning tasks ^[1].
Manuela M. Veloso ^[2]

Selected Publications

^[3]

1990 ...

Manuela M. Veloso (1992). Learning by Analogical Reasoning in General Purpose Problem Solving. Ph.D. thesis, Carnegie Mellon University, advisor Jaime Carbonell
Peter Stone, Manuela M. Veloso (1995). Beating a Defender in Robotic Soccer: Memory-Based Learning of a Continuous Function. NIPS 1995
Manuela Veloso, Agnar Aamodt (eds.) (1995). Case-Based Reasoning Research and Development. Lecture Notes in Computer Science, Vol. 1010, Springer
William Uther, Manuela M. Veloso (1997). Adversarial Reinforcement Learning. Carnegie Mellon University, ps
William Uther, Manuela M. Veloso (1997). Generalizing Adversarial Reinforcement Learning. Carnegie Mellon University, ps

2000 ...

Michael Bowling, Manuela M. Veloso (2001). Rational and Convergent Learning in Stochastic Games. IJCAI 2001
Michael Bowling, Manuela M. Veloso (2003). Simultaneous Adversarial Multi-Robot Learning. IJCAI 2003
Juan Fasola, Manuela M. Veloso (2006). Real-time Object Detection using Segmented and Grayscale Images. ICRA 2006
Colin McMillen, Manuela M. Veloso (2007). Thresholded Rewards: Acting Optimally in Timed, Zero-Sum Games. AAAI 2007, pdf

2010 ...

Michael Bowling, Manuela M. Veloso (2011). Existence of Multiagent Equilibria with Limited Agents. CoRR, July 2011

External Links

References

^ Manuela Veloso - Mechanical Engineering - Carnegie Mellon University
^ Manuela Veloso speaking at the Turing centennial conference at Manchester Town Hall, Photo by David.Monniaux, June 24, 2012, Manuela M. Veloso from Wikipedia
^ dblp: Manuela M. Veloso

What links here?

Page	Date Edited
AAAI	Mar 21, 2017
Carnegie Mellon University	Feb 12, 2018
Chunking	Jun 12, 2017
Learning	Feb 20, 2018
Manuela Veloso	Aug 5, 2015
Mathematician	Apr 9, 2018
Michael Bowling	Feb 20, 2018
People	Feb 28, 2018
Reinforcement Learning	Feb 12, 2018
Robots	Feb 20, 2018
William Uther	Aug 7, 2015

Up one level

Michael Hartisch

GerdIsenberg — Fri, 11 Aug 2017 16:27:12 GMT

Home * People * Michael Hartisch

		Michael Hartisch, a German computer scientist, and scientific staff at department of technology management, faculty of business administration, University of Siegen, headed by Ulf Lorenz ^[1]. In 2015, Michael Hartisch solved the game Karl’s Race by using retrograde analysis ^[2]. Karl’s Race is a game of chance invented by Ingo Althöfer in 2006 as "little brother" of EinStein würfelt nicht!, and in honor of Karl Scherer ^[3] ^[4]. Further, along with Ingo Althöfer, Michael Hartisch introduced chess endgame tablebases, as usual constructed by retrograde analysis, but not optimized for shortest mate, but shortest time used by robots to execute moves and specially captures in blitz chess matches like KUKA vs. ChessKA ^[5].
Michael Hartisch ^[6]

Impact of Rounding

Abstract

Conclusion

Impact of Rounding

Excerpts of Impact of Rounding during Retrograde Analysis ... ^[7]:

Abstract

We investigate the game “Karl’s Race” which has elements of chance and is closely related to “Ein-Stein Würfelt Nicht!”. Its state space is significantly smaller, without losing its fascination and complex nature. This game can be analysed completely by using retrograde analysis and thus creates an excellent testing ground for other heuristics dealing with games with chance nodes. Since analysing games with chance nodes requires saving expected values, and thus rational numbers, an enormous amount of memory is required during the calculation and when saving the exact data. Therefore, we examine the effect of intentional rounding during the retrograde analysis. We find that certain types of rounding only slightly affect the playing strength of players using these data while reducing the required memory space to 25 percent.

Conclusion

We solved the game Karl’s Race by using retrograde analysis. The complex game tree and the large maximum length of the game make Karl’s Race a perfect test bed for heuristics, since their performance can be compared to the actual perfect player. Especially when investigating the functionality of the heuristics such as MCTS and UCT we need interesting games that constitute a challenge, but are sufficiently small to be kept under control. The presented game has these properties and is a two-person zero-sum game with random events. We further investigated how intentional rounding during the retrograde analysis affects the playing strength of the player using these inaccurate data. Rounding to two or three digits turned out to lessen the strength only slightly: Winning rates were still very close to 50%. Rounding to one digit reduced this quota to 45% or even less when using inadequate rounding techniques. Especially the results for rounding to two digits are appreciable: Using rounded 2-digit values during the retrograde analysis allow us to store only one byte per position during the calculation as well as afterwards when saving the data. This is a reduction of 75% compared to saving four bytes per position when using float variables.

Selected Publications

Ingo Althöfer, Michael Hartisch (2015). The Effect of Biasing Win Conditions. Game & Puzzle Design, Vol. 1, No. 1
Michael Hartisch (2015). Impact of Rounding during Retrograde Analysis for a Game with Chance Nodes: Karl’s Race as a Test Case. ICGA Journal, Vol. 38, No. 2
Michael Hartisch, Ingo Althöfer (2015). Optimal Robot Play in Certain Chess Endgame Situations. ICGA Journal, Vol. 38, No. 3
Michael Hartisch, Thorsten Ederer, Ulf Lorenz, Jan Wolf (2016). Quantified Integer Programs with Polyhedral Uncertainty Set. CG 2016
Michael Hartisch (2017). Yasol: An Open Source Solver for Quantified Mixed Integer Programs. Advances in Computer Games 15

External Links

Michael Hartisch | Uni-Siegen

References

^ Lehrstuhlteam | Betriebswirtschaftslehre (Prof. Dr. Ulf Lorenz)
^ Michael Hartisch (2015). Impact of Rounding during Retrograde Analysis for a Game with Chance Nodes: Karl’s Race as a Test Case. ICGA Journal, Vol. 38, No. 2
^ Karl's Race A Game on Karl Scherer's Alternating Tiling by Ingo Althöfer, 2006
^ Square The Square by Karl Scherer
^ Michael Hartisch, Ingo Althöfer (2015). Optimal Robot Play in Certain Chess Endgame Situations. ICGA Journal, Vol. 38, No. 3
^ Michael Hartisch | Uni-Siegen
^ Michael Hartisch (2015). Impact of Rounding during Retrograde Analysis for a Game with Chance Nodes: Karl’s Race as a Test Case. ICGA Journal, Vol. 38, No. 2

What links here?

Page	Date Edited
Advances in Computer Games 15	Aug 12, 2017
CG 2016	Dec 18, 2017
EinStein würfelt nicht!	Aug 11, 2017
Endgame	Sep 18, 2017
Endgame Tablebases	Mar 6, 2018
Games	Feb 20, 2018
ICGA Journal	Dec 21, 2017
Ingo Althöfer	May 4, 2017
Jan Wolf	Jul 8, 2016
Michael Hartisch	Aug 11, 2017
People	Feb 28, 2018
Retrograde Analysis	Mar 21, 2017
Robots	Feb 20, 2018
Thorsten Ederer	Jul 8, 2016
Ulf Lorenz	Dec 22, 2016

Up one level

Milton Bradley Phantom

GerdIsenberg — Mon, 18 Apr 2016 18:34:33 GMT

Home * Engines * Milton Bradley Phantom

		Milton Bradley Phantom, a robot type dedicated chess computer by Milton Bradley International Inc., sold as MB Grandmaster on the American market, the Milton in Germany, The Netherlands and France, and the Phantom in the UK. It has a X-Y plotter type actuator with drive belts which pull a solenoid up and down two metal rods in the x and y axes, able to pick up individual magnetic, and therefor recognizable pieces, and to move them over a touch sensory board. The chess program and the software to control the electromagnetic system which moved the pieces was developed by Intelligent Software. According to Schachcomputer.info Wiki, the 6502 16KiB program was written by Mark Taylor, and was similar to the program of the Chess Champion Mark V ^[1]. The Milton Bradleys were in production before the end of 1982 and in the shops early in 1983 ^[2]. Still in the 80's, Fidelity Electronics bought the rights on the Phantom ^[3] and released a follow up model with a program by Dan and Kathe Spracklen, the Fidelity Phantom ^[4].
MB Phantom Box ^[5]

Milton Bradley Phantom

Publications

Tony Harrington (1983). Phantom Moves. Personal Computer World, July 1983, pdf

Forum Posts

Dedicated chess computers : Milton Bradley Robot by Vincent Lejeune, CCC, November 08, 2012
Question regarding Milton Bradley Phantom by Larry, Hiarcs Forum, November 18, 2013

External Links

Milton Bradley Phantom

Milton Bradley Phantom from Chess Computer UK by Mike Watters
Patents from Chess Computer UK by Mike Watters
Ismenio's chess computer collection - MB Phantom Chess Computer
Ismenio's chess computer collection - MB Grandmaster
Phantom Chess by Bill Buxton, April 2011
Milton Bradley from Schachcomputer.info Wiki (German)
Schachroboter from Kurt´s Schachcomputer Homepage by Kurt Kispert (German)
1983 Milton Bradley Phantom - Automated Chess Computer Setting Up, YouTube Video

Milton Bradley

Phantom

References

^ Milton Bradley from Schachcomputer.info Wiki (German)
^ Milton Bradley Phantom from Chess Computer UK by Mike Watters
^ Ismenio's chess computer collection - MB Phantom Chess Computer
^ Fidelity Phantom from Schachcomputer.info Wiki (German)
^ Flickr - Fotosharing | Robots by Chewbanta

What links here?

Page	Date Edited
Chess Champion Mark V	Sep 7, 2017
Engines	Mar 10, 2018
Fidelity Phantom	Dec 1, 2017
Intelligent Software	Dec 11, 2012
Mark Taylor	Jan 7, 2016
Milton Bradley	Jun 30, 2013
Milton Bradley Phantom	Apr 18, 2016
Personal Computer World	Apr 12, 2013
Robot Adversary	Mar 14, 2015
Robots	Feb 20, 2018
Tony Harrington	Sep 26, 2014

Up one level

Nicolas Jouandeau

GerdIsenberg — Thu, 29 Jun 2017 13:19:33 GMT

Home * People * Nicolas Jouandeau

		Nicolas Jouandeau, a French computer scientist and Maitre de conférences (Assistent Professor) at Department Micro Informatique Machines Embarquées (MIME) ^[1] at Paris 8 University, LIASD ^[2] . His research interests include Motion Planning, Parallel Tree Search, Reinforcement Learning, and RoboCup. Along with Tristan Cazenave, Nicolas Jouandeau is co-author of the Go program GoLois, three times Gold Medal winner in Phantom Go ^[3] at Computer Olympiads.
Nicolas Jouandeau ^[4]