Re: [computer-go] alpha-beta + graph history question

[Evan Daniel <evanbd@xxxxxxxxx>]

On Thu, 17 Mar 2005 14:34:46 +0100, Persson, Magnus
<persson@xxxxxxxxxxxxxxxxx> wrote:
> I had a bug in my transposition code that is very easy to make and very
> difficult to find until one suddenly sees the light.
> 
> When you finally store the result of a call to the alfabeta function in
> the t.table, it is not certain anymore that the node in the table
> anymore is the same as when alfabeta was initially called, because the
> recursive alfabeta calls might have overwritten the entry in the table.
> 

If I understand correctly, this is a result of a transposition table
with some sort of replacement scheme, such that sometimes entries are
thrown out, and one of the children of the current node has replaced
the current node in the table, right?

If that's the case, then I avoided it by pure luck since my
transposition table doesn't throw away entries :)

Evan
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/