Author: Robert Hyatt
Date: 10:15:55 12/14/03
Go up one level in this thread
On December 14, 2003 at 09:00:08, Alvaro Jose Povoa Cardoso wrote: >Hi, lately I've been thinking about the history heuristic. >I notice that in my implementation occurs overflows. (I use signed 32bit >integers) >I may be wrong but I think in Crafty there are overflows in the history >heuristic update too, wich can hurt move ordering. >Could you please check that? > >Best regards, >Alvaro Cardoso Note that I don't use the increment as suggested by Schaeffer. I use depth^2, rather than 2^depth. I suppose there is a chance since depth=30 is not hard to reach, and 30^2 = 900. But it will take a while to overflow. I'll look to see how big the numbers get, however, and in particular check for <0 to see if they overflow.
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.