Home * Engines * Cheng

Cheng,
an UCI compliant open source chess engine by Martin Sedlak, written in C++ as exercise in generic programming, first released as Cheng3 in April 2011. Cheng is able to play Chess960, target platforms are Windows, Linux, Mac OS and Android systems [1].

Description

Cheng [2] is a bitboard engine using fancy magic bitboards to determine sliding piece attacks. It applies staged move generation.

Search

The parallel multi-threaded search performs PVS alpha-beta with a shared transposition table inside a fractional ply iterative deepening framework with aspiration windows, featuring Lazy SMP [3]. Search routines are instantiated at compile time from a generic routine with three boolean template parameters, PV-node, in check, and null move pruning on-off, similar quiescence search has four instances for on-off combinations of PV-node and check. Further selectivity is applied by mate distance pruning, razoring, IID, futility pruning, check extensions and late move reductions. Move ordering is improved by the killer- and history heuristic.

Evaluation

Evaluation employs three further hash tables - evaluation hash table, material hash table and pawn hash table. The evaluation function determines hardware population count support at compile time, passed as template parameter to internal eval functions, finally adding a tempo bonus. Pawn and piece specific evaluators are further implemented with a color template, considering pawn structure, mobility, king safety and various piece pattern. Most of the gain in Cheng 4 0.38, reelased in January 2015, is due to eval tuning using the Texel's Tuning Method by Peter Österlund [4].

Forum Posts

2011

2012 ...

2014 ...


External Links

Chess Engine

Misc


References

  1. ^ UCI and XBoard Engines for Android by Aart Bik
  2. ^ Description based on Cheng4 036c
  3. ^ Lazy SMP in Cheng by Martin Sedlak, CCC, February 02, 2015
  4. ^ cheng4 0.38 release by Martin Sedlak, CCC, January 18, 2015

What links here?


Up one level