Author: Ren Wu
Date: 16:51:21 11/18/98
Go up one level in this thread
On November 17, 1998 at 13:03:38, Bruce Moreland wrote: >An acceptable solution is to use a 64-bit number to count nodes. On current >machines, this will delay the advent of this problem for something on the order >of a million years. > I am sure that you already know this, but here juse some info for those who want to deal with nodes > 4G. Using 64 bit interger, like __int64 in MSVC, is quite slow on 32 bit machine. In my case, i keep two counters, one for the total nodes, and another one for the capture nodes. And i also check the total nodes from time to time to see if it is the time to stop the search. And this is slow, maybe 3%-5% slower than the 32 bits version. So the best solution seems keep two 32 bits interger for each counter. In my cases, i only increment the one 32 bit interger, until it reach 64K, then i increment the another one, and subtract 64K from the first one. And this is also a good point to check if i should stop the search and so on. (Call to clock() is also slow, and should not call it too many times). It works fine for me. Regards, Ren.
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.