Author: Gian-Carlo Pascutto
Date: 10:14:50 02/02/00
Go up one level in this thread
On February 01, 2000 at 07:56:19, Jan Pernicka wrote: > Hi, > I would like to know what's the ratio (approximately) n/m, where > n = #nodes visited by exhaustive search (i.e. they were not chosen > by selective algorhitms) > m = #nodes visited by selective search(i.e. others) > (ok - 1 node could be in both groups - the search depth to the horizon > could decrease by "real number") > > Nodes visited by quiescence search I include into the 2nd group (of course). > How is it with your (or your favourite) chess program. I would expect > it to be 3:1 but it's only a guess It'll be over 1:1 if you count quiescence search in group 2. You have at least one quiscent node for every leaf node, lots of nodes will be in the nullmove search etc... > And the other thing - what kinds of selective search are in common? > (quiescence,check...). quiescence, check, recapture, pawnpush, mate-threat, one-reply -- GCP
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.