Changes

[[FILE:Wallace, Gromit, and creator Nick Park.jpg|border|right|thumb|280px| [https://en.wikipedia.org/wiki/Wallace_and_Gromit Gromit, Wallace], and creator [https://en.wikipedia.org/wiki/Nick_Park Nick Park] <ref>Creator [https://en.wikipedia.org/wiki/Nick_Park Nick Park] with his characters in 2005 promoting [https://en.wikipedia.org/wiki/Wallace_%26_Gromit:_The_Curse_of_the_Were-Rabbit Wallace & Gromit: The Curse of the Were-Rabbit], [https://commons.wikimedia.org/wiki/File:Wallace,_Gromit,_and_creator_Nick_Park.jpg Photo] by [https://www.flickr.com/photos/43671133974@N01 Sam Felder], September 19, 2005, originally posted on [https://en.wikipedia.org/wiki/Flickr Flickr], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [https://creativecommons.org/licenses/by-sa/2.0/deed.en CC BY-SA 2.0]</ref> ]]

Gromit and GromitChess played several [[IPCCC|IPCCCs]], the [[WMCCC 1995]], [[WCCC 1999]] in Paderborn and the [[WMCCC 2001]] in Maastricht, where it won the title of the Amateur World Microcomputer Chess Champion. Early versions (1.2) were standalone engines with an own [[GUI]], later versions (> 2.0) were [[WinBoard]]/[[XBoard]] compatible, a dedicated version (3.1) was commercially released as sold along with other [[ChessBase#YoungTalents|Young TalentTalents]] by [[ChessBase]] , running under the their [[ChessBase (Database)|Database]] or [[Fritz#FritzGUI|Fritz6 Fritz GUI]] <ref>[https://www.stmintz.com/ccc/index.php?id=207034 Re: Anyone using the Gromit engine?] by [[Frank Schneider]], [[CCC]], January 13, 2002</ref>. GromitChess (3.10.3) emphasized its ambitions going commercial ambitions while incorporated into the [[PocketGrandmaster]] for [[Pocket PC]] <ref>[https://www.stmintz.com/ccc/index.php?id=202624 PocketGrandmaster 1.1 released] by [[Frank Schneider]], [[CCC]], December 19, 2001</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=240495 Re: Is Gromit 3.9.5 is out?] by [[Frank Schneider]], [[CCC]], July 14, 2002</ref>, and became predecessor of [[Anaconda]].

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.