Author: Chris Whittington
Date: 05:09:22 10/21/97
Go up one level in this thread
On October 20, 1997 at 20:09:25, Robert Hyatt wrote: >On October 20, 1997 at 13:28:03, Willie Wood wrote: > >> >>On October 20, 1997 at 08:52:02, Chris Whittington wrote: >> >>> >>>Of course this is all gobbledegook for the fast/crafty/fritz paradigm >>>since they (a) don't exchange evaluate and (b) have anything remotely >>>like a pruning function operating over the higher plies. Gobbeldegook >>>for the 'programmer-programmers', perfect sense for the 'chess >>>player-programmers' :) >>> >>>Chris Whittington >>> >>> >> >> >>Bob has said he uses a SEE. In what sense do you mean that crafty >>doesn't exchange evaluate? >> >>WW > >I think he means to use the SEE routine *in place* of a tree search >below >that node. I did this in the pre chess 4.x days, in a program called >"blitz" >which did a normal non-capture search, and then used the SEE routine at >most >endpoints rather than a traditional capture search. Was done because of >speed, >but it definitely had tactical problems with pins and overloaded >pieces... Yes, you need to attend to these in the eval function if you're not to get into nasty trouble on the material loss front. A knowledge program does have the option to use the SEE within the eval. Fast programs don't. Fast programs are pretty much forced to use a capture search. Its an area where there is a beneficial trade off from using the knowledge; depending on the seacrh explosion factor from the capture search, a little increase in time per node for a knowledge program can result in a substantial reduction in total nodes searched. Chris
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.