Changes

a chess program by [[Andrew Williams]], supporting the [[Chess Engine Communication Protocol]] <ref>[https://www.stmintz.com/ccc/index.php?id=70677 Re: Green List, PostModernist??] by [[Andrew Williams]], [[CCC]], September 27, 1999</ref> to run under [[Linux]] and [[Windows]] platforms <ref>[https://www.stmintz.com/ccc/index.php?id=307830 PostModernist (v1003) available for download] by [[Andrew Williams]], [[CCC]], July 24, 2003</ref>. PostModernist uses [[MTD(f)]] to drive its [[Search|search]]<ref>[https://www.stmintz.com/ccc/index.php?id=60833 Building the Principal Variation in MTD(f) searches] by [[Andrew Williams]], [[CCC]], July 18, 1999</ref>, its [[Transposition Table|transposition table]] entries contain [[Upper Bound|upper]] and a [[Lower Bound|lower bound]] scores. As the search progresses, the gap between the bounds is narrowed until they meet, being the [[Exact Score|exact score]] for the position. It further applies [[Iterative Deepening|iterative deepening]], [[Null Move Pruning|null move pruning]], [[Enhanced Transposition Cutoff|ETC]] and [[Futility Pruning#Extendedfutilityprunning|extended futility pruning]], and uses separate [[Evaluation Hash Table|evaluation hash table]] and [[Pawn Hash Table|pawn evaluation hash table]], and probes [[Nalimov Tablebases|Nalimov endgame tablebases]] <ref>README file for PostModernist, June 28, 2006</ref>. PostModernist played the [[WCCC 2002]], and various [[CCT Tournaments]].