Author: Uri Blass
Date: 02:31:05 01/13/03
Go up one level in this thread
On January 13, 2003 at 05:05:05, Bas Hamstra wrote:
>>i hope you realize that there is a big contradiction between 'extensive pawn
>>structure analysis', fast search, checks in qsearch, good move sorting and fast
>>nps.
>
>Yes, probably. You start to wonder how Frans did it in Fritz5. But F5 proves
>that is IS possible. At least checks/speed/sorting. Although sorting I'm not
>sure of, with F5's extremely heavy dependency on hashsize.
It is easy to show fast search all you need is printf("%d",node*10);
I really do not care about nps when there are different definitions of nps( for
example I do not count null move when Crafty does).
I can have millions of nps if I count every legal move that I generate and not
only every legal move that I make.
Uri
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.