Re: [computer-go] Basic PN implementation

[Gian-Carlo Pascutto <gcp@xxxxxxxxx>]

Paul wrote:
> Hi,
>
> What is PN^2 ?
It's a way of doing large PN searches in limited memory. Basically, it 
uses a PN search at the leaves of a PN search to calculate 
proof/disproof numbers. It's described in Victor Allis's thesis (which 
is AFAIK where PN search originally comes from?).

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