Detailed inner works of Rebel
Evaluation Tuning via Ordinal Correlation.
Evaluation Tuning via Learning.
Proof Number Search in Chess
Risk Management in Game-Tree Pruning by Y. Björnsson and T.A. Marsland
Multi-Cut A/B Pruning in Game-Tree Search
ProbCut & Multi Cut in Crafty by A.X. Jiang.
Tutorial how to write a chess program.
Selective Depth-First Search Methods by Yngvi Björnsson and Tony Marsland
Some Aspects Of Chess Programming.
Learning Control of Search Extensions by Yngvi Björnsson and Tony Marsland
Master's Thesis by Marcel Kervinck about Rookie 2.0.
|Verified Nullmove Pruning
by Omid David Tabibi.
A New Approach to Draw Detection by Move Repetition by Vladan Vuckovic and Djordje Vidanovic.
Information in Transposition Tables by Dennis Breuker, Jos Uiterwijk en Jaap van den Herik.
Replacements schemes for Transposition Tables.
Deep Thought Evaluation Tuning.
|Memory vs Search in Games|
Memory vs Search in Games, thesis Dennis Breuker.
A fully distributed chess program by Reinier Feldmann.
A Self-Learning Evolutionary Chess Program by David Fogel.
|Evaluating Chess Strength|
Concepts for Evaluating Chess Strength by Hans Berliner.
by Ernst Heinz.
Aplha-Beta Conspiracy Search by David McAllester and Deniz Yuret.
|Sibling Prediction Pruning
Alpha-Beta with Sibling Prediction Pruning in Chess by Jeroen Carolus.
|Another Search Algorithm.|
An Algorithm faster than negascout and SSS in pratice by Aske Plaat.
|Classic from 1983
An improvement to the scout tree search algorithm by Alexander Reinefeld.
Automatic Generation of an Evaluation Function for Chess Endgames by Matthias Lüscher.
Blockage Detection in King and Pawn Endings by Omid David Tabibi.
|Probability Based Search|
B-Star Probability Based Search by Hans Berliner.
|Fail high reductions
Classic from 1996 by Rainier Feldmann.
|Fuzzy Chess Tactics|
by Joäo Paulo Carvalho.
Deep blue system overview by Feng-hsiung Hsu and Murray Campbell.
Fuzzy Numbers in Search to Express Uncertainty by Andreas Junghanns.
|Knowledge from Databases
Knowledge discovery in chess databases - a research proposal by Johannes Fürnkranz.
Knowledge discovery in Deep Blue by Murray Campbell.
|Proof Number Search
Mate in 38 - applying proof number search to chess by Dennis Breuker.
|Parallel Search (1)|
Parallel Alpha-Beta Search by Valavan Manohararajah.
|Parallel Search (2)
Parallel randomized best-first minimax search by Yaron Shoham and Sivan Toledo.
|Parallel Search in Cilk
Programming parallel applications in Cilk by Aske Plaat.
Relevance Cuts-Localizing the Search by Jonathan Schaeffer.
Research re search & re-search by Aske Plaat.
|Search with fuzzy numbers|
by Andreas Junghanns, Christian Posthoff and Michael Schlosser.
Searching with uncertainty cut-offs by Tony Marsland and others.
The chess monster Hydra by Chrilly Donninger and Ulf Lorenz.
|Random Error Evaluations
The secret of selective game tree search when using random error evaluations.
The StarTech Massively Parallel Chess Program by Bradley Kuszmaul.
About this PageYou need the Adobe Reader to view and/or download most of the material.
With thanks to Nicola Rizzuti from the Mizar pages. Over there you will find a lot more articles.
Deep Blue PapersDeep Thought Evaluation Tuning.
Deep Blue system overview by Feng-hsiung Hsu and Murray Campbell.
Deep Blue article 2001.
Deep Blue Knowledge discovery in Deep Blue by Murray Campbell.
Classic PapersACM 1993 Tournament bulletin of the famous ACM computer chess tournament.
History of Computer Chess from the American point of view. Nevertheless this web-site about the history of the computer is well worth a visit.