RE: [computer-go] Computer go in 7x7

2006-10-10 Thread Magnus Persson
Quoting David Fotland <[EMAIL PROTECTED]>: 7x7 is pretty much solved (by people, not exhaustive search), so it's a much easier game than chess. Correct komi is 9 points. http://senseis.xmp.net/?7x7BestPlay Here are some random comments about 7x7 and Valkyria. I think the complexity of 7x7 is

RE: [computer-go] Computer go in 7x7

2006-10-10 Thread David Fotland
7x7 is pretty much solved (by people, not exhaustive search), so it's a much easier game than chess. Correct komi is 9 points. http://senseis.xmp.net/?7x7BestPlay David > -Original Message- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] On Behalf Of Don Dailey > Sent: Tuesday, O

Re: [computer-go] Computer go in 7x7

2006-10-10 Thread Don Dailey
Yes, it wouldn't be best for building a strong player unless the program assumed a certain komi. But then it gives up if it cannot achieve that komi. Which reminds me - when you run test suites, you have this problem. I have to doctor up problems so that the correct move gives a win and all in

Re: [computer-go] Improvement of UCT search algorithm

2006-10-10 Thread Don Dailey
On Tue, 2006-10-10 at 10:17 +0200, [EMAIL PROTECTED] wrote: > So indeed choosing the move with highest number of simulations seem a > little > better, whereas it is not statistically very significant (I could try > with > more games, but 800 is already quite a lot :-)). Usually, a high scoring m

Re: [computer-go] Computer go in 7x7

2006-10-10 Thread Chris Fant
But then you have to change your code to favor average terrirory over win ratio. On 10/10/06, Don Dailey <[EMAIL PROTECTED]> wrote: A good way to structure 7x7 matches, is that you forget komi, and just play 1 game as white and 1 games as black, adding up the territory in both games.Then y

RE: [computer-go] Computer go in 7x7

2006-10-10 Thread Don Dailey
A good way to structure 7x7 matches, is that you forget komi, and just play 1 game as white and 1 games as black, adding up the territory in both games.Then you don't have to worry about which komi is correct. - Don On Tue, 2006-10-10 at 13:02 -0400, House, Jason J. wrote: > I think Crazy S

RE: [computer-go] Computer go in 7x7

2006-10-10 Thread House, Jason J.
I think Crazy Stone did very well on 7x7 with an opening book. If you go down that road, I recommend that you consider using the attached file to populate the database. -Original Message- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of [EMAIL PROTECTED] Sent: Tuesday, Octob

Re: [computer-go] Computer go in 7x7

2006-10-10 Thread Rémi Coulom
[EMAIL PROTECTED] wrote: Hello all, I am wondering about Go in 7x7. I know that the game in this size has no real interest in itself. However, I think that the level of computer go programs is much higher in 7x7 than in 9x9, and it could be interesting to see until where we can go in 7x7.

Re: [computer-go] Improvement of UCT search algorithm

2006-10-10 Thread sylvain . gelly
> > Results: (number of win/number of games with MoGo playing black, then > > with MoGo playing white, then percentage over all the games). > > * Choosing the move with the highest value: 338/425(b),352/425(w) > > (81.2%/850) * Choosing the move with the highest (value-(standard > > deviation)/sqrt

Re: [computer-go] Improvement of UCT search algorithm

2006-10-10 Thread Łukasz Lew
On 10/10/06, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote: Le Lundi 09 Octobre 2006 17:34, Don Dailey a écrit: > I would like to know the results if you do some tests on this. Hello, here are the results comparing the methods of choosing the best move. I have not yet tested the more complicated s

[computer-go] Computer go in 7x7

2006-10-10 Thread sylvain . gelly
Hello all, I am wondering about Go in 7x7. I know that the game in this size has no real interest in itself. However, I think that the level of computer go programs is much higher in 7x7 than in 9x9, and it could be interesting to see until where we can go in 7x7. There was a discussion on thi

Re: [computer-go] Improvement of UCT search algorithm

2006-10-10 Thread sylvain . gelly
Le Lundi 09 Octobre 2006 17:34, Don Dailey a écrit : > I would like to know the results if you do some tests on this. Hello, here are the results comparing the methods of choosing the best move. I have not yet tested the more complicated solution of giving more time if necessary. The benchmark:

Re: [computer-go] twogtp

2006-10-10 Thread Sanghyeon Seo
2006/10/5, Richard J. Lorentz <[EMAIL PROTECTED]>: What seems to happen is that twogtp sends a quit command at the end of the game and I can't seem to find the right response to this command. If I do nothing the program hangs. If I terminate the program twogtp complains that my program died. Othe