Author: Ryan B.
Date: 04:53:28 12/05/05
Go up one level in this thread
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. > daniel I guess a very intelligent SEE could predict a possible mate at low depth but I think returning a mate value would be too unsafe. I think there must be some type of qsearch in this engine. Ryan
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.