Changes

GromitChess is a [[Cpp|C++]]-program, developed in a [[Linux]]-environment (Emacs, gcc). It searches about 25000 to 50000 [[Nodes per Second|nodes per second]] on a K6/200 and tries to be intelligent rather than fast. [[Attack and Defend Maps|Attacktables]] are the primary datastructure ([[[Piece-Sets|16 bit]] for every square and player; bit n is set if piece n attacks the square). The search uses [[Iterative Deepening|iterative deepening]], [[Principal Variation Search|PVS]], [[Transposition Table|transposition tables]], [[Killer Heuristic|killer]]- and [[History Heuristic|history heuristic]], [[Null Move Pruning|nullmove]] ([[Depth Reduction R|R]]=2), about 10 chess-specific [[Extensions|extensions]] and some [[Pruning|pruning heuristics]]. The [[Quiescence Search|quiescence]] uses a [[Static Exchange Evaluation|static exchange evaluator]] and includes some checks and other threatening moves. Parts of the [[Evaluation|evaluation]] are initialized at the [[Root|root]] but most of the work is done at the [[Leaf Node|leafnodes]]. You can find more information and executables in the WWW.