Author: blass uri
Date: 00:08:52 11/16/99
Go up one level in this thread
On November 16, 1999 at 00:26:17, Scott Gasch wrote: <snipped> >Vincent's test is to generate all successors of: >rnbqkbnr/ppp2ppp/8/3pp3/3PP3/8/PPP2PPP/RNBQKBNR b KQkq e6 0 0 > >in a loop, 2000000 times and keep track of how long it takes... then compute >nodes/sec. Vincent gets 15 million in the same position with a slower >processor! I think that the result is not a good test because there can be different definitions of nodes It is easy by generating illegal moves to generate more nodes. I think it is more interesting to know how much time you need to generate all the legal moves and not to repeat the same moves but to generate a tree of all the possible legal games of 3 moves of both sides. 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.