Author: Larry Griffiths
Date: 03:09:02 02/13/01
Go up one level in this thread
On February 13, 2001 at 00:11:38, Robert Hyatt wrote:
>On February 12, 2001 at 23:15:12, Larry Griffiths wrote:
>
>>Hi,
>>
>>I created some new hashtable code that boils down to this...
>>
>> if(BestScoreSoFar>=beta)
>> {
>> add lower_bound hash entry
>> }
>>
>> if(BestSCoreSoFar>alpha)
>
>
>I hope the above if has an else in front of it? If not, it should.
>
>
>
>> {
>> add exact hash entry
>> }
>> else
>> {
>> add upper_bound hash entry
>> }
>>
>>I see all three types added to my hash table, but it seems that the
>>upper_bound entries never cause any cutoffs to occur when searching
>>the hash table.
>>
>>If I do not add lower_bound hash table entries, then I see some
>>upper_bound cutoffs occuring. It acts like the upper_bound entries
>>get overlayed so often by lower_bound entries so that they never
>>get seen when searching the hash table.
>>
>>Is this normal, or is something wrong with my code?
>>
>>Larry.
It looks more like this, Bob.
BestScoreSoFar=alpha
for(do capture moves)
{
if(returnedSearchScore>BestScoreSoFar)
{
BestScoreSoFar=returnedSearchScore
if(BestScoreSoFar>=beta)
{
add lower_bound hash entry
return BestScoreSoFar
}
}
}
for(do non-capture moves)
{
if(returnedSearchScore>BestScoreSoFar)
{
BestScoreSoFar=returnedSearchScore
if(BestScoreSoFar>=beta)
{
add lower_bound hash entry
return BestScoreSoFar
}
}
}
if(BestScoreSoFar>alpha)
{
add exact hash entry for BestScoreSoFar
}
else
{
add upper_bound hash entry for BestScoreSoFar
}
return BestScoreSoFar;
This page took 0.01 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.