Changes

a chess program by [[Jonathan Baxter]] based on [[KnightCap]] and its [[Temporal Difference Learning|TD learning]] adaption for [[Minimax|minimax]] search in chess, [[Temporal Difference Learning#TDLeaf|TDLeaf]]. As mentioned by Jonathan, TDChess is about 5-6 times faster in [[Nodes per secondSecond|nodes per second]] than KnightCap. KnightCap had a really complicated [[Evaluation|evaluation]] which he had "dumbed down" a lot to get more speed. He also changed the [[Search|search]] a fair bit, including how it does [[Move Ordering|move ordering]] now on the basis of a [[Static Exchange Evaluation|static exchange evaluation]], and how [[Quiescence Search|quiescence]] works. The sorting of moves has become lot faster due to sorting on demand. Also the [[Book Learning|book learning]] is very different from the original KnightCap <ref>[https://www.stmintz.com/ccc/index.php?id=42099 Re: TDchess discussion] by [[Jonathan Baxter]], [[CCC]], February 03, 1999</ref>. TDChess won the [[NC3 1999]] [[Australasian National Computer Chess Championship]] <ref>[https://www.stmintz.com/ccc/index.php?id=87251 Re: Australian-ch, questions !] by [[David Blackman]], [[CCC]], January 09, 2000</ref>.