Author: Stuart Cracraft
Date: 13:03:50 09/13/04
Go up one level in this thread
On September 12, 2004 at 23:49:48, Robert Hyatt wrote: >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... > > Okay -- all that is done and the program is "at parity" in its results with the previous version that didn't stuff but relied on whatever was in the hash table before -- so for me, that's okay. 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.