Difference between revisions of "TDChess"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * Engines * TDChess''' '''TDChess'''<br/> a chess program by Jonathan Baxter based on KnightCap and its Temporal Difference Learning|TD le...")
 
Line 5: Line 5:
  
 
=See also=
 
=See also=
* [[Various Classifications#Acronym|Acronym]]
 
 
* [[KnightCap]]
 
* [[KnightCap]]
 
* [[Temporal Difference Learning]]
 
* [[Temporal Difference Learning]]
Line 15: Line 14:
 
=References=  
 
=References=  
 
<references />
 
<references />
 
 
'''[[Engines|Up one Level]]'''
 
'''[[Engines|Up one Level]]'''
 +
[[Category:Acronym]]

Revision as of 13:18, 26 October 2018

Home * Engines * TDChess

TDChess
a chess program by Jonathan Baxter based on KnightCap and its TD learning adaption for minimax search in chess, TDLeaf. As mentioned by Jonathan, TDChess is about 5-6 times faster in nodes per second than KnightCap. KnightCap had a really complicated evaluation which he had "dumbed down" a lot to get more speed. He also changed the search a fair bit, including how it does move ordering now on the basis of a static exchange evaluation, and how quiescence works. The sorting of moves has become lot faster due to sorting on demand. Also the book learning is very different from the original KnightCap [1]. TDChess won the NC3 1999 Australasian National Computer Chess Championship [2].

See also

Forum Posts

Re: TDchess discussion by Jonathan Baxter, CCC, February 03, 1999

References

Up one Level