Author: Robert Hyatt
Date: 21:10:45 01/19/01
Go up one level in this thread
On January 19, 2001 at 21:57:13, Will Singleton wrote: >On January 19, 2001 at 21:45:28, Larry Griffiths wrote: > >>On January 19, 2001 at 19:47:20, Will Singleton wrote: >> >>>I was looking at my code today, and I noticed that I don't store or retrieve >>>check positions in and from the hash table. I have always had a bad habit of >>>not documenting my code, which stems from my origins as a hobby programmer. I >>>always figure I'll remember what x+ (temp-1) means, how could I forget? >>> >>>Anyway, do others store checking positions? If so, what happens if you disable >>>it? I'm asking because I had some weird results when I tried it. >>> >>>Will >> >>It seems like I do not store checkmates because my score for checkmates are >>adjusted depending upon the ply that they occured at so that checkmates close to >>the root ply score higher than checkmates at the horizon nodes and beyond so >>that the shortest number of moves to a checkmate would be chosen. I think that >>this scoring method caused problems with my hash table, so I do not store >>checkmates in my hash table. >> >>Maybe you score like I do ? >> >>Larry. > >Yes, I think everyone scores mates as an offset from the root. I recall some >discussion of how you handle this in the TT, but don't recall the details. I'm >not sure why I don't store any check positions, but it's clear that when I do, >my search goes wild, and I solve some unsolvable positions, and choke on easy >ones. I think I must look some more at this. > >Will Two things. 1. You have to correct mate scores to be relative to the current ply when you store them. 2. You only do this if you are storing an EXACT score. I once had a _horrible_ bug because I was also adjusting bounds (which can be mate scores at times) and adjusting the bounds will play hell with the search for mates.. :)
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.