Re: [computer-go] Basic PN implementation

[Chris Fant <chrisfant@xxxxxxxxx>]

> 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 ?

I took yesterday off from work and implemented (easy) and debugged
(hard) a PN implementation.  It is working quite well.  I'm getting
over a million nodes per second (9x9 board).  PN^2 is where you use
one PN search as the evaluation of another PN search.  It's purpose is
to reduce memory requirements at the cost of execution time.
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/