Author: Vincent Diepeveen
Date: 06:42:09 12/12/02
Go up one level in this thread
On December 11, 2002 at 15:01:39, Nicolas GUIBERT wrote: >>also in draughts a good evaluation should take care that you search >>more efficient, so adding lazy evaluation in those few positions where >>sometimes it helps to lazy eval and in like 1% of the situations it >>doesn't, it should mean that you get a smaller cutoff, which means >>in short that you search less efficient, so you should waste more nodes >>searching to the same depth with lazy evaluation where the % overhead is >>bigger than the efficiency win for evaluating without lazy eval. > >I don't understand. Could you say it differently ? > >>My guess is you should start fixing hashtable :) > >Maybe :o) Ok let's say it a bit more rude. A big evaluation in a very efficient program should never profit from lazy evaluation. If so then you have either no big evaluation or a very inefficient searching program. Best regards, Vincent
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.