Re: computer-go: Hashing during minimax

[Dave Dyer <ddyer@xxxxxxxxxxx>]

>
>I have one other concern:  suppose I evaluate a board at a leaf node, and later encounter it again higher in the tree.  Should I re-evaluate it?

You would do well to read my paper, which covers this topic.
http://www.andromeda.com/people/ddyer/go/search.html

Basicly, if you store the values of minmax nodes that have been
pruned by alpha beta, the values are mins or maxes, not concrete values,
and have to be treated accordingly.