Author: Omid David
Date: 08:30:21 10/04/02
Go up one level in this thread
On October 04, 2002 at 11:26:11, Uri Blass wrote: >On October 04, 2002 at 11:22:05, Vincent Diepeveen wrote: > >>On October 04, 2002 at 10:34:43, Omid David wrote: >> >>had fritz implemented such a scheme it would play 300 points weaker >>anyway. > >No > >You assume that inmplementing knowldge mean using it in every node. > >It is possible to use knowledge only when the remaining depth is big enough. > >The idea of the knowledge is to stop the search when a draw position happens and >return draw score. > >I do not see the risk in it if 100% of the positions that you detect as drawn >are draws and if you only use it when the remaining depth is big enough then it >is not going to do the program 300 elo weaker. Exactly. I don't have to care about its risks, since it returns 100% reliable results. But what I do have to care about, is an efficient application of the heuristic, so that its impact on the whole search speed be negligible. Omid. > >Uri
This page took 0.01 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.