Wikispaces : chessprogramming - items matching description

8x8 Board

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

Home * Board Representation * Mailbox * 8x8 Board

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

Alternatives

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

Publications

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

Forum Posts

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

External Links

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

References

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

What links here?

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

Up one Level

Chess

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

Home * Chess

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

Board and Squares

Pieces and Moves

Color and Side

The Game of Chess

During the Game

The End

Chess Variants

Chess Problems

Chess and Mathematics

Chess Maxima

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

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

Chess and Psychology

Chess and Philosophy

Quote from Philosophy Looks at Chess ^[13] :

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

Chess Programs called Chess

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

Publications

1949

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

1950 ...

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

1955 ...

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

1960 ...

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

1965 ...

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

1970 ...

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

1975 ...

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

1980 ...

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

1985 ...

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

1990 ...

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

1995 ...

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

2000 ...

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

2005 ...

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

2010 ...

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

2015 ...

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

Forum Posts

1989

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

1990 ...

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

2000 ...

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

2010 ...

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

2014

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

2015 ...

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

2016

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

2017

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

2018

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

External Links

Wikipedia

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

Chess

Chess Variants

Misc

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

References

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

Up one Level

Chess Position

GerdIsenberg — Sun, 10 Sep 2017 16:57:20 GMT

Home * Chess * Position

		The Chess Position describes how pieces are placed on the chessboard, as printed as chess diagram, image or photograph from a game of chess. In 1996 Shirish Chinchalkar determined 1046 as upper bound for the number of reachable chess positions ^[1]. The maximum number of moves per chess position seems 218 ^[2]. Of course, the information of any arbitrary chess position which occurs inside the game of chess, might be determined from a certain initial starting position and a sequence of moves (half-moves), which leads to this position. Anyway, an efficient data structure for a chess position, which is incrementally updated during game play and search is essential for a chess playing program.
Marcel Duchamp ^[3] ^[4]

Specifying a Chess Position

Summary

Positions inside the Search

Positions

Notations

Flipping and Mirroring

Specifying a Chess Position

Except the determination of three fold repetitions, which requires the whole move record, at least from the last irreversible move (half-move) played, the chess position should keep track of various informations related to the position also for efficiency reasons. Another issue is to make chess positions persistent with a maximum of information required, but without the whole game history, as specified by the Forsyth-Edwards Notation or Extended Position Description.

Beside piece placement, as considered by the board representation, the side to move is essential, which might take only one bit inside an appropriate data structure for a chess position. Additionally, the Castling ability for both sides, as reflected by the castling rights and a possible en passant target square (or file) is needed to further completely specify the position, as well as the halfmove clock to cover the fifty-move rule.

Summary

A chess positions consists of

Piece placement on the Chessboard as considered by the Board Representation
Side to move
Castling rights
En passant target square
Halfmove Clock

Positions inside the Search

In the context of Search, a position is the node inside a search tree. To completely determine the position with respect to repetitions, one additionally needs a move list or any other appropriate data structure, to keep up to 100 reversible half-moves, likely associated with Zobrist keys of the intermediate positions.

Positions

Notations

Extended Position Description (EPD)
Forsyth-Edwards Notation (FEN)
Forsyth-Edwards Expanded Notation (FEEN)

Flipping and Mirroring

Publications

Jürg Nievergelt (1977). Information content of chess positions. ACM SIGART Newsletter 62, pp. 13-14. Reprinted as: Information content of chess positions: Implications for game-specific knowledge of chess players, pp. 283-289. Machine Intelligence 12 (eds. Jean Hayes Michie, Donald Michie, E. Tyugu). Clarendon Press, Oxford, 1991. ISBN 0-19-853823-5.
Bernhard Balkenhol (1994). Data Compression in Encoding Chess Positions. ICCA Journal, Vol. 17, No. 3, zipped ps
Shirish Chinchalkar (1996). An Upper Bound for the Number of Reachable Positions. ICCA Journal, Vol. 19, No. 3
Alex de Voogt (2002). Reproducing board game positions: Western Chess and African Bao. Swiss Journal of Psychology, Vol 61, No. 4

Forum Posts

1980 ...

compact representation of a position by Bill Vaughan, net.chess, January 5, 1982
compact representation of chess positions by Tom Truscott, net.chess, January 7, 1982 » Zobrist Hashing ^[5]

1990 ...

entropy of chess positions by John Tromp, rgc, April 15, 1991
estimated number of chesspositions by Vincent Diepeveen, rgcc, October 27, 1995
number of moves in position by Leonid, CCC, September 19, 1999
Re: number of moves in position by Leonid, CCC, September 21, 1999

2000 ...

Min # of bits needed to store a chess position by James Robertson, CCC, April 20, 2000
Minimum bits to encode a chess position by Ken Payson, The Math Forum @ Drexel University, February 8, 2002
Making positions in eps by Renze Steenhuisen, CCC, October 27, 2003 » Fen2eps

2010 ...

allowing invalid positions by Eric Langedijk, CCC, August 13, 2013
Counting endgame positions by Kirill Kryukov, CCC, January 08, 2014 ^[6]
Total possible chess positions? by Matthew R. Brades, CCC, March 26, 2014 » Chess Maxima

2015 ...

Binary FEN by J. Wesley Cleveland, CCC, July 24, 2015
Max moves in a position by Laurie Tunnicliffe, CCC, October 22, 2016 » Chess Maxima, Move List

External Links

Programmer Puzzle: Encoding a chess board state throughout a game from Stack Overflow
Chess Position Trainer by Stefan Renzewitz and Gregory Prentice
NULP in chess endgames by Kirill Kryukov

References

^ Shirish Chinchalkar (1996). An Upper Bound for the Number of Reachable Positions. ICCA Journal, Vol. 19, No. 3
^ Subject: Maximum Number of Legal Moves by Andrew Shapira, CCC, May 08, 2005
^ Marcel Duchamp: The Art of Chess
^ Marcel Duchamp: Chess Master Saint Louis University Museum of Art Saint Louis University : SLU
^ Re: Hashing function for board positions post 4 by Jim Gillogly, rgcc, May 12, 1997
^ NULP in chess endgames by Kirill Kryukov

What links here?

