Chessterfield

From Chessprogramming wiki
Jump to: navigation, search

Home * Engines * Chessterfield

Chessterfield,
a family of chess engines by Matthias Lüscher, written in C++, first released in April 1998. The free native Chessterfield comes with an own GUI, the experimental WinBoard compliant ChessterfieldCL along with its learning utility ChessterfieldEN is open source published under the GNU General Public Licence V2 [1]. Chessterfield applies alpha-beta with transposition table, null move pruning, razoring and various extensions inside an aspirated iterative deepening loop.

Screenshot

ChessterfieldGUImansfield.gif

Chessterfield GUI [2]

ChessterfieldCL

While affiliated with ETH Zurich, inspired by Michael Buro's CG 1998 paper From Simple Features to Sophisticated Evaluation Functions [3], covering not only automated parameter tuning but a procedure for exploring the feature space able to discover new features in a computational feasible way, Matthias Lüscher implemented Buro's General Linear Evaluation Model (GLEM) inside ChessterfieldCL, using a three-layer neural network as evaluation function - documented in his technical report under supervision of Thomas Lincke and Christoph Wirth [4]. Christoph Wirth's endgame tablebases [5] were used to verify the effectiveness of the trained evaluation function in particular endgames [6].

See also

Publications

Forum Posts

External Links

Chess Engine

Chesterfield

References

  1. ChessterfieldCL Download
  2. Chessterfield GUI screenshot
  3. Michael Buro (1998). From Simple Features to Sophisticated Evaluation Functions. CG 1998, pdf
  4. Matthias Lüscher (2000). Automatic Generation of an Evaluation Function for Chess Endgames. ETH Zurich Supervisors: Thomas Lincke and Christoph Wirth, pdf
  5. Christoph Wirth, Jürg Nievergelt (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. ICCA Journal, Vol. 22, No. 2
  6. Chris Wirth's endgame tablebases by Denis P. Mendoza, CCRL Endgame Tablebases, December 13, 2007

Up one level