Поддержка многоядерности (4 CPU) Поддержка таблиц Налимова (32 MB hash) MultiPV
Полный список:
* Bitboard based * Support only the UCI-protocol * Draw rules with 3 fold repetition, 50 moves , insufficient material * Theoritical drawish positions * Hash tables for searching , pawn hash structures * Setup positions in FEN format * Time management for x time in y moves , x time for hole game and with incremental clock * Searching with Iteration depth with aspitration window, root search , PV , zero window search, quiesce * Dynamic null move pruning , verification search, static null move pruning * Internal iterative deepening at PV and Zero Window * Extensions with checking move , single reply, recapture, pawn push to rank 7, mate threat. * Razoring, dynamic history reduce moves, history pruning, futulity pruning. * Move ordering with hash move, killer moves, history depth, captures with SEE and MVV/LVA * Minimax quiesce search with futility pruning, pruning losing captures with SEE score < 0 * Lazy evaluate * Permanent brain * Chess960 / fisherrandom /FRC support * SMP support up to with 4 cores. * Limit strength from 1000 - 2400 ELO * Multi pv analyse mode * Using nalimov tablebases in endgames * Own book, make and add own book from PGN games, book learning * windows 32 bit and 64 bit compiled.