Re: computer-go: Proof number search

["Chris Fant" <Fantius@xxxxxxxxxxx>]

>   I believe that PN combinbed with heuristics is the best way foward
> for solving GO problems. But your proof statement should be in terms
> of heuristics goals that prune the search. (e.g. can I capture using
> only the suggested moves with a heuristic greater than a given value).
> This initially gives you a result that can be refined by lowering
> the value to expand the tree.

The thing I don't understand about that is:  If you are only using the
suggested moves, how can you be sure that you do actually capture.  What it
the opponent has a move that was not suggested in the search that can
prohibit the capture?