Author: Russell Reagan
Date: 13:04:33 04/07/03
Go up one level in this thread
On April 07, 2003 at 15:25:47, Igor V. Korshunov wrote: >Yace is faster on all positions. Because Move doesn't visit all nodes in tree >(just calculates nodes count). >So Yace is much faster tree searcher. I thought it was clear that I was only discussing perft speed here. It is near impossible to have a clear winner for "fastest" in terms of search, because that can mean so many different things. One engine might get 1Mnps, but another that gets 100Knps finds the right move in half the time. Which is faster? Depends on your definition. People don't even count nodes the same anyway.
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.