Page	Date Edited
2D Graphics Board	Sep 23, 2017
3D Graphics Board	Sep 23, 2017
Acornsoft Chess	Dec 11, 2016
AlphaZero	Feb 10, 2018
Analog Evaluation	Oct 27, 2017
Arminius	Aug 5, 2017
Atom Chess	Dec 11, 2016
B*	Nov 27, 2017
BCH Hashing	May 8, 2017
Bernhard Balkenhol	Oct 26, 2013
Beta-Cutoff	Oct 22, 2017
Bitboard Board-Definition	Jun 23, 2014
Board Representation	Dec 11, 2017
Bookbuilder	Feb 4, 2018
Bookup	Feb 4, 2018
Brainfish	Oct 8, 2017
Branching Factor	Jun 28, 2017
CAPS	Dec 23, 2017
Castling	May 5, 2017
Castling rights	Jan 7, 2017
CHEOPS	Apr 18, 2015
Cheops (Miller)	Jan 13, 2017
Chess	Jan 21, 2018
Chess Game	Mar 28, 2017
Chess Position	Sep 10, 2017
Chessboard	May 10, 2017
ChessBrain	Jun 28, 2017
ChessV	Jan 21, 2018
ChessX	Feb 26, 2015
Chunker	Jul 12, 2016
Chunking	Jun 12, 2017
Color	Mar 12, 2014
Color Flipping	May 17, 2017
Combination	Oct 25, 2016
Copy-Make	May 23, 2017
CTG	Aug 22, 2016
Dabbaba	Oct 21, 2014
Data	Nov 26, 2017
Databases	Mar 18, 2018
Deep Learning	Feb 12, 2018
Diagonal Mirroring	Jun 29, 2013
Doch	May 23, 2017
Dragan Zdravkovic	Nov 29, 2013
Dragon FR	Sep 9, 2016
Dynamic Programming	Feb 11, 2018
Dynamic Tree Splitting	Apr 10, 2017
Edwards' Tablebases	Sep 26, 2016
Efficient Generation of Sliding Piece Attacks	Nov 5, 2016
En passant	Jan 16, 2018
Eval Tuning in Deep Thought	Jun 7, 2016
Evaluation	Feb 1, 2018
Extended Position Description	Dec 2, 2017
Eye Movements	Jul 22, 2015
Fail-High Reductions	Mar 6, 2014
Ferdinand Mosca	Jul 28, 2017
Forsyth-Edwards Expanded Notation	Aug 31, 2015
Forsyth-Edwards Notation	Sep 10, 2017
George Baylor	Sep 22, 2014
Gerard Zielinski	Sep 25, 2014
Graph History Interaction	Oct 16, 2017
Graphics Programming	Dec 22, 2017
Grit Lachmann	Apr 26, 2014
Halfmove Clock	Aug 9, 2017
Horizontal Mirroring	Jun 29, 2013
Hypra-Chess	Oct 28, 2017
Incremental Updates	Sep 6, 2017
Initial Position	Apr 14, 2018
Irreversible Moves	Jan 25, 2014
Iteration	May 5, 2017
Jacques Pitrat	Aug 7, 2015
James Robertson	Jun 5, 2016
Jan Renze Steenhuisen	Sep 10, 2017
Jerry	Mar 28, 2016
John Tromp	Jan 6, 2017
Kvetka	Mar 28, 2016
LittleBlitzer	Jan 24, 2017
Lozza	Apr 18, 2018
Make Move	Mar 2, 2016
MAPP	Jan 30, 2016
Mater	Apr 26, 2016
Move List	Jul 19, 2017
Moves	Feb 19, 2018
Much	Jun 7, 2016
MVC to include	May 7, 2011
Neural MoveMap Heuristic	Sep 24, 2015
Neural Networks	Mar 12, 2018
Node	Jul 20, 2015
Nodes per second	Feb 28, 2018
Occam	Jan 21, 2016
Papa	Jan 11, 2018
Paradise	Nov 19, 2014
Path-Dependency	Oct 16, 2017
Pattern Recognition	Sep 8, 2017
Pawn Push	Mar 27, 2010
Persistent Hash Table	Dec 31, 2017
Piece Recognition	Sep 8, 2017
Programming	Dec 16, 2017
Pseudo-Legal Move	May 23, 2015
Quiescence Search	Aug 19, 2017
Repetitions	Jan 16, 2018
RetroChess	Feb 2, 2014
Retrograde Analysis	Mar 21, 2017
Reversible Moves	Mar 13, 2010
Richard Lang	Jan 7, 2016
Robert A. Wagner	Oct 28, 2013
Root	Sep 26, 2016
Ruslan Hajiev	Oct 2, 2014
Scid	Apr 15, 2017
Scid on the Go	Jan 26, 2015
Score	Apr 14, 2018
Search	Feb 1, 2018
Search Explosion	Mar 30, 2017
Search Tree	Dec 23, 2016
Sensory Board	Mar 1, 2018
SEX Algorithm	Nov 25, 2014
Shirish Chinchalkar	Mar 26, 2014
Shu Yokoyama	Oct 25, 2017
Side to move	Oct 29, 2017
Simona Tancig	Nov 7, 2012
Stockfish	Apr 7, 2018
Symbolic	May 8, 2017
Tactics	Jan 12, 2018
Temporal Difference Learning	Feb 20, 2018
Texel's Tuning Method	Dec 2, 2017
Transposition	Jun 8, 2015
Transposition Table	Apr 19, 2018
Turochamp	Dec 14, 2017
Unmake Move	Jun 10, 2017
User Interface	Feb 21, 2018
Vertical Flipping	Oct 10, 2013
Vincent David	Oct 20, 2016
William Chase	Jan 21, 2016
Winglet to include	Apr 25, 2015
Winter	Jan 23, 2018
Zobrist Hashing	Jan 22, 2018

Up one Level

Chessboard

GerdIsenberg — Wed, 10 May 2017 14:37:12 GMT

Home * Chess * Chessboard

		The Chessboard is the playing ground for the game of chess and its up to 16 white and black pieces each. It consists of 64 squares, eight rows, called ranks, times eight columns, called files. The squares are alternating dichromatic (light or white, and dark or black squares) on ranks as well on files. Ranks are labeled from '1' to '8', the files from 'A' to 'H' (or with lower case letters 'a' to 'h'), so that each square can be uniquely addressed via concatenated file- and rank labels. The lower left square with the "Address" 'a1' is dark. The diagonals are the north-east directed, distinguished from the anti-diagonals in north-east directions. Inside a chess program, the chessboard and its piece placement as chess position is subject of the board representation.
Marcel Duchamp, Homage to Caissa, 1965 ^[1]

Fourfold Symmetry

The chessboard is fourfold symmetrical with respect to rotation about an axis, based on the reflection symmetry of a square (not square of a chessboard but the whole board here). The four axis are the vertical line between the two center-files 'D' and 'E', the horizontal line between the 4th and 5th rank, and the main-diagonal and main-anti-diagonal. The orthogonal symmetrical squares have different, the diagonal symmetrical squares have same square-colors.

Publications

Martin Gardner (1973). Mathematical Games: How to Turn a Chessboard into a Computer to Calculate with Negabinary Numbers. Scientific American, Vol. 228, No. 4 ^[2]
Joachim H. Ahrens (1981). Paving the Chessboard. Journal of Combinatorial Theory, Series A, Vol. 31, No. 3
Noam Elkies (2002). Higher Numbers in pawn endgames on large chessboards. More Games of No Chance edited by Richard J. Nowakowski

External Links

Chessboard from Wikipedia
Wheat and chessboard problem
A Mathematical Chessboard Paradox by Christian Hesse, ChessBase News, March 24, 2009

References

What links here?

Page	Date Edited
2D Graphics Board	Sep 23, 2017
3D Graphics Board	Sep 23, 2017
Anti-Diagonals	Sep 2, 2012
Bit	Oct 29, 2012
Bitboards	Nov 14, 2017
Board Representation	Dec 11, 2017
Breakthrough (Game)	Aug 11, 2017
Captures	Oct 1, 2017
Center	Jun 21, 2016
Chess	Jan 21, 2018
Chess Position	Sep 10, 2017
Chessboard	May 10, 2017
ChessX	Feb 26, 2015
Combinatorial Logic	Apr 6, 2017
Complexity to include	Jun 16, 2011
Connectivity	Mar 6, 2016
Dedicated Chess Computers	Feb 20, 2018
Delfi	Jan 7, 2016
Diagonals	Jan 16, 2013
Dictionary	Aug 24, 2017
Direction	Oct 6, 2016
Distance	Sep 25, 2015
Djinn	Feb 8, 2016
Dumb7Fill	May 27, 2016
Edwards' Tablebases	Sep 26, 2016
Efficient Generation of Sliding Piece Attacks	Nov 5, 2016
Encoding Moves	Mar 27, 2016
Endianness	Jan 25, 2015
Files	Nov 22, 2015
Flipping Mirroring and Rotating	Oct 14, 2016
Glaurung	Mar 14, 2017
GUI	Mar 16, 2018
HeavyChess	Feb 14, 2014
Influence Quantity of Pieces	Jul 21, 2017
Lines of Action	Feb 5, 2018
Mobility	Jan 17, 2018
Nexus	Jan 7, 2016
Perceiver	Nov 21, 2017
Pertti Saariluoma	Jun 13, 2017
Piece Recognition	Sep 8, 2017
Piece-Lists	Feb 13, 2017
Pseudo-Legal Move	May 23, 2015
Ranks	Dec 15, 2008
Raspberry Turk	Sep 7, 2017
Repetitions	Jan 16, 2018
Sensory Board	Mar 1, 2018
Sjaak (Glebbeek)	Oct 4, 2017
Smirf	Apr 10, 2016
Square Mapping Considerations	Feb 28, 2018
Squares	Feb 15, 2015
Thompson's Databases	Dec 24, 2014
Vector Attacks	Dec 15, 2017
Winter	Jan 23, 2018

Up one Level

Corresponding Squares

GerdIsenberg — Mon, 09 Oct 2017 19:01:00 GMT

Theory

Finding Critical Squares

Constructing Corresponding Square System

Using the Corresponding Square System

Computer Chess Implementation

Algorithm by Moshammer

Home * Evaluation * Game Phases * Endgame * Pawn Endgame * Corresponding Squares

Corresponding Squares, also called Co-ordinate Squares is a concept to analyze pawn endgames. Using retrograde analysis, Zugzwang positions and Critical Squares are found. Corresponding Squares Systems were one of the first human attempts of finding formulas and finally solving certain chess positions. This concept is only possible due to the limited mobility in pawn endgames. King-oppositions and Zugzwangs are the main motives arising.

Theory

To get an idea, the concept is described using an example position by Charles Dealtry Lockock, 1892 ^[1] :

Finding Critical Squares

In the presented position there exist two critical squares. First when the white king reaches d4, white threatens 1. e5 dxe5 2. Kxe5 (threatening attacking both Pd7 and Pg4 in the next move). To defend this threat the black king must be able to move to f6 after Kd4. Secondly when the white king reaches e3, white threatens 1. Kf4 ... 2. Kxg4. In order to avoid this the black king must stand on g5.

To summarize, the two critical squares are e5 and f4. The according corresponding squares where both sides have mutual zugzwang are Kd4 - Kf6 and Ke3 - Kg5.

Constructing Corresponding Square System

This particular example, where two Corresponding Squares are connected diagonally and there is enough space for a 3x3 square, Averbakh called the eight-square system. The construction of this Corresponding Square System starts with numbering the first two Corresponding Squares 1 and 2 accordingly. The square connecting the two receives the number 3. The outer squares of the 3x3 field receive the numbers 4 to 8. Further outside the numbering can continue by using the number of a square exactly two squares away either diagonally, horizontally or vertically. The image below should exemplify this process.

