[computer-go] Interesting problem

[alain Baeckeroot]

Le jeudi 28 décembre 2006 18:47, Don Dailey a écrit :
> Yes,
> 
> Someone mentioned random as being infinitely weak but there is no
> such thing.    Resigning on the first move is as weak as you can
> get.
> 
> The random player isn't really random, it doesn't fill it's eyes.
> There are strategies to play MUCH worse than random as you
> point out.

Ok maybe one can build worst than random program, they will converge faster 
toward -infinity :)

> 
> I don't believe the random player is particularly easy to take
> advantage of. Of course it's very easy to beat, but it has  
> no special "quirks" compared to more deterministic algorithms.

On CGOS 9X9 "GNUGo-1.2" is nearly 1000 ELO stronger than "Random",
and on kgs gnugo1pt2 is ranked 22k, this is incredibly weak.
10-games-beginner is stronger than this !

I think it would be totally useless to try to use such a randombot for
reference. The only use of random bot is for bug squashing in other engines,
and test for time limit.

Alain