Author: Nathan Thom
Date: 22:06:06 02/11/03
Go up one level in this thread
On February 11, 2003 at 20:57:16, Nathan Thom wrote: >Ive just finished implementing a Q search for LittleThought, and was trying to >get a feel for my node stats compared with other engines out there. What % of >the total nodes searched are Q nodes in varying kinds of positions? eg opening, >middle game, end game etc. > >I have a feeling my q nodes are way way too many :) In alot of examples ive seen, an evaluation is done right at the start of the Q function and if it gives a beta cutoff it returns. I dont understand this. Isnt the whole point of Q search to prevent scoring unstable positions? If the score for this position exceeds beta, it may be that it just did QxQ say. That will give a large eval as one side just lost the Q but the other still has theirs. But, if the Q search had a chance to continue, it would see that the Q can be recaptured immediately. What gives?
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.