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. Protector uses a pool of threads to perform a parallel search loosely synchronized by a shared hash table. 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. Protector is bitboard based and applies Lasse Hansen's plain magic bitboards to determine sliding piece attacks. WCSC 2015, round 2, Harvey Williamson and Timo Haupt in Protector vs.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |