Wikispaces : chessprogramming - items matching description

Alybadix

GerdIsenberg — Tue, 26 Apr 2016 19:59:05 GMT

Home * Engines * Alybadix

Alybadix,
a set of programs for solving orthodox (Matebadix, Sidebadix, ...) and heterodox (Fairybadix) ^[1] chess problems and tools, developed by Ilkka Blom since 1980 initially for Apple II and later for PCs running DOS. The solver AP.exe is completely written in x86 assembly language using the DJGPP suite ^[2]. Alybadix supports the problem genres checkmate, stalemate, helpmate, helpstalemate, selfmate, selfstalemate, reflexmates, and seriesmover in N moves, and further Circe chess, maximummers ^[3] ^[4], and many Fairy types ^[5]. Alybadix is supported by Paul Wiereyn's Windows GUI APwin. It comes with a large problem collection and features quality printing supporting Ghostscript 9.00 or newer ^[6].

Forum Posts

Can Alybadix or Gustav solve this studies by Uri Blass, CCC, December 10, 1998
CHEST vs. ALYBADIX by Jouni Uski, CCC, October 23, 2002 » Chest

External Links

Alybadix chess solving programs
Alybadix chess solving program - AP.exe
Alybadix Chess | Facebook
Alybadix - from Software for handling chess problems, Wikipedia
apwin
Alybadix 2005 and (fairy) chess endgames by Václav Kotěšovec, April 23.2005
GUSTAV - fastest program for orthodox selfmates and moremovers by Václav Kotěšovec, October 6, 2009 » Gustav - Compare with ALYBADIX
Brand X - Unorthodox Behaviour, Live at Ronnie Scott's Jazz Club, September 1976, YouTube Video

References

What links here?

Page	Date Edited
Alybadix	Apr 26, 2016
APwin	Oct 12, 2017
Chest	Mar 3, 2015
Engines	Mar 10, 2018
Gustav	May 14, 2016
Ilkka Blom	Mar 3, 2015
Paul Wiereyn	Jun 4, 2015
Popeye	Oct 11, 2017

Up one level

Chest

GerdIsenberg — Tue, 03 Mar 2015 18:45:25 GMT

Home * Engines * Chest

Chest, (CHEST)
a program for solving orthodox chess problems, such as checkmate, stalemate, helpmate, helpstalemate, selfmate and selfstalemate in N ^[1]. Chest is under development since 1987, written in ANSI C by Heiner Marxen, Holger Pause and Thomas Rakovsky, while Heiner already started with a mate-in-two solver written in Fortran II in 1973 ^[2] ^[3]. Chest does not play chess, but proves shortest solutions or its absence. It was first released in December 1999 as open source ^[4]. ChestUCI by Franz Huber, written in Delphi ^[5], is an UCI adapter for a slightly modified Chest 3.19, to run it from any GUI which can run UCI chess engines.

Description

^[6]

Search

The main tree search function, utilizing a transposition table, is recursive, i.e. for a job of depth N this function does call itself several times with depth N-1, and always performs "iterative deepening", i.e. a job or subjob with a depth of 3 is first computed with a depth of 1, and if that fails, with a depth of 2 and if this also fails, with a depth of 3.

Board Representation

Chest uses a one-dimensional, incremental updated 16x24 mailbox board representation to not only apply vector attacks but also to allow any legal displacement vector between two non-border squares to be added to any legal square without probing memory outside the 16x24 array. Per square, it keeps distinct piece type and piece color, and further piece-sets of direct and indirect attacking/defending pieces. The redundancy pays off, since the attack info greatly speeds up the generation of legal moves.

Forum Posts

1999

CHEST 3.19 is available by Heiner Marxen, CCC, December 18, 1999
Chest 3.19 is incredible! by Dann Corbit, CCC, December 20, 1999
1924 NY Chess Championship -- chest analyzed mates so far by Dann Corbit, CCC, December 27, 1999

2000 ...

