PostModernist - peregrineshahin/ChessProgrammingWiki GitHub Wiki


title: PostModernist

Home * Engines * PostModernist

[ Lawrence Weiner, Bits & Pieces ... [1] [2] PostModernist,

a chess program by Andrew Williams, supporting the Chess Engine Communication Protocol [3] to run under Linux and Windows platforms [4]. PostModernist uses MTD(f) to drive its search [5], its transposition table entries contain upper and a lower bound scores. As the search progresses, the gap between the bounds is narrowed until they meet, being the exact score for the position. It further applies iterative deepening, null move pruning, ETC and extended futility pruning, and uses separate evaluation hash table and pawn evaluation hash table, and probes Nalimov endgame tablebases [6]. PostModernist played the WCCC 2002, and various CCT Tournaments.

Forum Posts

External Links

Chess Engine

Misc

References

  1. โ†‘ Lawrence Weiner, Bits & Pieces Put Together to Present a Semblance of a Whole, Walker Art Center, Minneapolis, 2005
  2. โ†‘ Postmodern art from Wikipedia
  3. โ†‘ Re: Green List, PostModernist?? by Andrew Williams, CCC, September 27, 1999
  4. โ†‘ PostModernist (v1003) available for download by Andrew Williams, CCC, July 24, 2003
  5. โ†‘ Building the Principal Variation in MTD(f) searches by Andrew Williams, CCC, July 18, 1999
  6. โ†‘ README file for PostModernist, June 28, 2006
  7. โ†‘ Maastricht 2002 - Chess - Round 9 - Game 5 (ICGA Tournaments)

Up one Level