Re: [computer-go] Black/White winning rates with random playout?

2009-01-13 Thread Petr Baudis
On Sun, Jan 11, 2009 at 01:24:32PM +, Nick Wedd wrote:
 I suggest that instead of getting your neural players to play Go, you get 
 them to play a very slightly different game, in which, when both players 
 pass in turn, all stones remaining on the board are deemed alive.  It is 
 not difficult to write a scoring algorithm for this game.

Or you can rephrase this to say that your neural players should play Go
using the Tromp-Taylor ruleset. Scoring is pretty much trivial to
implement in these rules, and they approximate the traditional chinese
counting relatively well - all my bots always played on KGS using just
the Tromp-Taylor counting and discrepances are rare.

-- 
Petr Pasky Baudis
The average, healthy, well-adjusted adult gets up at seven-thirty
in the morning feeling just terrible. -- Jean Kerr
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/


Re: [computer-go] How to properly implement RAVE?

2009-01-13 Thread Sylvain Gelly
2009/1/10 Isaac Deutsch i...@gmx.ch

 Hi Sylvain,

 I think it's starting to make sense now. :-)


  Sorry to be unclear. I wish we have a white board where we could discuss
  and
  that would sorted out in a few minutes :).

 Several results turn up in a google search ;p
 http://www.google.com/search?q=online+white+board


  What I tried to mean is that when you do the backup for a given node, you
  look at the part of the playout that happen after that node (including
  that
  node), and you do a normal AMAF backup for that part of the playout.
  Does it make sense?
  I hope we make progress and I am not making things more confusing :).
  I should write a pseudo code I guess, but for today I am too lazy :).
 
  Sylvain

 I tried putting this into pseudo code, but it already looks like C. ;p
 http://pastie.org/357231
 If you could look at it, I would be most grateful.

It sounds good but it seems to lack the check of whether a given move is
first played in a given intersection. When you add that, it because a little
more tricky to update in the tree. You also update the value of each move
independently of the color, i.e. a position in which it is black turn will
be update with white moves. You should restrict the update.

Hopes that helps,
Sylvain




 -Isaac

 --
 Pt! Schon vom neuen GMX MultiMessenger gehört? Der kann`s mit allen:
 http://www.gmx.net/de/go/multimessenger
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/

___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Re: [computer-go] Re: Hardware limits

2009-01-13 Thread Petr Baudis
On Sat, Jan 10, 2009 at 02:21:17PM +0100, Gian-Carlo Pascutto wrote:
 Mark Boon wrote:
  So it seems arbitrary to put limitations on the hardware. However, if
  two programs are essentially the same, but one side manages to bring
  a more powerful computer than the other, is it fair to award one
  program a prize and not the other?
 
 If the programmer has done the needed work to make use of that,
 obviously he deserves to be rewarded for that.

However, how do you account for the other way, which seems far more
likely to me, that a team has better program but not enough resources
to buy high-end hardware to run it on, therefore losing anyway? The
concern being, not only the quality of the program is rewarded, but also
the amount of resources available to the team, which seems unfair to me
if the goal of the competition would be to choose the best program.

This scenario seems to me far more likely than the other way around, but
I am not familiar with the actual practice and scenarios of Chess and Go
tournaments.

Maybe what should be qualified is really what kind of competitions are
we talking about, and name them appropriately. Is it a _Go program_
competition? Or _Go-playing computer_ competition? I think in the former
case it would make most sense to just run all the programs on the same
hardware provided by the organizers. In the latter case, you do not have
to worry about any restrictions on hardware at all.

-- 
Petr Pasky Baudis
The average, healthy, well-adjusted adult gets up at seven-thirty
in the morning feeling just terrible. -- Jean Kerr
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/