Problem with CHEST by Jouni Uski, CCC, January 04, 2000
Who can help me with Chest (mate solver) by Michel Langeveld, CCC, August 23, 2000
Re: Chest (German) by Heiner Marxen, CCC, June 03, 2001
The program chest? by Kees van Iersel, CCC, October 10, 2001
Nalimov's EGTBs (long post with code) by Heiner Marxen, CCC, October 13, 2001 » Nalimov Tablebases
CHEST bugfix available by Heiner Marxen, CCC, May 05, 2002
A new(?) technique to recognize draws by Heiner Marxen, CCC, June 01, 2002 » Corresponding Squares, Repetitions
´ChestUCI Ver.1.0´ - a new UCI-engine for the problem solver ´Chest´ by Franz Huber, CCC, August 24, 2002
About CHEST by Jouni Uski, CCC, September 18, 2002
CHEST vs. ALYBADIX by Jouni Uski, CCC, October 23, 2002 » Alybadix
Small Bug in Chest UCI by Michael Drexel, CCC, May 23, 2004

2005 ...

ChestUCI 4.4 Update by Franz Huber, CCC, February 14, 2006
Stunning Chest! by Jouni Uski, CCC, September 02, 2007
ChestUCI 4.6 by Franz Huber, CCC, December 22, 2007
ChestUCI v5.0 released by Marek Soszynski, CCC, March 05, 2008

2010 ...

ChestUCI Source Code by Louis Zulli, CCC, December 15, 2010
ChestUCI 5.2 update by Franz Huber, CCC, March 08, 2011
Re: Perft(3) from 1978, with a twist! by Heiner Marxen, CCC, December 09, 2011 » Perft
Wanted: A successor to Chest by Marek Soszynski, CCC, June 25, 2012
CHEST anniversary! by Franz Huber, CCC, December 18, 2014

External Links

References

^ Chest - Readme Long
^ Chest - Readme Long - History
^ Re: Perft(3) from 1978, with a twist! by Heiner Marxen, CCC, December 09, 2011
^ CHEST 3.19 is available by Heiner Marxen, CCC, December 18, 1999
^ Re: ChestUCI Source Code by Franz Huber, CCC, December 15, 2010
^ Description based on Readme Long

What links here?

Page	Date Edited
Alybadix	Apr 26, 2016
Chest	Mar 3, 2015
Corresponding Squares	Oct 9, 2017
Engines	Mar 10, 2018
Gustav	May 14, 2016
Heiner Marxen	Apr 19, 2014
Jouni Uski	Sep 28, 2017
Mate Search	Oct 22, 2016
Mater	Apr 26, 2016
Piece-Sets	Jun 9, 2017
Popeye	Oct 11, 2017

Up one level

Composer

GerdIsenberg — Sun, 03 Sep 2017 15:30:39 GMT

Home * Engines * Composer

Composer,
an early program for producing and solving orthodox chess problems by Scottish chess player and chess composer Norman A. Macleod. In theory the program was able of producing problems up to the size of a miniature (7 men). In practice, time and storage considerations made it impractical to deal exhaustively with problems containing more than 3 or 4 men, considering following genres: directmates, directstalemate, helpmates, helpstalemates, seriesmates, seriesstalemates, serieshelpmates and serieshelpstalemates.

Description

The method used by the program is first to find all final positions for each combination of pieces. Then the program makes all possible retro-moves. The resulting positions are sorted and duplicatons removed. Positions without a duplicate are designated "good" and those with a duplicate "bad". Retro-moves must be made from both "good" and "bad" positions, but all ancestors of "bad" positions are "bad", while only nonduplicated ancestors of "good" positions are "good". A slight variation of this procedure is needed for directmates and stalemates. Another variation was added to produce accurate multi-solution problems ^[1].

Sample Composition

A sample composition was mentioned by László Lindner, a demonstration of Composer's abilities at the PCCC (Permanent Commission of the FIDE for Chess Compositions) meeting in Arnhem, The Netherlands, 1981. The example is a fourfold twin, helpmate in three. The twins are all formed from the proceeding positions ^[2]:

b) make e3 a white queen
c) shift the white queen to b5
d) make b5 back into a white rook

8/8/8/8/8/1k2R3/8/K7 b - -