Using the Corresponding Square System

The numbers tell us that if the white king manages to step on a square with the same number as the square on which the black king is standing, he automatically wins the fight for the critical squares. The same case occurs if the white king can step on a square the black king can not reach in the next move. The contrary is also possible. As soon as the black king moves on the same numbered square as the white king he can automatically defend the Corresponding Squares.

The way to take advantage of the Corresponding Square System is easy now. White must move towards the critical squares, never stepping on squares the black king can defend.

1. Kb1! (steps on 3, the black king can not reach any 3-squares) Kg7
2. Kc1 (steps on the same number as the black king: 5) Kg6
3. Kd1 Kg5 4. Kc2 Kh5 5. Kc3 Kg5 6. Kc4 Kg6 7. Kd3 Kg5 8. Ke3

Computer Chess Implementation

First of all it must be noted that the concept of Corresponding Squares was designed to give the human chess player a tool to efficiently analyze a complex pawn endgame. Computers can very easily solve such positions using their Transposition Tables. Just as an example it takes Computers only a couple of seconds to reach > depth 20 in the Lasker-Reichhelm position, also referred as Fine #70 ^[2] and thus find the opponent's Zugzwang. Nevertheless Computers also have some disadvantages. The main problem is the point where the chess engine has to decide whether to enter a certain pawn ending or not. Usually these positions offer a lot more mobility, thus conducting a deep enough search seems infeasible.

The first attempt of tackling Corresponding Squares with a computer chess engine was made by Rafael B. Andrist and his chess program Wilhelm ^[3] ^[4] .

More recent research was done by Edmund Moshammer:

Algorithm by Moshammer

In principle this approach is quite similar to an Endgame Tablebase Generation process. The main difference is its optimization to be used on the fly in chess engines. To represent the Corresponding Squares 64 bitboards are used, which for every position of the attacking king represent the squares where the opponent king must stand to prevent the attacker from achieving a predefined objective.

definitions:

U64 legalSq[2]; // stores the squares where attacking/defending king may move to
                //     (ie.: not attacked by a pawn or occupied by a own pawn)
U64 coSq[64];   // stores the Corresponding Squares for each attacking king position
U64 bbSQ[64];   // bbSQ[i] = 1 << i;
int kingmoves[8] = {-9, -8, -7, -1, 1, 7, 8, 9};  // used for move generation later
 
U64 mgen_fill_KING(U64 squares);  // shifts squares one step in all 8 directions

The main retrograde routine to build the Corresponding Square system:

