Author: Robert Hyatt
Date: 10:27:43 04/14/04
Go up one level in this thread
On April 14, 2004 at 10:03:04, Alvaro Jose Povoa Cardoso wrote: >Hi, >I've been playing with the following history heurist variant: >Along with the PieceType-From-To formulation I added 8 bits that correspond to >the rightmost 8 bits of the hashkey. >So the new index to the history table is as follows: >HashKey-PieceType-From-To >HashKey is only 8 bits as said before. The idea is to try to match as much as >possible the moves that failed high with the 'true' posições where that happened >since in the classic hitory heuristic aproach we have little or nothing that >says that those history moves found at the current node where previously stored >in the exact same position as the current one. In other words history moves >don't mean they came from the same position. It is exactly this I'm trying to >avoid. >However when I tryed this idea it failed miserably with much higher node counts. >My question is why did this failed? >Is this a wrong idea from the very beginning? > >Best regards, >Alvaro Cardoso This makes the table too big. using <from><to> gives 64*64 or 4096 entries. Adding the piece (which I do not do) multiplies this by 6 (or 8) which makes it 24-32k entries or 96-128K bytes. Not cache-friendly. adding another 8 bits and this is huge...
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.