The solutions are exactly determined:
a) 1.Kc2 Ka2 2.Kc1 Kb3 3.Kb1 Re1#
a) 1.Kb4 Kb2 2.Ka4 Kc3 3.Ka3 Qa7#
a) 1.Kc2 Ka2 2.Kc1 Kb3 3.Kb1 Qf1#
a) 1.Ka4 Kb1 2.Ka3 Kc2 3.Ka2 Ra5#

Publications

László Lindner (1982). How the Computer Helps the Composer. ICCA Newsletter, Vol. 5, No. 2
Norman A. Macleod (1983). Is the Computer Going to Take Over from the Composer? ICCA Newsletter, Vol. 6, No. 2

References

^ Norman A. Macleod (1983). Is the Computer Going to Take Over from the Composer? ICCA Newsletter, Vol. 6, No. 2
^ László Lindner (1982). How the Computer Helps the Composer. ICCA Newsletter, Vol. 5, No. 2, pp. 11

What links here?

Page	Date Edited
Composer	Sep 3, 2017
Engines	Mar 10, 2018
Norman A. Macleod	Sep 3, 2017

Up one level

Gustav

GerdIsenberg — Sat, 14 May 2016 19:21:55 GMT

Home * Engines * Gustav

Gustav,
a program for solving orthodox chess problems by Olaf Jenkner, written in Delphi ^[1], program texts and manual available in German only. Initially developed since 1990 for the MS-DOS operating system in Pascal, Gustav was later ported and improved to run under Windows. Gustav is able to solve checkmate, stalemate, helpmate, helpstalemate, selfmate and selfstalemate in N moves. It has a dedicated GUI with various dialogs to edit positions, to load and save FEN or proprietary GST-files of problem collections, and to control the search. Beside brute-force search accelerated by a transposition table, several automatic or user defined constraints such as number of escape squares for the checked king, allow shallow and deep searches of up to 170 moves (339 plies). The longest for Gustav solvable problem so far has 163 moves, a composition by Ottó Titusz Bláthy ^[2]:

K7/p3p1p1/1p2p1p1/rp4B1/brpn4/Rnk5/8/4N1N1 w - -

Forum Posts

Can Alybadix or Gustav solve this studies by Uri Blass, CCC, December 10, 1998
Gustav new version ? by Michael Diosi, CCC, December 11, 1999
Delphi/Kylix Compiler by Olaf Jenkner, CCC, March 14, 2001
Gustav by Olaf Jenkner, CCC, December 08, 2003
Searching for Gustav mate solver by David Dahlem, CCC, August 02, 2011

External Links

Chess Program

GUSTAV - fastest program for orthodox selfmates and moremovers review by Václav Kotěšovec, October 6, 2009
Gustav 3.x from Schachversand Niggemann (German)

Misc

Gustav (name) from Wikipedia

References

^ Delphi/Kylix Compiler by Olaf Jenkner, CCC, March 14, 2001
^ Gustav 3.2 from Schachversand Niggemann (German)

What links here?

Page	Date Edited
Alybadix	Apr 26, 2016
Chest	Mar 3, 2015
Engines	Mar 10, 2018
Gustav	May 14, 2016
Olaf Jenkner	May 14, 2016
Popeye	Oct 11, 2017

Up one level

LL Chess

GerdIsenberg — Sat, 23 May 2015 14:23:44 GMT

Home * Engines * LL Chess

LL Chess,
a chess program with focus on solving mates written by Leonid Liberman in x86 assembly to run under DOS, last modified in May 2001, still in it's beta stage ^[1]. LL Chess represents the board as plain 8x8 mailbox. The search uses several brute-force and selective layers.

Positional Logic

The so called positional logic, the logic of material exchange between the two sides takes following point values into account, as given in Leonid's Chess Introduction ^[2].

Piece	Score
Pawn	2000
Knight	4800
Bishop	4825
Rook	9100
Queen	18000
King	80000

Forum Posts

Please, say in few words what can reduce the "branching factor" by Leonid, CCC, September 19, 1999 » Branching Factor
number of moves in position by Leonid, CCC, September 19, 1999
What is the q-search? by Leonid, CCC, January 07, 2000 » Quiescence Search
Branching factor, make me confuse more that ever by Leonid, CCC, April 01, 2000
What is the average nodes per second for minimax? by Leonid, CCC, June 15, 2000 » Nodes per second
Is the NPS tend to grow at the end of the game? by Leonid, CCC, July 22, 2000
Remember Leonid Liberman (author of LLCHESS)? by Dann Corbit, CCC, May 23, 2015