initialize coSq: for every position of the attacking king, the defending one may not stand on neighboring squares or squares previously defined illegal (attacked by attacker's pawns or occupied by own pawns)
set changes to a full bitboard - ie: all squares have to be looked at in the first pass
loop until all Zugzwang situations have been resolved:changes == 0
loop through all unresolved positions of the board
- reset the square on 'changes', as the position is being examined now
- initialize Katt: squares from which the attacking King can move to attack the current square
- initialize Kdef: squares from which the defending King can defend the attacking king to reach the current square - ie: the neighboring squares of the current square and the squares one king move away from the corresponding squares of the current position
- for each of the attacking king moves
  - checks that the move is on the board and is part of the legal moves (Katt)
  - if coSq is changed on the resulting position, set 'changes' accordingly, so that the changes are considered in the next pass
  - the Corresponding Squares of each neighboring attacking King position have to collide with the Corresponding Squares one Kingmove away from this position

// attacker .. attacking side
// coSq ...... pointer to the Corresponding Squares Bitboards
 
void coSq_setupSystem(int attacker, U64 * coSq) {
    for (int i=0; i<64; i++) coSq[i] &= ~mgen_fill_KING(bbSQ[i]) & ~bbSQ[i] & legalSq[!attacker];
 
    U64 changes = 0xFFFFFFFFFFFFFFFF;
    while (changes) {
        for (int i=0; i<64; i++) {
            if (changes & bbSQ[i]) {
                changes ^= bbSQ[i];
                U64 Katt = mgen_fill_KING(bbSQ[i]) & legalSq[attacker];
                U64 Kdef = mgen_fill_KING(bbSQ[i]) | mgen_fill_KING(coSq[i]);
 
                for (int j=0; j<8; j++) {
                    int Ksq = i + kingmoves[j];
                    if (!(Ksq & ~0x3F) && (bbSQ[Ksq] & Katt)) {
                        changes |= bbSQ[Ksq] * ((coSq[Ksq] & ~Kdef) != 0);
                        coSq[Ksq] &= Kdef;
                    }
                }
            }
        }
    }
}

Before the function above is called, the Corresponding Squares must be initialized. Therefore all bits in the coSq-bitboards get set. Then the first Critical Squares are defined by setting the bitboard of the attacking king at the Critical Square to 0. In other words, if the king manages to occupy the square the defending king has no squares to stand on from which he can defend the threat.

The setupSystem function itself does nothing else than looping through the bitboards and uses the rule that the defending king may only stand on a square from which he can reach all corresponding squares the attacking king may create within one move. This is done as long as no further changes are made to the bitboard.

The time it takes to analyze a position is about linear. For the Lasker-Reichhelm position (Fine #70), it took 10 cycles through the 64 squares of the board to find out that the black king can impossibly defend all of its pawns.

There is however one open question - the definition of the Critical Square. A straight forward approach would be to set the critical Squares to capturing the opponent's pawns. If in the end alpha > 0 and the defending king is standing on a Corresponding Square one can safely fail low at that point. A more complex approach would be necessary to find out whether a position is won or drawn.

Publications

Vitaly Halberstadt and Marcel Duchamp (1932). L'opposition et les cases conjuguées sont réconciliées.
Paris-Brussels 1932, German Edition 2001 Opposition und Schwesterfelder, ISBN 3-932170-35-0
Kenneth W. Church (1978). Co-ordinate Squares: A Solution to Many Chess Pawn Endgames. B.Sc. thesis, Massachusetts Institute of Technology, reprinted 1988 in Computer Chess Compendium
Kenneth W. Church (1979). Co-ordinate Squares: A Solution to Many Chess Pawn Endgames. (abbreviated version of B.Sc. thesis), IJCAI-79, Tokyo, Japan
Peter W. Frey, Larry Atkin (1979). Creating a Chess-Player, Part 4: Thoughts on Strategy. In Blaise W. Liffick (ed.), The Byte Book of Pascal, pp. 143-155. Byte Publications, also BYTE, Vol. 4, No. 1
Mike Clarke (1980). The Theory of Coordinate Squares. Advances in Computer Chess 2, pp. 97-102
Yuri Averbakh, Ilia Maizelis (1987). Comprehensive Chess Endings Vol 4: Pawn Endings. Cadogan Books 1987
Karsten Müller, Frank Lamprecht (2000). Secrets of Pawn Endings. Everyman Chess, (2007). re-issue by Gambit Publications
Karsten Müller (2004). Endgame Corner - The Mystical Sister Squares, pdf from ChessCafe.com
Omid David, Ariel Felner, Nathan S. Netanyahu (2004). Blockage Detection in Pawn Endgames. ICGA Journal, Vol. 27, No. 3

Postings

chess program "Wilhelm" released by Rafael B. Andrist, CCC, August 19, 2001
Re: Fine 70 same 7 engines (more) by Rafael B. Andrist, CCC, September 10, 2001
A new(?) technique to recognize draws by Heiner Marxen, CCC, June 01, 2002 » Chest
Corresponding squares, easy position by Vincent Lejeune, CCC, September 20, 2012
Corresponding Squares 1 by Árpád Rusz, Chess Endgame Study Composition, November 24, 2016

External Links

References

^ Position by Charles Dealtry Lockock, 1892, from Yuri Averbakh, Ilia Maizelis (1987). Comprehensive Chess Endings Vol 4: PawnEndings, Cadogan Books 1987.
^ Reuben Fine (1941). Basic Chess Endings
^ chess program "Wilhelm" released by Rafael B. Andrist, CCC, August 19, 2001
^ Gegenfeldsysteme und Schachprogramm by Rafael B. Andrist, ChessBits Forum, August 19, 2001 (German)

What links here?

Page	Date Edited
Árpád Rusz	Oct 9, 2017
Blockage Detection	Oct 19, 2017
Byte Magazine	Nov 20, 2016
Chest	Mar 3, 2015
Corresponding Squares	Oct 9, 2017
Draw	Apr 14, 2018
Edmund Moshammer	Sep 23, 2017
Endgame	Sep 18, 2017
Fill Algorithms	Nov 6, 2013
Heiner Marxen	Apr 19, 2014
Kenneth W. Church	Nov 12, 2014
King	Feb 26, 2013
Lasker-Reichhelm Position	Oct 24, 2017
Nexus	Jan 7, 2016
Opposition	Dec 2, 2014
Pawn Endgame	Oct 11, 2017
Peasant	May 21, 2015
Rafael B. Andrist	May 30, 2017
Repetitions	Jan 16, 2018
Retrograde Analysis	Mar 21, 2017
Squares	Feb 15, 2015
Triangulation	Apr 4, 2013
Wilhelm	Oct 6, 2015
Zugzwang	Dec 8, 2017

Up one level

Engines

GerdIsenberg — Sat, 10 Mar 2018 10:21:20 GMT

Home * Engines

		Several lists of computer chess programs or Chess engines, which is the chess playing part of the chess program, relying on proprietary or standard protocols communicating with an external Graphical User Interfaces.
Marcel Duchamp, Portrait of Chess Players, 1911 ^[1]

CPW-Engine

CPW-Engine

Dynamic Lists

Beside the tag "Engines", assign more property tags as appropriate, to make the engines become member of dynamic lists.

Chess Variants

Atomic Chess Engines with the tag "atomic"
Chess960 Engines with the tag "960"
Chinese Chess Engines with the tag "Xiangqi"
Crazyhouse Engines with the tag "crazyhouse"
Knightmate Engines with the tag "Knightmate"
Losing Chess Engines with the tag "losingchess"
Shatranj Engines with the tag "Shatranj"
Shogi Engines with the tag "Shogiengine"
Xiangqi Engines with the tag "Xiangqi"

GUI / Protocols

ChessBase Engines with the tag "cbengines"
UCI Engines with the tag "uciengines"
WinBoard Engines with the tag "winboardengines"
XBoard Engines with the tag "xboardengines"

Hardware

Dedicated Chess Computers with the tag "dedicated"
Mainframe Programs with the tag "mainframeprograms"
SMP Engines with the tag "smpengines"
Video Game Console Engines with the tag "gameconsole"

Legal Attributes

Clones with the tag "clones"
Commercial Engines with the tag "commercial"
GPL Engines with the tag "gplengines"
Open Source Engines with the tag "opensourceengines"
Private Engines with the tag "privateengines"

Operating System

DOS Engines with the tag "dos"
Engines for Android with the tag "android"
Linux Engines with the tag "linuxengines"
Mac OS Engines with the tag "mac"

Programming Language

Basic Engines (written in Basic) with the tag "basicengines"
C# Engines with the tag "csharpengines"
D Engines with the tag "dengine"
Delphi Engines with the tag "delphi"
Java Engines with the tag "javaengines"
Pascal Engines with the tag "pascal"

Special Purpose

Chess Problem Solving Engines with the tag "problemsolver"

Various Tags

Various Classifications
Namesake

Alphabetical List

maintained manually ...
Nevertheless, add wanted programs with the tag "engines"

#

#Chess

1

1K ZX Chess

8

8080 Chess

A

A16chs
Abbess
Abrok
Abulafia
Abyss (Chinese Chess)
Achilles
Acornsoft Chess
AdaChess
Adam
Advance
AI Chess
AICE
Alaric
Alarm
Albatross
Aldebaran
Alder
Alexs
Alfil
Algir
AliBaba
Alice
AliChess
Almond, a clone of Now
Alpha I
AlphaZero
Alybadix
Amateur
Amoeba
Amundsen
Amy
Amyan
Anaconda or Anaconda Chess
Ananse
Anatoli
Android-Chess
Andscacs
Anechka
AnMon
Ant
Anubis
APIL chess
Arachne
Arasan
Ares by Frans van Gool and Erik Leenders
Ares by Charles Roberson
Argonaut
Arion
Aristarch
Armageddon
Arminius
Arthur
asmFish
Asterisk
Astro 64
Atak
AtlanChess
Atlas by Alex Bell
Atlas by Andrés Manzanares Campillo
Atom Chess
Atomystica
Averno
Awesome
Awit
Ax
Axon
Ayito

B

C

Caesar
Calculon by Barry Smith
Caligula by Gerardo Castaño Recio
Caligula by Pedro Castro
Capivara
CAPS
Capture
Carballo
Cassandre
Cassia Chess Mate
CCCP the Columbia Computer Chess Program
CCCP by Pawel Koziol
CC Sapiens
Celes
Centaur
CFish
Chafitz ARB Sargon 2.5
Chafitz Modular Game System
CHAOS
Charlie
Charly
Chat
Chaturanga by John Poduska, Jr.
Chaturanga by Stefano Malloggi
Che by Oscar Contreras
Check Check
Cheese
Cheiron
CHEKMO-II
Chenard
Cheng
Cheops
Chepla
Ches
Chesley
Chess (Program) (Northwestern University)
Chess (David Thompson)
Chess 0.5 by Larry Atkin and Peter W. Frey
Chess 0.5X by Wim Elsenaar
Chess 2001
Chess 2013
chess22k
chess4j
Chess-64
Chess 7.0 by Larry Atkin
Chess Art For Kids
Chess At Nite
ChessBin.com
Chess Brain
ChessBrain
ChessBrainVB
Chess Challenger
Chess Champion MK I
Chess Champion MK II
Chess Champion Mark IV
Chess Champion Mark V
Chess Champion Pocket Chess
Chess Champion Super System III aka Super System III and ChessMaster
Chess Christy by Bruno Bras, France
Chess for Android
Chess for Glass
Chess Free
Chess Genius
Chess Guru
Chessica
ChessLin
ChessMachine
ChessMaps
Chessmaster
ChessMaster aka Chess Champion Super System III
Chess-Master
Chessmate
ChessMind
Chess Monster
Chessnut
Chess Partner
Chess Partner 2000
Chess Player 2150
Chess Simulator
Chess System 2175
Chess System Tal
Chesstar
Chessterfield
Chess Tiger
Chess Tutor
Chess Tutor 1
ChessV
Chess Wizard
Chest
Chester
Chexa
Chezzz
Chimo (Chinese Chess)
Chinito
ChipTest
Chiron
Chispa
Chompster
Chronos CE
CHUMP
Chunker
Chute
Cilkchess
Cinnamon
Cipollino
Clarabit
Clash
Claudia
Clever & Smart
Clubfoot
Cluster Toga
Cmcchess
CMU Chess Program
Cobalt
Coiled
Coko
Colossus Chess
Comet
Commodore ChessMate
Complete Chess System
Complete Chess System II - TAL = Chess System Tal
Composer
CompuChess
CompuChess (PC)
CompuColor Chess
Computer Chess
Conchess
Confucius
Conic X
Conqueror
Constellation = Novag Constellation
CookieCat
Corel Chess
Counter
CPW-Engine
Crafty
Crashtest Dummy
Cray Blitz
Crazywa
Critter
Crux
CT800
Cube
CuckooChess
Cumulus
Cupcake
CXG Computachess I (Cassia Chess Mate)
CXG Sensor Computachess
CXG Sphinx
CXG Star Chess
Cyber Chess
CyberPagno
Cyborg
Cyclone
Cyrus
Cyrus 68K
Czolgista

D

E

F

G

H

I

J

Jabba
Jaque Al Perro Guasón (Schweinehund)
JARS
Jazz
J. Biit
Jellyfish
Jester by Stéphane Nguyen
Jester by Marty Franz
JFresh
JikChess
Joanna
Joker by Marc-François Baudot and Jean-Christophe Weill
Joker by Manlio Morini
Joker by Harm Geert Muller
Jonny
Jumbo
Junior
Junior Chess = Mini Chess
Jupiter

K

L

M

N

NagaSkaki
nanoSzachy
Napoleon
Natwarlal
Naum
Nebiyu
Nebula
Nejmet
Nemeton
Nemo
Nemorino
Neptune
Nero
Nesik
Nest by Bruno Bras, France
NeuroChess
Neurologic
Neurone
Neurosis
Nexus
NG-play
Nightmare by Joost Buijs
Nightmare by Reinhold Gellner and Gaby von Rekowski
Nimzo
Nirvanachess
N.N.
Nona
NoonianChess
NoraGrace
NotChess
Novag Citrine
Novag Constellation = Constellation
Novag Diamond
Novag Expert
Novag Forte
Novag Micro Chess
Novag Sapphire
Novag Savant = Savant
Novag X
Now
NPMchess = Witchess
NSS
Nuchess
Nullmover
Numpty chess

O

P

p4wn
Pachera
Pacque Expert by Bruno Bras, France
Paladin
Pandix
Pandora
Papa
Parabelle
Paradise
Par Excellence
Parker Chess
Parrot
ParSOS - parallel version of SOS
Parwell
Pastime
Patriot
Patsoc
Patzer by Werner Koch and Thomas Schäfer
Patzer by Roland Pfister
Paul
Pawnder
PawnKing
Pawny
P.ConNerS
pChess (for Mac OSX, with FB5 source code)
Peasant
Pedone
Pepito
PetChess
Petir
Petunia
Phalanx
Pharaon
Philidor
Phoenix
Phoenix (Rahul)
PICcolino
PicoChess
Pigeon
PikoSzachy
Pion
Pioneer
PixChess
PK80 and PK83
Planner
Play Magnus
Plisk
Plymate
PocketGrandmaster
PolarChess
Popeye
Popochin
Portfish
Porucznik
PostModernist
Power Chess
Praetorian
Prédateur
President Chess
Princhess
Private Line
Pro Deo
Prochess by Tom Pronk
ProChess by Edoardo Manino
Prodigy
Prophet
Proscha
Protector
Protej
Pschach
Pseudo
Psi Chess
Psion
Psion Chess (Barel)
Psycho
Psycho-Chess
PsycoChess
Pulsar
Pulse
PuppetMaster » DeepBrutePos
Purple Haze
PyChess

Q

R

S

SABA Videoplay 20
Saitek Brute Force
Saitek Galileo (SciSys Leonardo)
Saitek President
Saitek Renaissance
Saitek Sparc = Kasparov Sparc
SAL
Samiel
Sargon
Satana
Savant = Novag Savant
Sayuri
SC 1
SC 2
Scaramanga, a clone of Now
Schaak
Schach by Matthias Engelbach and Thomas Kreitmair
Schach by Rolf C. Smith and Franklin D. Ceruti
Schach MV 5,6
Schaker
Schak-H
SCHK-Y
Schooner
Schweinehund
Scidlet
SciSys Companion II
SciSys Concord II
SciSys Explorer
SciSys Graduate Chess = Mini Chess
SciSys Intelligent Chess = Intelligent Chess
SciSys Junior Chess = Mini Chess
SciSys Leonardo
SciSys Mini Chess = Mini Chess
SciSys President = President Chess
SciSys Sensor Chess = Sensor Chess
SciSys Superstar = Superstar
SciSys Turbostar = Turbostar
SciSys X
Scorpio
SCP
SD Chess
Searcher
SEE
Senpai
Sensor Chess
Sensory 9
Sfinks
Shark by Sander de Zoete
Sharky
SharpChess
Sharper
Shatranj
Shess
Shield
Shiga (Chinese Chess)
Shredder
Shrike
Shura-Bura's Program
Shy
Siberian Chess
Sidonia
Sierżant was a predecessor of Porucznik
Simon
Simplex
Sinobyl (ex Latista)
Sjaak (TrojanKnight) by Ronald de Man
Sjaak by Evert Glebbeek
Sjakk
Sjeng
Skaki
Sloppy
Slow Chess
Small-C
Small Potato
SmarThink
Smash
Smaug
SMIRF
SnailChess
Sneaky Pete
Snitch
Socrates
Soft Jacqueline Bras by Bruno Bras, France
Soldat
SOMA
Sortie
SOS
Spark
Spartacus
Spector
Spectrum Chess
Sphinx (CXG Sphinx)
Spike
SpiderChess
SPOC
Square Off
SquarknII
StAndersen
Star Socrates
StarTech
Steinitz
Steve Stuart Chess
Sting
Stobor
Stockfish
Stockfish-js
Stonewall
Stoofvlees
Storm by Sean Empey
Storm by Theo van der Storm
Strategist
Strelka
SugaR
Sunfish
Sungorus
Sunsetter
Super Constellation
SuperChess
Superpawn
Superstar
Supra
Surprise
Symbolic
Szeregowiec

T

U

V

W

X

Y

Z

Forum Posts

Authors and programs. The compiled list by Peter Fendrich, CCC, May 13, 1998
On naming one's chess program by Steven Edwards, CCC, March 27, 2004
Engines written in which programming language? by Andreas Herrmann, Winboard Forum, June 01, 2009
Programmers: what's the story behind the name of your engine by George Rifkin, CCC, June 17, 2011
What separates the top engines from the rest? by Graham Banks, CCC, November 17, 2012
La Máquina Preservadora. Programas de Ajedrez by Luis a, Meca Foro, February 20, 2013 (Spanish)
UCI and Winboard download page by Ed Schröder, CCC, December 19, 2015 ^[2]
Thoughts on Komodo 11, Free engines and the future by Brian Smith, CCC, May 28, 2017

External Links

Chess engines

Chess engine from Wikipedia
Category:Chess engines from Wikipedia
List of chess software from Wikipedia
Programs competing at ICGA Tournaments
Chess Engine List from Ron Murawski's Computer-Chess Wiki
Native Engine List from Ron Murawski's Computer-Chess Wiki
THE CHESS PORTAL - CHESS SOFTWARE
XB/UCI chronology from RWBC by Günther Simon
Arena Chess GUI 3.0 - Engine Links Collection » Arena
Chess Engines from ChessMosaic by Dusan Stamenkovic
Septober - Computerschach by Herbert Marquardt (program list with screenshots)
Encyclopedia - Chess engine from the Free Internet Correspondence Games Server - FICGS
Chess Engine In C - YouTube Videos by BlueFeverSoft » Vice, C
Programming A Javascript Chess Engine - YouTube Videos by BlueFeverSoft » JavaScript

Downloads

Engine Download List from Ron Murawski's Computer-Chess Wiki
Computer Chess Oldies - Downloads by Günther Höhne
Norbert's collection of old engines, compiled by Norbert Raimund Leisner, hosted by Kirill Kryukov
Jim Ablett's Winboard Chess Projects
Downloads from sdchess.ru
Downloads from RWBC by Günther Simon (Wayback Machine)
UCI and Winboard Engines by Ed Schröder ^[3]
Free Chess Downloads by Ed Schröder
Download Winboard and UCI engines by Ed Schröder
Mac Chess Engines Repository hosted by Julien Marcel » Macintosh

Misc

Jeff Beck - Big Block, Crossroads Guitar Festival 2007, YouTube Video
feat. Tal Wilkenfeld, Vinnie Colaiuta & Jason Rebello

References

^ Schach auf Ölgemälden, ChessBase Nachrichten, October 29, 2007 (German)
^ UCI and Winboard Engines by Ed Schröder
^ UCI and Winboard download page by Ed Schröder, CCC, December 19, 2015

Up one level

Glass

GerdIsenberg — Wed, 24 May 2017 19:29:00 GMT

Home * Engines * Glass

		Glass, an UCI compliant chess engine, written by the authors of the CPW-Engine, Pawel Koziol and Edmund Moshammer, first released in December 2008 ^[1] - and not to confused with Chess for Glass. Glass comes with 21 documented personalities at varying levels of strength ^[2], and with its own opening book format ^[3]. Version Glass 2.0 PERSONALITY, released on February 25, 2012, was announced as the last version of this developement line ^[4] ^[5].
Marcel Duchamp - To Be Looked at (from the Other Side of the Glass) ^[6]

Features

^[7] ^[8] ^[9]

Board Representation

Search

Evaluation

Misc

Forum Posts

2008 ...

Introducing Glass chess engine by Pawel Koziol, CCC, December 13, 2008
Glass 1.0 update by Edmund Moshammer, CCC, March 31, 2009
Glass 1.1 by Pawel Koziol, CCC, April 06, 2009
Glass 1.2 released by Pawel Koziol, CCC, May 03, 2009
Glass Opening Book Manager 1.0 - Released! by Edmund Moshammer, CCC, May 03, 2009
Glass 1.3 release by Pawel Koziol, CCC, June 30, 2009

2010 ...

Glass 1.5 release by Pawel Koziol, CCC, March 28, 2010
Glass 1.6 - New with Personalities!! by Edmund Moshammer, CCC, July 13, 2010
Glass 1.7 release by Pawel Koziol, CCC, July 20, 2011
Glass 1.7 agressive = CSTal at his best and more by Fernando Villegas, CCC, July 23, 2011
Glass 1.8 released by Pawel Koziol, CCC, November 27, 2011
Glass 1.9 released by Edmund Moshammer, CCC, July 06, 2012
Glass news by Pawel Koziol, CCC, February 25, 2013

External Links

Chess Engine

Misc

Glass from Wikipedia
Glass (disambiguation) from Wikipedia
Agnes Obel - Citizen Of Glass (2016), YouTube Video

References

^ Introducing Glass chess engine by Pawel Koziol, CCC, December 13, 2008
^ Glass 1.6 - New with Personalities!! by Edmund Moshammer, CCC, July 13, 2010
^ Glass Opening Book Manager 1.0 - Released! by Edmund Moshammer, CCC, May 03, 2009
^ Glass news by Pawel Koziol, CCC, February 25, 2013
^ Glass Homepage
^ Marcel Duchamp 1918 A regarder d'un oeil, de près, pendant presque une heure, To Be Looked at (from the Other Side of the Glass) with One Eye, Close to, for Almost an Hour. Photograph by Man Ray, published in 391, July 1920, Museum of Modern Art, Marcel Duchamp from Wikipedia
^ Introducing Glass chess engine by Pawel Koziol, CCC, December 13, 2008
^ Glass Homepage - Details
^ Glass Homepage - History

What links here?

Page	Date Edited
CPW-Engine	Dec 31, 2014
Edmund Moshammer	Sep 23, 2017
Engines	Mar 10, 2018
Glass	May 24, 2017
IGWT 2013	Jun 23, 2014
Mate Distance Pruning	Jun 2, 2017
Pawel Koziol	Dec 17, 2017
PCCC 2010	Aug 9, 2016
PCCC 2011	Mar 12, 2013
PCCC 2012	Mar 11, 2013
Principal variation	Dec 4, 2017
Sidonia	May 19, 2016

Up one Level

Kenneth Wingate Regan

GerdIsenberg — Mon, 19 Feb 2018 21:50:26 GMT

Home * People * Kenneth Wingate Regan

		Kenneth Wingate Regan (Ken Regan), an American computer scientist and associate professor with tenure at Department Computer Science and Engineering ^[1], University at Buffalo, Amherst, New York. He works in computational complexity theory and other fields of information theory and pure mathematics, and further holds the title of a Chess International Master ^[2] with a rating of 2453 ^[3] .
Ken Regan ^[4]

Photos

Selected Publications

Photos

Kenneth W. Regan wins the 2010 Mayor's Cup Masters Championships ^[5] ^[6]

Selected Publications

^[7] ^[8]

1999

Irina Krush, Kenneth W. Regan (1999). The Greatest Game in the History of Chess. A Special Report by Irina Krush, Official MSN Game Analyst, part 2, part 3 with Paul Hodges ^[9] ^[10]

2000 ...

Denis Xavier Charles, Kenneth W. Regan (2004). On arithmetical formulas whose Jacobians are Groebner Bases. Journal of Symbolic Logic, pdf ^[11] ^[12]
Giuseppe Di Fatta, Guy Haworth, Kenneth W. Regan (2009). Skill Rating by Bayesian Inference. CIDM 2009, pdf ^[13]

2010 ...

Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta (2010). Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess. Advances in Computer Games 12, pdf
Kenneth W. Regan, Guy Haworth (2011). Intrinsic Chess Ratings. AAAI 2011, pdf, slides as pdf ^[14]
Kenneth W. Regan, Bartłomiej Macieja, Guy Haworth (2011). Understanding Distributions of Chess Performances. Advances in Computer Games 13, pdf
Kenneth W. Regan, Tamal T. Biswas (2013). Psychometric modeling of decision making via game play. CIG 2013, slides as pdf
Kenneth W. Regan, Tamal T. Biswas, Jason Zhou (2014). Human and Computer Preferences at Chess. pdf

2015 ...

Tamal T. Biswas, Kenneth W. Regan (2015). Quantifying Depth and Complexity of Thinking and Knowledge. ICAART 2015, pdf
Guy Haworth, Tamal T. Biswas, Kenneth W. Regan (2015). A Comparative Review of Skill Assessment: Performance, Prediction and Profiling. Advances in Computer Games 14
Tamal T. Biswas, Kenneth W. Regan (2015). Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data. IEEE ICMLA 2015, pdf preprint

Forum & Blog Posts

2008

Computational Complexity: Bobby Fischer (Guest Post by Ken Regan), January 18, 2008

2010 ...

Poker and Cantor’s Proof by Ken Regan, Gödel’s Lost Letter and P=NP, October 29, 2011
A Neat Result About The Simplex Algorithm by Ken Regan, Gödel’s Lost Letter and P=NP, November 22, 2011
The Higgs Confidence Game by Ken Regan, Gödel’s Lost Letter and P=NP, December 13, 2011
Predictions For 2012 by Ken Regan, Gödel’s Lost Letter and P=NP, January 3, 2012
The New Chess World Champion by Ken Regan, Gödel's Lost Letter and P=NP, December 28, 2014 » Larry Kaufman, TCEC Season 7, Komodo ^[15]

2015 ...

Depth of Satisficing by Ken Regan, Gödel's Lost Letter and P=NP, October 06, 2015 » Depth, Match Statistics, Pawn Advantage, Win Percentage, and ELO, Stockfish, Komodo ^[16]
Thanks for Additivity by Ken Regan, Gödel's Lost Letter and P=NP, November 27, 2015 » TCEC Season 8 ^[17]
A Chess Firewall at Zero? by Ken Regan, Gödel's Lost Letter and P=NP, January 21, 2016
When Data Serves Turkey by Ken Regan, Gödel's Lost Letter and P=NP, November 30, 2016
Magnus and the Turkey Grinder by Ken Regan, Gödel's Lost Letter and P=NP, December 08, 2016 » Match Statistics, Pawn Advantage, Win Percentage, and ELO ^[18] ^[19]
Stopped Watches and Data Analytics by Ken Regan, Gödel's Lost Letter and P=NP, May 23, 2017
Re: "Intrinsic Chess Ratings" by Regan, Haworth -- by Kenneth Regan, CCC, November 20, 2017 » Who is the Master?
A Coup(e) of Duchamp by Ken Regan, Gödel's Lost Letter and P=NP, February 16, 2018
Marcel Duchamp endgame "splits" engines / hash phenomenon by Kenneth Regan, CCC, February 19, 2018 » Chess Problems, Compositions and Studies, Marcel Duchamp, Transposition Table

External Links

References

^ UB Computer Science and Engineering
^ Measuring Fidelity to a Computer Agent
^ Mathematics and Chess Page
^ UB CSE Department: Kenneth W. Regan
^ Buffalo Niagara Chess Corner: 4th Annual 2010 MAYOR'S CUP MASTERS CHAMPIONSHIPS
^ Buffalo Niagara Chess Corner: Kenneth W. Regan, International Master is 2010 Mayor's Cup Masters Champion
^ DBLP: Kenneth Wingate Regan
^ Kenneth W. Regan - Selected Publications
^ Analyzing Kasparov versus the World using the EGTBs by Peter Karrer
^ Peter Karrer (2000). KQQKQP and KQPKQP≈. ICGA Journal, Vol. 23, No. 2
^ Jacobian matrix and determinant from Wikipedia
^ Gröbner basis from Wikipedia
^ Bayesian inference from Wikipedia
^ "Intrinsic Chess Ratings" by Regan, Haworth -- seq by Kai Middleton, CCC, November 19, 2017
^ The New Chess World Champion by Bajusz Tamás, CCC, December 28, 2014
^ Regan's latest: Depth of Satisficing by Carl Lumma, CCC, October 09, 2015
^ Is the current Komodo that close to perfection? by Bajusz Tamás, CCC, November 28, 2015
^ World Chess Championship 2016 from Wikipedia
^ Regan's conundrum by Carl Lumma, CCC, December 09, 2016
^ Kasparov versus the World from Wikipedia

What links here?

Page	Date Edited
Advances in Computer Games 12	Jan 5, 2017
Advances in Computer Games 13	Jan 7, 2017
Advances in Computer Games 14	Aug 11, 2017
Bartłomiej Macieja	Jun 8, 2015
Chess	Jan 21, 2018
Chess Problems, Compositions and Studies	Feb 19, 2018
Denis Xavier Charles	Nov 5, 2013
Depth	Feb 25, 2018
Draw Evaluation	Mar 12, 2018
Giuseppe Di Fatta	Aug 15, 2013
Guy Haworth	Nov 20, 2017
Jason Zhou	Dec 20, 2017
Kenneth Wingate Regan	Feb 19, 2018
Knowledge	Jul 22, 2017
Komodo	Mar 6, 2018
Larry Kaufman	Jan 28, 2018
Match Statistics	Mar 31, 2018
Mathematician	Apr 9, 2018
Pawn Advantage, Win Percentage, and Elo	Dec 20, 2017
Pawn Hash Table	Feb 1, 2018
People	Feb 28, 2018
Peter Karrer	Jan 9, 2017
Playing Strength	Mar 31, 2018
Repetitions	Jan 16, 2018
Robert W. Howard	Jul 1, 2014
Stalemate	Feb 21, 2018
Stockfish	Apr 7, 2018
Tamal T. Biswas	Jun 19, 2017
TCEC Season 7	Jan 23, 2015
TCEC Season 8	Nov 30, 2015
Test-Positions	Feb 25, 2018
Transposition Table	Apr 19, 2018

Up one level

Pawn Endgame

GerdIsenberg — Wed, 11 Oct 2017 20:04:09 GMT

Home * Evaluation * Game Phases * Endgame * Pawn Endgame

		The Pawn Endgame is an endgame actually without any pieces but only pawns and kings. Pawn endings somehow remind on a completely different game domain, requiring special evaluation routines, as well as conditions inside the search, i. e. switching of null move pruning. Specially in "closed" or blocked pawn endgames with rammed and backward pawns with only very few reasonable moves due to extremely low mobility, zugzwang, stalemate, triangulation, tempo issues, the concepts of opposition or more general corresponding squares, and king path puzzles start to dominate. Otherwise, in open pawn endings, naturally with a bigger branching factor than the closed, all kinds of passed pawn issues are taken into account. Using the transposition table is essential in pawn endings, as demonstrated in positions like the Lasker-Reichhelm Position (Fine 70) or the Réti Endgame Study with astonishing search depths. Certainly, many programs extend a lot, if the last piece was captured with the transition into an "unclear" pawn endgame. Ed Schröder for instance, extends by three plies in Rebel considering bounds ^[1] .
Pawns threaten the King ^[2]

Considerations

Pawn Endgame Programs

Pawn Endgame Positions

Considerations

Pawn Endgame Programs

Pawn Endgame Positions

Lasker-Reichhelm Position (Fine 70)
Réti Endgame Study

Publications

Chess

Vitali Halberstadt and Marcel Duchamp (1932). L'opposition et les cases conjuguées sont réconciliées. » Corresponding Squares
Paris-Brussels 1932, German Edition 2001 Opposition und Schwesterfelder, ISBN 3-932170-35-0
Reuben Fine (1941). Basic Chess Endings, Chapter 2, King and Pawn Endings
Yuri Averbakh, Ilia Maizelis (1987). Comprehensive Chess Endings Vol 4: Pawn Endings, Cadogan Books 1987.
Karsten Müller, Frank Lamprecht (2000). Secrets of Pawn Endings. Everyman Chess, (2007). re-issue by Gambit Publications
Eric Schiller (2006). Of Kings and Pawns - Chess Strategy in the Endgame, Universal Publishers, ISBN-13: 978-1581129090, amazon, sample chapter as pdf

Computer Chess

1977 ...

Monroe Newborn (1977). PEASANT: An endgame program for kings and pawns. Chess Skill in Man and Machine » Peasant
Crispin Perdue, Hans Berliner (1977). EG: a case study in problem solving with king and pawn endings. 5. IJCAI 1977
Kenneth W. Church (1978). Co-ordinate Squares: A Solution to Many Chess Pawn Endgames. B.Sc. thesis, Massachusetts Institute of Technology, reprinted 1988 in Computer Chess Compendium
Kenneth W. Church (1979). Co-ordinate Squares: A Solution to Many Chess Pawn Endgames. (abbreviated version of B.Sc. thesis), IJCAI-79, Tokyo, Japan
Peter W. Frey, Larry Atkin (1979). Creating a Chess-Player, Part 4: Thoughts on Strategy. In Blaise W. Liffick (ed.), The Byte Book of Pascal, pp. 143-155. Byte Publications, also BYTE, Vol. 4, No. 1 » Corresponding Squares

1980 ...

Helmut Horacek (1982). Ein Modell für Schachbauernendspiele mit menschlichen Problemlösungstechniken. PhD-Thesis, Department of Computer Science, University of Vienna, Supervisors: Prof. Dr. Curt Christian (University of Vienna) and Prof. Dr. Wilhelm Barth (Vienna University of Technology).
Helmut Horacek (1982). Construction of Planned Move Trees for Chess Pawn Endings. Sigart Newsletter 80, pp. 163-168.
Helmut Horacek (1983). Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings. ICCA Journal, Vol. 6, No. 3
Murray Campbell, Hans Berliner (1983). A Chess Program That Chunks. AAAI 1983 49-53, pdf » Chunker
Hans Berliner, Murray Campbell (1984). Using Chunking to Solve Chess Pawn Endgames. Artificial Intelligence, Vol. 23, No. 1, pp. 97-120. ISSN 0004-3702
Andrew N. Walker (1989). Interactive Solution of King and Pawn Endings. Advances in Computer Chess 5

1990 ...

Wilhelm Barth (1995). Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame. ICCA Journal, Vol. 18, No. 3 ^[3]
Wilhelm Barth (1995). The KPKP Endgame: An Amplification. ICCA Journal, Vol. 18, No. 4

2000 ...

Omid David, Ariel Felner, Nathan S. Netanyahu (2004). Blockage Detection in Pawn Endgames. ICGA Journal, Vol. 27, No. 3
Zvi Retchkiman Königsberg (2007). A Combinatorial Game Mathematical Strategy Planning Procedure for a Class of Chess Endgames. International Mathematical Forum, Vol. 2, No. 68

2010 ...

Monroe Newborn, Robert Hyatt (2014). Computer Chess Endgame Play with Pawns: Then and Now. ICGA Journal, Vol. 37, No. 4 » Peasant, Crafty

Forum Posts

1997 ...

Deep analyses of pawn endgames by Dap Hartmann, rgcc, February 10, 1997

2000 ...

Pawn endings [blocked pawns] by José Antônio Fabiano Mendes, CCC, January 26, 2000
Pawn endgame test suite by Peter McKenzie, CCC, October 07, 2000 » Test-Positions
king and pawns ending by Frank Phillips, CCC, August 23, 2002
Is this rule safe (how has K&Ps vs K&Ps databases? ...) by Mark Lefler, CCC, June 20, 2007 » KPK, Now
king pawn endgames by Mike Adams, CCC, January 30, 2008

2010 ...

Pawns ending by Andres Valverde, CCC, December 10, 2010
Code of Chiron for Detection of Pawn Blockages by Ubaldo Andrea Farina, CCC, October 13, 2011
pawn endgame by Marek Kwiatkowski, CCC, November 28, 2012

External Links

References

^ Quote by Ed Schröder from his Programmer Corner: The Search is extended with 3 plies when the search transits to a pawn-ending. An extra window check of 3 pawns is done on I_SCORE before the extension is rewarded
^ Chess Paintings by Elke Rehder
^ Steven Edwards (1995). Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.” ICCA Journal, Vol. 18, No. 4

What links here?

Page	Date Edited
Andres Valverde	Apr 6, 2013
Backward Pawn	May 5, 2017
Backward Pawns (Bitboards)	May 5, 2017
Betsabe	Jul 23, 2017
Blockade	Oct 19, 2017
Blockage Detection	Oct 19, 2017
Byte Magazine	Nov 20, 2016
Capture (program)	Jan 8, 2016
Capture Extensions	Oct 26, 2012
Chiron	Sep 24, 2017
Chunker	Jul 12, 2016
Connected Passed Pawns	Mar 27, 2015
Corresponding Squares	Oct 9, 2017
Crafty	Jan 28, 2018
DanaSah	Oct 9, 2017
Double Null Move	May 8, 2015
Endgame	Sep 18, 2017
Fischerle	Aug 21, 2017
Frank Anderson	Jul 8, 2016
Frank Phillips	Sep 26, 2016
Gibbon	Dec 23, 2014
Gogobello	Jul 30, 2017
Hans Berliner	Jun 10, 2017
Helmut Horacek	Oct 31, 2016
Israel Gold	Nov 13, 2014
Jabba	Sep 10, 2016
King Centralization	Oct 30, 2017
King Pattern	Nov 15, 2013
King Pawn Tropism	Sep 1, 2014
KPK	May 12, 2016
Lars Rasmussen	Apr 25, 2016
Leon Piasetski	Nov 13, 2014
Marek Kwiatkowski	Oct 22, 2017
Mark Lefler	Nov 23, 2017
Mephisto Lyon	Sep 1, 2017
Mephisto Vancouver	Sep 2, 2017
Monroe Newborn	Dec 23, 2017
Murray Campbell	Jun 2, 2017
Now	Jan 7, 2016
Opposition	Dec 2, 2014
Outside passed pawn	Jun 7, 2012
Patzer (K)	Jul 18, 2012
Pawn Endgame	Oct 11, 2017
Pawn Race	Dec 16, 2017
PawnKing	Sep 5, 2014
Peasant	May 21, 2015
Peter McKenzie	Jan 7, 2016
Protected Passed Pawn	Jun 7, 2012
Rafael B. Andrist	May 30, 2017
RDChess	May 3, 2013
Rebel	Feb 25, 2018
Rook Endgame	Sep 18, 2017
Rule of the Square	Sep 6, 2014
Smash	May 11, 2016
Test-Positions	Feb 25, 2018
Thor's Hammer	Nov 23, 2013
Triangulation	Apr 4, 2013
Ubaldo Andrea Farina	Jan 7, 2016
WCCC 2002	Nov 24, 2017
Wilhelm	Oct 6, 2015
Y!	Sep 10, 2017
Zugzwang	Dec 8, 2017
Zvi Retchkiman Königsberg	Feb 9, 2016

Up one Level

Zugzwang

GerdIsenberg — Fri, 08 Dec 2017 19:40:47 GMT

Zugzwang and Null Move

Mutual Zugzwang

Trébuchet

Zugzwang and Null Move

Zugzwang positions are known cause the Null Move Pruning go wrong. For that reason most programs do not use null move in the late endings. As far as middlegame positions are concerned, programmers either assume that they happen too rarely to bother with them, or use some sort of verification pruning.

Mutual Zugzwang

Mutual or reciprocal zugzwang is a rare position such that who ever is to move is in zugzwang, which may occur in late endings ^[1].

Trébuchet

A Trébuchet is an extreme winning/losing type of reciprocal zugzwang in pawn endgames, also broached in Noam Elkies publication On numbers and endgames. ^[2].

Publications

^[3]

John Roycroft (1990). Identifying Three Types of Zugzwang. ICCA Journal, Vol. 13, No. 4
Lars Rasmussen (1991 - 2000). Mutual Zugzwang Results. (various) EG
Ingo Althöfer, Bernhard Walter (1994). Weak Zugzwang: Statistics on some Chess Endgames. ICCA Journal, Vol. 17, No. 2
Stefan Plenkner (1995). A Null-Move Technique Impervious to Zugzwang. ICCA Journal, Vol. 18, No. 2
Noam D. Elkies (1999). On numbers and endgames: Combinatorial game theory in chess endgames. pdf, differs only in trivial stylistic details from the (1996) version published in Games of No Chance edited by Richard J. Nowakowski
Guy Haworth, Peter Karrer, John Tamplin, Christoph Wirth (2001). 3-5-man chess: Maximals and mzugs. ICGA Journal, Vol. 24, No. 4
Zvi Retchkiman Königsberg (2007). A Combinatorial Game Mathematical Strategy Planning Procedure for a Class of Chess Endgames. International Mathematical Forum, Vol. 2, No. 68
Eiko Bleicher, Guy Haworth (2010). 6-Man Chess and Zugzwangs. Advances in Computer Games 12
Guy Haworth, Harold van der Heijden, Eiko Bleicher (2011). Zugzwangs in Chess Studies. ICGA Journal, Vol. 34, No. 2

Forum Posts

2000 ...

Looking for "Zugzwang" positions by Alexander Kure, CCC, February 09, 2002
Zugzwang by Mihaly Szalai, CCC, September 10, 2004
New Zugzwang Testsuite by Robert Allgeuer, CCC, October 14, 2004
Zugzwang Test Suite ZPTS - updated version and results of Fruit by Robert Allgeuer, CCC, October 19, 2004 ^[4]
A zugzwang position by Guy Haworth, CCC, December 21, 2005
Null-moves and zugzwang by Luca Hemmerich, CCC, September 25, 2009

2010 ...

Re: Mate in 17 revisited by Robert Houdart, CCC, July 16, 2010
Zugzwang Collection by kingliveson, OpenChess Forum, February 14, 2012 » Engine Testing
test position: Rookie-Arasan by Jon Dart, CCC, January 27, 2014 » Arasan, Rookie
Zugzwang Test Suite ZPTS by Robert Allgeuer by Paul Henri, CCC, February 12, 2014 ^[5]
static mate/stalemate detection? by Alexandru Mosoi, CCC, November 21, 2015 » Null Move Test-Positions, Stalemate
4 old zugzwangs where modern engines still have troubles by Vincent Lejeune, CCC, July 12, 2016

External Links

Zugzwang

Misc

Crime Always Pays: The Chess Bit: In Which A Dominant Queen Bashes The Bishop
Zugzwang in Kristiansund, ChessBase News, September 30, 2010
Zugzwang - Forced Movement by Rudolf Herz, an artistic thesis on Modern Art, Duchamp and Hitler, various Exhibitions inter alia at Kunstverein Ruhr, Essen 1995, The Jewish Museum, New York City 2002, panel discussion at Karlsruhe University of Arts and Design (HfG), May 12, 2015
Zugzwang (musical work) from Wikipedia
Matt Elliott - Zugzwang, Live à Fip (2016), YouTube Video

References

^ List of All Known Mutual Zugzwangs
^ Noam D. Elkies (1999). On numbers and endgames: Combinatorial game theory in chess endgames. pdf, differs only in trivial stylistic details from the (1996) version published in Games of No Chance edited by Richard J. Nowakowski, MSRI Publications Volume 29
^ ICGA Reference Database (pdf)
^ Zugzwang Test Suite ZPTS by Robert Allgeuer by Paul Henri, CCC, February 12, 2014
^ Zugzwang Test Suite ZPTS - updated version and results of Fruit by Robert Allgeuer, CCC, October 19, 2004

What links here?

Page	Date Edited
Alex Kure	Aug 27, 2016
AlphaZero	Feb 10, 2018
Arasan	Apr 8, 2018
Bernhard Walter	Dec 31, 2015
Bishops of Opposite Colors	Aug 22, 2012
Blockage Detection	Oct 19, 2017
Caesar	May 22, 2016
Checkmate	Apr 13, 2018
Chess Problems, Compositions and Studies	Feb 19, 2018
Christoph Wirth	Jan 8, 2017
Corresponding Squares	Oct 9, 2017
Dictionary	Aug 24, 2017
Djinn	Feb 8, 2016
Double Null Move	May 8, 2015
Endgame Tablebases	Mar 6, 2018
Fail-High Reductions	Mar 6, 2014
Franklin Titus	Aug 20, 2013
Guy Haworth	Nov 20, 2017
Houdini	Apr 14, 2018
John Tamplin	Jan 9, 2017
José Antônio Fabiano Mendes	Feb 25, 2014
Karlo Bala Jr.	Feb 19, 2017
KRK	Nov 26, 2016
Lars Rasmussen	Apr 25, 2016
Marek Kwiatkowski	Oct 22, 2017
Null Move Observation	Dec 30, 2015
Null Move Pruning	Dec 2, 2017
Null Move Reductions	Jun 22, 2015
Null Move Test-Positions	Nov 22, 2015
Opposition	Dec 2, 2014
Pawn Endgame	Oct 11, 2017
Peter Karrer	Jan 9, 2017
Quiescence Search	Aug 19, 2017
Robert Houdart	Dec 8, 2017
Rookie	Jan 7, 2016
Side to move	Oct 29, 2017
Stalemate	Feb 21, 2018
Sting	Mar 16, 2018
Tactics	Jan 12, 2018
Tempo	Jan 17, 2018
Test-Positions	Feb 25, 2018
Thomas Thomsen	Mar 25, 2015
Triangulation	Apr 4, 2013
Zugzwang	Dec 8, 2017
Zvi Retchkiman Königsberg	Feb 9, 2016

Up one Level

Zwischenzug

GerdIsenberg — Wed, 15 Jan 2014 22:09:12 GMT

External Links

References

What links here?

Home * Chess * Tactics * Zwischenzug

A Zwischenzug (intermezzo, intermediate or in-between move) is a chess tactic related move, which is played instead of an obvious looking, expected move, commonly a recapture, posing an immediate threat the opponent must respond to, ideally changing the situation to the player's advantage. The term Zwischenzug was coined in 1933 by Fred Reinfeld and Irving Chernev in their book Chess Strategy and Tactics ^[1].

Chess programs may consider some kinds of Zwischenzug early, after a recapture does not fail-high, or does not improve alpha at PV-nodes. Most common is a check giving move even in quiescence search, a mate threatening move, or a otherwise attacking move considering discovered attacks.

External Links

Zwischenzug from Wikipedia
Top 10 chess: Tactical Motif X: ZwischenZug (In-Between Move)
Entr'acte - René Clair, 1924 (1), YouTube Video
Man Ray and Marcel Duchamp chess playing at 4:22

References

^ Earliest Occurrences of Chess Terms by Edward Winter

What links here?

Page	Date Edited
Arts	Nov 5, 2017
Capture Extensions	Oct 26, 2012
Combination	Oct 25, 2016
Dictionary	Aug 24, 2017
Moves	Feb 19, 2018
Overloading	May 5, 2017
Recapture Extensions	Feb 2, 2013
Skewer	Oct 22, 2014
Tactical Moves	Sep 22, 2010
Tactics	Jan 12, 2018
Undermining	Jun 10, 2012
Zwischenzug	Jan 15, 2014

Up one Level

Wikispaces : chessprogramming - items matching description

8x8 Board

Table of Contents

Alternatives

See also

Publications

Forum Posts

External Links

References

What links here?

Chess

Table of Contents

Board and Squares

Pieces and Moves

Color and Side

The Game of Chess

During the Game

The End

Chess Variants

Chess Problems

Chess and Mathematics

Chess Maxima

Chess and Psychology

Chess and Philosophy

Chess Programs called Chess

See also

Publications

1949

1950 ...

1955 ...

1960 ...

1965 ...

1970 ...

1975 ...

1980 ...

1985 ...

1990 ...

1995 ...

2000 ...

2005 ...

2010 ...

2015 ...

Forum Posts

1989

1990 ...

2000 ...

2010 ...

2015 ...

External Links

Wikipedia

Chess

Chess Variants

Misc

References

Chess Position

Table of Contents

Specifying a Chess Position

Summary

Positions inside the Search

Positions

Notations

Flipping and Mirroring

See Also

Publications

Forum Posts

1980 ...

1990 ...

2000 ...

2010 ...

2015 ...

External Links

References

What links here?

Chessboard

Table of Contents

Fourfold Symmetry

See also

Publications

External Links

References