Author: Robert Hyatt
Date: 20:49:48 09/12/04
Go up one level in this thread
On September 12, 2004 at 22:58:22, Stuart Cracraft wrote: >I did this and the results are worse. >Clearly something is wrong > >I took the triangular table, once the iteration finishes, >and grabbed pv[0][0..N] to get the pv. I then made each >of these moves on the board and used my hash store function >to store the move that's in pv[0][i] from 0 through N into >the hash table. The reason I made them was so that the hashkey >was calculated since it is stored from a global value into >the table when a store is done. After all this, the pv[] moves >made is unmade and the position is back where it was. > >Since depth, a score, and whether it is an upper/lower/exact >are required, I threw in some ideas, but nothing worked well. Do a probe. If a match is found, just stuff the PV best move into this entry and re-write it back. That leaves everything as it was. If there is no existing entry make one. You know the _exact_ score to score, and you can compute the depth... > >Results dropped by 20% with various settings for depth, score, >and exact. > >Anyone else do this and have a suggestion about what to store >as depth and score? Perhaps my whole approach to this method is >wrong. > >Stuart
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.