External Links

References

What links here?

Page	Date Edited
Engines	Mar 10, 2018
Leonid Liberman	May 23, 2015
LL Chess	May 23, 2015
Point Value	Mar 31, 2018

Up one Level

Mate-in-two

GerdIsenberg — Fri, 14 Oct 2016 08:23:32 GMT

Home * Engines * Mate-in-two

		Mate-in-two (Prinz' program, Robot Chess), was the very first chess playing program running on a general-purpose computer, developed in 1951 by Dietrich Prinz to solve a restricted set of mate-in-two problems. It ran on a Ferranti Mark 1, the world's first commercially available general-purpose electronic computer, which was based on the Manchester Mark 1, developed at University of Manchester.
Dietrich Prinz with Mate-in-two ^[1]

Description

The program was described by Prinz in 1952 ^[2]. It already introduced a piece-list in conjunction with a embedded mailbox board representation, albeit 10*10, since a knight move was composed of two single step moves. Move generation was done keeping a ply-indexed array of piece-list-index, direction- and step-counter. Legal move detection was implemented somewhat inefficient - the king not to move was treated as a super-piece, and with the same technique as used in move generation, the board was scanned from the king's square looping over all directions and steps, to look whether an appropriate opponent piece to move may capture. The iterative search process took up to four plies 0, 1, 2, 3. A mate in 2 was found, if after a ply-0-move, all ply-1-moves could be replied by at least one mate-in-one move, that is leave no legal moves at ply-3. There was no distinction between checkmake and stalemate, and castling, double pawn push, en passant and promotions were not implemented ^[3] .

Control Flow

This control flow diagram was given by Prinz, to demonstrate the nested iterative algorithm of the mate search. Each of the four blocks represents one ply ^[4]:

Entry 1 correspondents to the case of the first move in a turn with all the counters set to their initial value. Entry 2 is the general case of a move following a previous move of this same turn. Exit 3 indicates that a legal move has been found; exit 4 that the position supplied to the turn has been exhausted before such a move has been found.

       ▼  ┌─────◄───────────┐
      1│  │2                │
    ┌────────┐              │
    │  W  1  │              ▲
    └────────┘              │
      3│  │4   No solution  │
       ▼  └─────►           │
       │  ┌─────◄───────────~─────┐
      1│  │2                │     │
    ┌────────┐              │     │
    │  B  1  │              ▲     ▲
    └────────┘              │     │
      3│  │4   Solution     │     │
       ▼  └─────►           │     │
       │  ┌─────◄───────────~─────~─────┐
      1│  │2                │     │     │
    ┌────────┐              │     │     │
    │  W  2  │              ▲     ▲     ▲
    └────────┘              │     │     │
      3│  │4   Avoidable    │     │     │ 
       ▼  └─────►───────────┘     │     │
      1│                          │     │     
    ┌────────┐                    │     │
    │  B  2  │                    ▲     ▲
    └────────┘                    │     │
      3│  │4   Mate               │     │
       │  └─────►─────────────────┘     │
       └────────►───────────────────────┘

Copy-Make

The code of each block is shared, ply-indexing appropriate data structures of the magnetic drum within a copy-make approach. At entry 1 both the piece-list (A-tube) and square-list (B-tube) are copied to the magnetic drum, indexed by ply-index. After initializing piece-list-, direction- and step-counters and generating the first move (if any), those updated counters are saved as state for generating the next move to the drum as well. Then, at entry 2, after determining the current ply index when returning from deeper iterations, the board representation as well the state for generating the next move are restored. Consecutively, after generating the next move, the updated generation state is stored for that level again. Exit 3 increments the ply-index and toggles side to move, and makes the move to update the board accordantly for the next ply level.

Performance

One memory line of the Mark 1 Williams-Kilburn tube main memory had 20 bits, one tube 64 lines. 20 bit instructions had an address and an operator part, indexing an array of consecutive lines was done by modifying the address part of the instruction. Most Mark 1 instructions with line operand and implicit accumulator, such as 'add', 'sub', 'xor', 'and', 'or', and 'store' took about 1 ms. As reported by Prinz, the following mate-in-two position took about 15 minutes to solve with his program:

5Kbk/6pp/6P1/8/8/8/8/7R w - -

Publications

Dietrich Prinz (1952). Robot Chess. Research, Vol. 6, reprinted 1988 in Computer Chess Compendium
Dietrich Prinz (1953). The Use of General Computers for Solving Logical Problems, in Bertram Vivian Bowden (editor), Faster Than Thought, a symposium on digital computing machines
Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227

External Links

First video game - 1947–1958: Chess, from Wikipedia
Chess programs: Prinz from Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227
Ferranti Mark 1 Sales Literature (d) PROBLEMS OF LOGICAL STRUCTURE, August 1952, from Computer 50 - The University of Manchester Celebrates the Birth of the Modern Computer
The “Modern” History of Artificial Intelligence and Programs from Neuroscience Of Intelligence
Mate in Two Problem | Chess Puzzles!

References

^ Dr. Dietrich Prinz loading chess program into a Ferranti Mark I computer, 1955, Courtesy of Hulton-Deutsch Collection/CORBIS, Dietrich Prinz from History of Computer Chess, The Computer History Museum
^ Dietrich Prinz (1952). Robot Chess. Research, Vol. 6, reprinted 1988 in Computer Chess Compendium
^ Chess programs: Prinz from Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227
^ Dietrich Prinz (1952). Robot Chess. Research, Vol. 6, reprinted 1988 in Computer Chess Compendium

What links here?

Page	Date Edited
Andre Adrian	Jan 16, 2012
Checkmate	Apr 13, 2018
Computer Chess Compendium	Dec 29, 2015
Dietrich Prinz	Oct 14, 2016
El Ajedrecista	Feb 25, 2015
Engines	Mar 10, 2018
Ferranti Mark 1	Jun 2, 2015
History	Jan 2, 2018
Iteration	May 5, 2017
Mate Search	Oct 22, 2016
Mate-in-two	Oct 14, 2016
Mater	Apr 26, 2016
Move Generation	Jan 29, 2018
Tihamér Nemes	Sep 11, 2014
University of Manchester	May 24, 2017

Up one level

Mater

GerdIsenberg — Tue, 26 Apr 2016 21:01:58 GMT

Home * Engines * Mater

		Mater, a chess mating combinations program, developed in the mid 60s by George Baylor and Herbert Simon, which was subject of Baylor's Masters thesis at Carnegie Mellon University ^[1]. It was an early pioneering attempt in finding forced checkmates, employing "Artificial Intelligence" rather than "Brute-Force" ^[2]. Only moves which either put the enemy king in check (Mater I), or threaten mate in one (Mater II) were generated for the attacking side, searching those moves first which leave the minimum number of defensive replies, to eventually reduce the defender's mobility to zero.
Astrolabe, Mater and Tympan ^[3]

Abstract

This page is based on the description of Mater by George Baylor and Herbert Simon, 1966, A chess mating combinations program ^[4]:

The program reported here is not a complete chess player; it does not play games. Rather, it is a chess analyst limited to searching for checkmating combinations in positions containing tactical possibilities. A combination in chess is a series of forcing moves with sacrifice that ends with an objective advantage for the active side. A checkmating combination, then, is a combination in which that objective advantage is checkmate. Thus the program described here - dubbed MATER - given a position, proceeds by generating that class of forcing moves that put the enemy King in check or threaten mate in one move, and then by analyzing first those moves that appear most promising.

History

The original mating combination program, as conceived by Herbert Simon and his son Peter Simon in 1962 ^[5], was a hand simulation setting forth a strategy of search. It discovered mating combinations in 52 of the 129 positions collected in Fine's chapter of the mating attack from The Middlegame in Chess. Newell's and Prasad's IPL program ^[6], which could set up a chessboard, recorded positions, generated and made moves and testing their legality, was base of Mater I and in 1964 the revised Mater II programs. According to Monroe Newborn, Mater was ported to Fortran and incorporated into Cooper-Kozdrowicki program by Dennis Cooper and Ed Kozdrowicki ^[7]:

MATER is written by George Baylor and Simon in FORTRAN. It is able to search to great depths for checkmates. MATER is presently part of the Cooper-Kozdrowicki program. While MATER is an interesting program in its own right, the opportunity to checkmate one's opponent plays a relatively small computational part of the game of chess, and its inclusion in the Cooper-Kozdrowicki program does not seem to add measurably to the program's strength.

Mater I

		Only check giving moves were generated in Mater I for the attacking side and check evasions for the defending side, for each ply level put into a try-list. For the attacker, the list is ordered by the fewest-reply heuristic, highest priority goes to moves with the fewest number of legal replies, while checking moves with more than four legal replies are pruned entirely. Ties are broken by giving priority to double checks and then to checks with no capturing replies. Search only continues down a particular path so long as the opponent's mobility is on the decline, which implies a maximum search depth of 9 plies. The defender's side considers captures in MVV/LVA order first, followed by king moves and interpositions. In A chess mating combinations program, the beta-cutoff was mentioned as "killing reply" ^[8], also with a footnote ^[9] on McCarthy.'s killer heuristic referring Alan Kotok's 1962 paper ^[10], covering alpha-beta. Reuben Fine's position from The Middlegame in Chess served as one example of Mater's ability ^[11] ^[12].

Mater II

		At its first level of search, Mater II also generates moves threatening mate in one. After generation and trying checking moves without success, but triggered after collecting useful informations of "nearly" mate with only one legal reply, Mater II considers none checking moves which put additional pressure to the enemy king's sector, that is moves which directly or indirectly (x-ray) attack squares around the king. In this respect it resembles what Adriaan de Groot has called a "sample variation" ^[13], a kind of trial balloon sent up for the express purpose of gathering information to direct subsequent investigations. A further condition to finally add the move into the try-list is that after the move is internally made followed by a defender's null move, the resulting position is mate in one. Now, the defender's move ordering heuristic needs to prefer moves that defend the mating square. Fine's diagram 97 ^[14] was given as example of the abilities of Mater II.

Board Representation

Mater was written in IPL V with its primary data structure of a list, and kept lists with a header (name) and attribute-value pairs for each square and piece to represent the board, where values for piece and square attributes are addresses (cells) of lists again, yielding in an extensive network of relations among squares and pieces:

Name	Attribut	Value
H1	Man on square	M8
	North	H2
	West	G1
	WNW	F2
	NW	G2
	NNW	G3
...	...	...
M8	Man on what square	H1
	Type of man	Rook
	Color of man	White
	Move directions	list of directions
	Capture directions	list of directions
...	...	...

Move Generation

In A chess mating combinations program, Baylor and Simon further elaborate on move generation, with two tacks, corresponding to a one-many or many-one approach. In trying to find all checking moves, one could either radiate out from the enemy king, and for each square, search for a piece that can get there and check (one-many), or converge from the squares along the move directions of each attacking piece onto the enemy king's square (many-one). If there are many pieces on the board, the former tends to be more effective, if few, the latter.

Processing Speed

Mater was written in an interpretive language IPL, without any attempts to provide a special machine-language representation for primitive board manipulation. The most difficult mates, requiring the examination of about 100 positions, were achieved in about 3 minutes on an IBM 7090 ^[15].

Namesake

Mater by Valentin Albillo ^[16]

Publications

Herbert A. Simon, Peter A. Simon (1962). Trial and Error Search in Solving Difficult Problems: Evidence from the Game of Chess. Behavioral Science, Vol. 7, No. 4, pp. 425-429
George W. Baylor (1965). Report on a Mating Combinations Program. SDC Paper, No. SP-2150, System Development Corporation, Santa Monica, Calif.
George W. Baylor, Herbert A. Simon (1966). A chess mating combinations program. AFIPS Joint Computer Conferences, reprinted in Herbert A. Simon (1979). Models of Thought. Yale University Press, pp. 181-200, in David Levy (ed.) (1988). Computer Chess Compendium.
George W. Baylor (1966). A Computer Model of Checkmating Behaviour in Chess. in Adriaan de Groot, Walter R. Reitman (eds.) (1966). Heuristic Processes in Thinking. International Congress of Psychology, Nauka, Moscow
Herbert Simon (1973). Lessons from Perception for Chess-Playing Programs (and Vice Versa). Computer Science Research Review 1972-73, pdf
Herbert Simon, William Chase (1973). Skill in Chess. American Scientist, Vol. 61, No. 4, reprinted in David Levy (ed.) (1988) Computer Chess Compendium, pdf
Max Bramer (1982). Finding Checkmates. Computer & Video Games, Spring 1982, pdf hosted by Mike Watters

External Links

References

^ George Baylor in All Remembrance of Herbert A. Simon
^ Max Bramer (1982). Finding Checkmates. Computer & Video Games, Spring 1982, pdf hosted by Mike Watters
^ One of four extant brass astrolabes manufactured by the workshop of Georg Hartmann in Nuremberg in 1537. This one part of the Scientific Instruments Collection of Yale University's Peabody Museum of Natural History, Yale's Hartmann astrolabe.jpg - Wikimedia Commons
^ George W. Baylor, Herbert A. Simon (1966). A chess mating combinations program. AFIPS Joint Computer Conferences
^ Herbert A. Simon, Peter A. Simon (1962). Trial and Error Search in Solving Difficult Problems: Evidence from the Game of Chess. Behavioral Science, Vol. 7, No. 4, pp. 425-429
^ Allen Newell, N. S. Prasad (1963). IPL-V Chess Position Program. Internal Memo No. 63, Carnegie Mellon University
^ Monroe Newborn (1975). Computer Chess. Academic Press, New York, N.Y. p. 26
^ "this (Move ordering) is an attempt to clip unnecessary proliferations in the move tree: if there is a "killing" reply to a checking move, further analysis of that checking move would seem futile" from 4. The Executive and Heuristics of Search in George W. Baylor, Herbert A. Simon (1966). A chess mating combinations program. AFIPS Joint Computer Conferences
^ "This is the minimax assumption: namely that the opponent will make his strongest reply at every opportunity. McCarthy.'s killer heuristic (see Kotok, 1962) assumes that a killing reply to one checking move may be a killing reply to other checking moves and thus should be looked at first" from 4. The Executive and Heuristics of Search in George W. Baylor, Herbert A. Simon (1966). A chess mating combinations program. AFIPS Joint Computer Conferences
^ Alan Kotok (1962). Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program. pdf
^ Reuben Fine (1952). The Middlegame in Chess. McKay
^ r1bk2nr/p2p1pNp/n2B4/1p1NP2P/6P1/3P1Q2/P1P1K3/q5b1 w - - 0 1 ; Fine 1952, chess/BWTC.PGN at master · wspeirs/chess · GitHub
^ Adriaan de Groot (1946). Het denken van den Schaker, een experimenteel-psychologische studie. Ph.D. thesis, University of Amsterdam, advisor Géza Révész; N.V. Noord-Hollandse Uitgevers Maatschappij, Amsterdam. Translated with the help of George Baylor, with additions, (in 1965) as Thought and Choice in Chess. Mouton Publishers, The Hague. ISBN 90-279-7914-6.
^ r1b2qrk/pp3p1p/4pPpQ/8/8/5N2/P4PPP/3R2KR w - - 0 1 ; Fine 1952, chess/BWTC.PGN at master · wspeirs/chess · GitHub
^ George W. Baylor, Herbert A. Simon (1966). A chess mating combinations program. AFIPS Joint Computer Conferences - Processing Speed
^ MATER === A simple Mate Searching Program by José Antônio Fabiano Mendes, CCC, January 24, 2001

What links here?

Page	Date Edited
Carnegie Mellon University	Feb 12, 2018
Checkmate	Apr 13, 2018
CHREST	May 6, 2016
Coko	Jul 13, 2015
Engines	Mar 10, 2018
George Baylor	Sep 22, 2014
Herbert Simon	Feb 11, 2016
IBM 7090	Jan 19, 2018
MAPP	Jan 30, 2016
Mate Search	Oct 22, 2016
Mate-in-two	Oct 14, 2016
Mater	Apr 26, 2016
Max Bramer	May 20, 2014
Michael Barenfeld	Oct 2, 2014
MVV-LVA	Oct 26, 2017
NSS	Jul 14, 2015
Null Move Pruning	Dec 2, 2017
Perceiver	Nov 21, 2017
Threat Move	Sep 10, 2017

Up one Level

Popeye

GerdIsenberg — Wed, 11 Oct 2017 19:34:04 GMT

Home * Engines * Popeye

		Popeye, an open source program for solving orthodox and heterodox ^[1] chess problems. The original author of Popeye was Philippe Schnoebelen who wrote it in Pascal under MS-DOS in 1983. The code was later donated in the spirit of the free software movement. Elmar Bartel, Norbert Geissler, Thomas Maeder, Torsten Linß, Stefan Hoening, Stefan Brunzen, Harald Denker, Thomas Bark and Stephen Emmerson, converted Popeye to C, and now maintain the program ^[2] . Popeye has a command-line interface and can be used with several operating systems. It can be connected to various GUIs ^[3], notably APwin by Paul Wiereyn ^[4], Fancy by Marek Kwiatkowski ^[5], or Ankona, a web-based application written by Ilja Ketris ^[6]. PopeyeUCI ^[7] by Franz Huber can run under any UCI compatible GUI ^[8] .
Let's blast'em ^[9]

Forum Posts

Re: Popeye program (hey Dann) by Dann Corbit, CCC, September 07, 1999
Mate solvers... by Dann Corbit, CCC, September 07, 1999
New version: Popeye 4.59 (28th December 2011) by Jesús Muñoz, CCC, December 29, 2011

External Links

Chess Program

Misc

References

^ heterodox problem | chess composition | Encyclopedia Britannica
^ Popeye - from Software for handling chess problems, Wikipedia
^ Marián Križovenský (2013). 5+1 Popeye shells. (pdf)
^ APwin v2012 + Popeye
^ Software - WFCC
^ Ankona | chess problems: create, store, share, solve
^ fhubs jimdo page!
^ Update: Euclide 0.94 released by Michael Diosi, CCC, September 09, 2009
^ "Let's blast'em Japanazis! Buy war stamps here now", Record creator: Office for Emergency Management. Office of War Information. Domestic Operations Branch. Bureau of Special Services. (03/09/1943 - 09/15/1945), Source: National Archives and Records Administration, World War II US propaganda poster against the axis powers Empire of Japan and Nazi Germany (Japanazis) that promotes the purchase of war stamps, based on a Popeye image by E. C. Segar, Wikimedia Commons, Popeye – Wikipedia.de (German)

What links here?

Page	Date Edited
Alybadix	Apr 26, 2016
APwin	Oct 12, 2017
Chest	Mar 3, 2015
Engines	Mar 10, 2018
Gustav	May 14, 2016
Marek Kwiatkowski	Oct 22, 2017
Mate Search	Oct 22, 2016
Mathematician	Apr 9, 2018
Paul Wiereyn	Jun 4, 2015
Popeye	Oct 11, 2017
Torsten Linß	Nov 8, 2016

Up one level

Wikispaces : chessprogramming - items matching description

Alybadix

Table of Contents

See also

Forum Posts

External Links

References

What links here?

Chest

Table of Contents

Description

Search

Board Representation

See also

Forum Posts

1999

2000 ...

2005 ...

2010 ...

External Links

References

What links here?

Composer

Table of Contents

Description

Sample Composition

Publications

References

What links here?

Gustav

Table of Contents

See also

Forum Posts

External Links

Chess Program

Misc

References

What links here?

LL Chess

Table of Contents

Positional Logic

Forum Posts

External Links

References

What links here?

Mate-in-two

Table of Contents

Description

Control Flow

Copy-Make

Performance

See also

Publications

External Links

References

What links here?

Mater

Table of Contents

Abstract

History

Mater I

Mater II

Board Representation

Move Generation

Processing Speed

Namesake

See also

Publications

External Links

References

What links here?

Popeye

Table of Contents

See also

Forum Posts

External Links

Chess Program

Misc

References

What links here?