Author: Tony Werten
Date: 02:09:41 12/07/01
Go up one level in this thread
On December 06, 2001 at 17:29:43, Severi Salminen wrote: >Hi > >How many collisions crafty gets on average using 32-bit keys? So how many nodes >Crafty searchs on average to get 1 collision? I'm now using plain Visual C++ 6.0 >rand() with no hamming distance tests and I get about 80 collisions out of >10'000'000 evaluations from initial position. I'd like to know if that is more >or less than Robert and David were seeing. Funny thing was that first I searched >about 5'000'000 nodes with no collisions, then I saw 40 collisions in a short >time, then again no collisions and finally 40 more in a short time. Kind of logic. Pawnstructures don't change very much so you will be looking for the same structure several times. When things go wrong they will go wrong several times. Tony > >Severi
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.