Author: Uri Blass
Date: 05:06:37 12/30/01
Go up one level in this thread
On December 30, 2001 at 07:54:08, Sune Fischer wrote: >On December 30, 2001 at 04:46:01, Uri Blass wrote: > >>>I'm not sure, I'm doing exactly what Bruce has explained here: >>>http://www.seanet.com/~brucemo/topics/quiescent.htm >> >>The algorithm as described there make unnecessary moves. >> >>I evaluate moves before I make them and the algorithm that is described does not >>do it. > >How is that possible, don't you need the attack boards to do the eval? >Is it a very simple eval perhaps? For now it is a very simple eval It will get improved but even after it I can get a bound without the attack tables > >>For me makemove and generating all the attack tables cost time so I prefer to do >>it only after verifying that the capture is good enough. > >Why not update the attack boards _before_ generating moves, then you have a fast >makemove that you can do at the leaf too. The problem is that updating the attack tables is most of the time of the makemove so it is not going to save much. > I have no choice but to do the move >before evaluation or else I would simply not evaluate the right position, you >too must be doing some sort of move I think. The tactical change can be evaluated easily and the positional change has a bound so you still can see if a capture is not good enough. Uri
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.