Author: Nicolas GUIBERT
Date: 12:01:39 12/11/02
Go up one level in this thread
>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)
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.