[computer-go] April 2009 KGS tournament

So far, only Yamato-san has registered for Nick Wedd's next KGS tournament (to be held on April 5). It would be a shame when Zen19 would remain the only (strong) participant. Come on, gentlemen: register your engines! Other question: Might it be possible to find a volunteer for operating Zen19

Re: [computer-go] April 2009 KGS tournament

In message 20090331064748.227...@gmx.net, Ingo Althöfer 3-hirn-ver...@gmx.de writes So far, only Yamato-san has registered for Nick Wedd's next KGS tournament (to be held on April 5). It would be a shame when Zen19 would remain the only (strong) participant. Come on, gentlemen: register your

Re: [computer-go] The Zen Program

Probably the most original part of Zen is in the playout. I don't think MC simulations must be always fast, so it has a lot of hard-coded Go knowledge. Yamato Hello Are your playouts simple enough so you could publish the exact algorithm in (pseudo) source code? I'm sure many will be

Re: [computer-go] Transpositions in Monte-carlo tree search

Jonas Kahn wrote: You might be interested by this article, for a very complete and tested answer. Plus the idea of grouping, but a good part of the effect seems to me to be giving a heuristic pre-value to moves, which might be done more efficiently otherwise:

Re: [computer-go] Transpositions in Monte-carlo tree search

On Tue, 31 Mar 2009, Matthew Woodcraft wrote: Jonas Kahn wrote: You might be interested by this article, for a very complete and tested answer. Plus the idea of grouping, but a good part of the effect seems to me to be giving a heuristic pre-value to moves, which might be done more efficiently

[computer-go] nonuniform updates to a UCT tree

Does it hurt the integrity of a UCT tree if you update it in a way that is contrary to the standard traverse-simulate-backup strategy? For example, what if many simulations were run on a certain node deep in the tree and then all those results are backed-up the tree without doing any new

[computer-go] Shortcuts in the tree

It seems like there was a short discussion here recently about a strategy for reducing the amount of time spent updating the MCTS search tree, but now I can't find it. I don't remember much else about it. Does this ring any bells for anyone? ___

Re: [computer-go] The Zen Program

Are your playouts simple enough so you could publish the exact algorithm in (pseudo) source code? I'm sure many will be interested if you are willing to share it. I need to keep details secret for a while, to retain its commercial value. But I can say that Remi's work was more important than

Re: [computer-go] Shortcuts in the tree

I think you're looking for a post by Łukasz Lew about the epsilon trick... Sent from my iPhone On Mar 31, 2009, at 8:37 PM, Michael Williams michaelwilliam...@gmail.com wrote: It seems like there was a short discussion here recently about a strategy for reducing the amount of time spent

[computer-go] My ongoing CGoTournament - actual results

More than ten thousand games 19x19 Go are played in my computer Go Tournament - time to again publish some results! Please have a look at my newly created site for results and more informations: www.igosoft.com All these games are played on my home PC (Windows - Intel Pentium IV - 2.6 GHz).