[computer-go] Re: Bitmap Go

Hi Dmitry, If you don't mind, I put the mailing list in copy so that everybody can read this. Hello Antoine, I was reading the Computer Go mailing list and saw your message titled "Fast play on 9x9 board using bitmaps". I am currently trying to implement a fast bitmap go board. Therefore I

Re: [computer-go] Positions illustrative of computer stupidity ?

David Fotland wrote: Many Faces plays L10, which looks like it also breaks both ladders. -David Thanks for testing. What if Black replies with K9 ? It looks like K9 restores both ladders (to my naive eye). What about the first position I posted, where more tempting moves are available elsew

RE: [computer-go] Positions illustrative of computer stupidity ?

Many Faces plays L10, which looks like it also breaks both ladders. -David -Original Message- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of John Tromp Sent: Thursday, November 23, 2006 1:44 PM To: computer-go Subject: Re: [computer-go] Positions illustrative of computer

Re: [computer-go] Positions illustrative of computer stupidity ?

On 11/23/06, Rémi Coulom <[EMAIL PROTECTED]> wrote: Thanks John. I had not noticed that. > > Also, I would appreciate if some strong players could check this > position for correctness. I tried to make the position balanced so > that > if White does not play in the center, then i

Re: [computer-go] Positions illustrative of computer stupidity ?

John Tromp wrote: On 11/23/06, *Rémi Coulom* <[EMAIL PROTECTED] > wrote: I have come up with a simple position where GNU Go fails: it is a position with two ladders. The best move is a double-purpose ladder breaker at the intersection of the two ladders.

Re: [computer-go] Positions illustrative of computer stupidity ?

On 11/23/06, Rémi Coulom <[EMAIL PROTECTED]> wrote: I have come up with a simple position where GNU Go fails: it is a position with two ladders. The best move is a double-purpose ladder breaker at the intersection of the two ladders. GNU Go plays terribly bad when ladder-breakers are involved. I

Re: [computer-go] Positions illustrative of computer stupidity ?

steve uurtamo wrote: i think that these won't be terribly easy for your audience to parse. part of the problem is that gnugo is actually better than a beginner, for instance. A beginner cannot beat GNU Go, but it should be easy to make up positions where a beginner can find the right move an

Re: [computer-go] Positions illustrative of computer stupidity ?

Sylvain, Yes, I meant UCT, I have been working on converting my chess program to use the UCI protocol and so it was on my mind! (Incidentally, I think this is a better protocol that GTP, but I don't want to start a war here!) I can't help but feel we are missing something. With UCT we miss t

Re: [computer-go] Positions illustrative of computer stupidity ?

Hello Don, > The improvement over a given opponent should be measured by ELO points, > not win percentage unless you do the extra math. I cannot quite tell if > you were considering that or not - if so then ignore this. Going from > 50% wins to 60% with is a modest improvement, but going from 8

Re: [computer-go] Positions illustrative of computer stupidity ?

Sylvain, The improvement over a given opponent should be measured by ELO points, not win percentage unless you do the extra math. I cannot quite tell if you were considering that or not - if so then ignore this. Going from 50% wins to 60% with is a modest improvement, but going from 80% to 90%

Re: [computer-go] Positions illustrative of computer stupidity ?

> > What we can say from experiments is that the scaling with time is very > > good > > with few simulations, but becomes less interesting with a lot of > > simulations. > > This is typical for statistical sampling. The variance of the sample mean > is a function of the square-root of the sampling

Re: [computer-go] Positions illustrative of computer stupidity ?

- Original Message - From: <[EMAIL PROTECTED]> To: Sent: Thursday, November 23, 2006 1:24 PM Subject: Re: [computer-go] Positions illustrative of computer stupidity ? I think they will play very strong. Sofar all my tests indicates nice scaling, but I admit I have not tried a proper

Re: [computer-go] Positions illustrative of computer stupidity ?

> I think they will play very strong. Sofar all my tests indicates nice > scaling, but I admit I have not tried a proper experiment for a long time > since I do not have any extra hardware. Perhaps the Mogo team could do >something but the problem is that Mogo is so strong it would beat most >pro

Re: [computer-go] Positions illustrative of computer stupidity ?

Le Jeudi 23 Novembre 2006 11:47, Chris Fant a écrit : > > ... > > Its an interesting question if Monte-Carlo programms would also play > > infinite strong. > I was under the impression that most MC implementations were > guaranteed to converge on the optimal move. Yes, but it does not come from th

Re: [computer-go] Positions illustrative of computer stupidity ?

Quoting Chrilly <[EMAIL PROTECTED]>: only play infinite fast. Its an interesting question if Monte-Carlo programms would also play infinite strong. I think they will play very strong. Sofar all my tests indicates nice scaling, but I admit I have not tried a proper experiment for a long time si

Re: [computer-go] Positions illustrative of computer stupidity ?

... Its an interesting question if Monte-Carlo programms would also play infinite strong. Chrilly I was under the impression that most MC implementations were guaranteed to converge on the optimal move. ___ computer-go mailing list computer-go@comput

Re: [computer-go] Positions illustrative of computer stupidity ?

In message <[EMAIL PROTECTED]>, Chrilly <[EMAIL PROTECTED]> writes The attached position shows the "Kirtag Problem". I have named it after the Austrian proverb "Man kann nur auf einem Kirtag tanzen" (One can dance only on one village-party***). More mathematically it is the subgame problem. Wh

Re: [computer-go] Positions illustrative of computer stupidity ?

In message <[EMAIL PROTECTED]>, Chrilly <[EMAIL PROTECTED]> writes The attached position shows the "Kirtag Problem". I have named it after the Austrian proverb "Man kann nur auf einem Kirtag tanzen" (One can dance only on one village-party***). More mathematically it is the subgame problem. Whit

Re: [computer-go] Positions illustrative of computer stupidity ?

At 11:44 AM 11/22/2006, you wrote: ... why writing a Go-playing program is so difficult ... in addition to the things that you mentioned is the following: the stronger the player, the longer they will leave a position unresolved and the position will be as complicated as that player can grok