Author: Gian-Carlo Pascutto
Date: 04:19:25 12/05/05
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
This page took 0.01 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.