Author: Gian-Carlo Pascutto
Date: 05:02:16 12/05/05
Go up one level in this thread
On December 05, 2005 at 07:57:01, Daniel Shawul wrote: >On December 05, 2005 at 07:53:56, Gian-Carlo Pascutto wrote: > >>On December 05, 2005 at 07:43:48, Daniel Shawul wrote: >> >>>On December 05, 2005 at 07:19:25, Gian-Carlo Pascutto wrote: >>> >>>>It seems to me that Rybka's seemingly slow speed is caused by not counting >>>>quiescent nodes as search nodes. >>>> >>>>You can observe that Rybka's nodes per second drops dramatically in positions >>>>where there are lot of forced check sequences. >>>> >>>>I am actually pretty sure of this because of 2 reasons: >>>> >>>>1) it never displays the parts of the variation coming out of the quiescent >>>>search >>>>2) it can solve mates with an unrealistically small nodecount >>>> >>>>-- >>>>GCP >>> >>> What if it doesnot have qsearch. It might be using sofisticated SEE. >> >>SEE doesn't solve mate in x problems. > But check extensions at horizon can. If combined with one reply , you >don't need qsearch to solve long mates >daniel That's true, but that kind of setup doesn't invalidate my original point any more. -- 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.