Author: leonid
Date: 06:01:55 04/05/00
Go up one level in this thread
On April 05, 2000 at 01:37:34, Jeremiah Penery wrote: >On April 04, 2000 at 17:44:03, leonid wrote: > >Since then I know that only logics that do both brute force search >>without any "extras" that can be compared. > >And this is _exactly_ why you CAN'T compare your program to other programs in >the way you want to do so. ALL other programs do some kind of "extras" >(extensions, especially). This I learned my hard way. The only, probably wrong approximation here, I see in considering that other programs with extensions will go some extra ply searching given position. So they must take here and there around five fold more time to solve identical position. This was the only way, until now, to guess about my positional logic speed by comparing it brute force search to others. The next minor indication came from speed of mate solver that use the same move generator and other parts as well, and also nodes per second rate. Extension for check I can probably see in the time of my mate solver that work all the time before positional logic. Its time is simply negligeable with exception for the end of the game. Leonid.
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.