Dear Chrilly,
http://trac.gnugo.org/gnugo/attachment/ticket/150/MonteGNU.diff
is the diff file from GNU Go, I guess. You can download original diff
file from the bottom of the page.
-gg
chrilly: [EMAIL PROTECTED]:
Chrilly wrote:
I have no finished a plain vanilla 9x9 Suzie-UCT Version. The
I guess once superko really matters for programs, this paper might
become interesting for us:
http://www.fun.ac.jp/~kishi/pdf_file/AAAI04KishimotoA.pdf
Regards,
Benjamin
I use the simple ko position as part of the hash key, and generally
ignore positional superko and situational superko when
I have no finished a plain vanilla 9x9 Suzie-UCT Version. The UCT-tree is
stored in a Hashtable. I am interested who else uses this approach.
The reason for using a hashtable was: I was too lazy to implement an
explicit tree. At least at 9x9 I have no problem with memory size. In fact
there are
On 7/10/07, chrilly [EMAIL PROTECTED] wrote:
I have no finished a plain vanilla 9x9 Suzie-UCT Version. The UCT-tree is
stored in a Hashtable. I am interested who else uses this approach.
The reason for using a hashtable was: I was too lazy to implement an
explicit tree. At least at 9x9 I have
On Tue, 2007-07-10 at 16:14 +0200, chrilly wrote:
I have no finished a plain vanilla 9x9 Suzie-UCT Version. The UCT-tree is
stored in a Hashtable. I am interested who else uses this approach.
The reason for using a hashtable was: I was too lazy to implement an
explicit tree. At least at 9x9
On 7/10/07, chrilly [EMAIL PROTECTED] wrote:
I have no finished a plain vanilla 9x9 Suzie-UCT Version. The UCT-tree is
stored in a Hashtable. I am interested who else uses this approach.
Steenvreter has a hashtable.
The reason for using a hashtable was: I was too lazy to implement an
