Re: [computer-go] Alpha-beta pruning vs transposition tables

[Dave Dyer <ddyer@xxxxxxxxxxx>]

I had to deal with this in my problem solver.  Each node in
the solution tree either has an exact value or an upper or
lower bound.  By keeping track of the type of value, you
can reuse most of them, but occasonally (the nasty cases
you cite) you must ignore the remembered value.

A more complete description is online at
http://www.andromeda.com/people/ddyer/go/search.html

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