Author: Paul
Date: 12:09:24 11/13/01
Go up one level in this thread
On November 12, 2001 at 18:37:39, Dan Andersson wrote: >I use something similar. I call it table rules, where the rules encode domain >specific knowledge. When I get an interior node recognized, the retrieved result >might also be a compressed representation of an algorithm, stricter search >limit, new eval or whatever. The tricky part is finding cases that are worth >encoding. > >MvH Dan Andersson Have you written a book about it yet? Where can I get it ... ;) Paul
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.