Protector participated at the TCEC Season 6, the TCEC Season 7, and over the board the WCCC 2015 and WCSC 2015 in Leiden, operated by Timo Haupt, who was also responsible for the book lines. At the WCCC, Protector played strongly and shared the third place with Hiarcs with 5/8, only losing from Komodo. At the uniform hardware WCSC Protector also shared the third place, now with Komodo, both 4½/7, behind Shredder and Ginkgo.
The evaluation caches pawn structure and king safety stuff in thread local hash tables. Opening and endgame scores of various features are computed and aggregated speculatively and finally interpolated by a tapered eval on the current game phase.
^ Thank you! (Gerd Isenberg, March 16, 2013) My own contribution to Magic Bitboards was the line-wise forerunner, dubbed Kindergarten Bitboards, also tried with "random" factors, while Lasse Hansen had the idea to hash both lines simultaneously. I was initially skeptical whether the huge tables pay off.
an UCI compliant open source chess engine written by Raimund Heid in C, distributed under the GNU General Public License GPL. Protector already started its life in early 2000 [1] , and over the time incorporated many public ideas and techniques known from other open source programs, notably Crafty, Fruit, Toga, Glaurung/Stockfish and Robbolito. It can be compiled to run under Windows, Linux and Mac OS. Protector is incorporated in the cluster chess project GridProtector by Kai Himstedt which had its debut at PT 49.
Table of Contents
Tournament Play
Protector participated at the TCEC Season 6, the TCEC Season 7, and over the board the WCCC 2015 and WCSC 2015 in Leiden, operated by Timo Haupt, who was also responsible for the book lines. At the WCCC, Protector played strongly and shared the third place with Hiarcs with 5/8, only losing from Komodo. At the uniform hardware WCSC Protector also shared the third place, now with Komodo, both 4½/7, behind Shredder and Ginkgo.Photos & Games
WCCC 2015
WCSC 2015
Description
Move Generation
Protector is bitboard based and applies Lasse Hansen's plain magic bitboards to determine sliding piece attacks. Staged move generation considers PV- and hash move, winning captures and up to four killers early, and otherwise orders captures by SEE and quiet moves by the history heuristic and various static move properties.Search
Protector uses a pool of threads to perform a parallel search loosely synchronized by a shared hash table. The serial principal variation search with null move pruning and verification, razoring, futility pruning, late move reductions, IID, check- and restricted singular extensions is embedded inside the common iterative deepening frame with aspiration.Evaluation
The evaluation caches pawn structure and king safety stuff in thread local hash tables. Opening and endgame scores of various features are computed and aggregated speculatively and finally interpolated by a tapered eval on the current game phase.Acknowledgment
from Protector's readme.txt file [4]See also
Forum Posts
2009
2010 ...
2015 ...
External Links
Chess Engine
Misc
Protector (novel) from Wikipedia
Pak Protector from Wikipedia
References
What links here?
Up one Level