Re: [computer-go] Basic PN implementation

[Paul <p.j.leonard@xxxxxxxxxx>]

Hi,

pubgo implements PN. Maybe a bit abstract for your taste due to an
effort to try and make it as non-centric (is that a word ?) as
possible?  PN is implemented by adding Proof / Refute nodes to a
general search tree. Since these are abstract you can try and
prove/dispove anything you want.  An example for noughts and crosses
lurks somewhere just to show you can change what you are trying to
prove during the search (in this case when a win is refuted go on to
prove a draw). What is PN^2 ?

good luck Paul.


On Thursday 13 January 2005 4:29 pm, Gian-Carlo Pascutto wrote:
> Chris Fant wrote:
> > Does anyone know of a nice, clean, basic PN reference implementation?
> > Preferably in C/C++, not necessarily Go-centric.
> >
> > Please no flames about C/C++ not being nice/clean, etc.
>
> If you mean proof number search, the open source version of Sjeng has
> one and uses it for some chess variants (also of PN^2).



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