[computer-go] 10k UCT bots

[Jason House]

On May 14, 2008, at 9:47 AM, "Norbert Gábor Papp" <papp.norbert.gabor at gmail.co 
m> wrote:

> Thanks for your fast reply,but sorry, I don't really understand  
> this...
>
> The situation -> both player pass, end of the game, I need the score.
>
> I want to remove dead-stones which means :
>
> if (IsGameEnded) {
> for (int i=0, int ,j=0; i<table.sizeX,y<table.sizeZ;i++,j++){
> if dead(i,j)
>   {
>
>     table.remove(i,j);
>   }
> }
> countterritories();
> .
> .
> .
>
> }
> I'm interested in the function dead(), which is true when a stone is  
> dead after both player pass,and the game is ended.

A proper answer requires knowing what your pass criteria is and  
possibly which logic is available. If you pass when your remaining  
options are illegal or fill one point eyes, then the logic is  
relatively simple 99% of the time... All stones in atari are dead. Ko  
messes that up if your opponent passes instead filling a ko.


>
>
>
> 2008/5/14 Jason House <jason.james.house at gmail.com>:
> That's a function of how smart your bot is. If you play until you  
> only have eye-filling moves, you can safely assume all of your  
> opponent's stones are alive, all your groups with two eyes are  
> alive, and everything else is dead. Note the asymetry - your  
> opponent may use a different strategy.
>
> If you use random playouts, you could compute the probability of  
> specific points being owned by each player, and use that for both  
> passing and marking dead stones.
>
> There are many other variants that use life and death modules, but  
> I'll assume you don't have them yet
>
> Sent from my iPhone
>
>
> On May 14, 2008, at 9:10 AM, "Norbert Gábor Papp" <papp.norbert.gabor at gmail.co 
> m> wrote:
>
> Thanks! How can I identify dead stones?
> I haven't seen algorithm for this, and it is a very important part of
> a go program
> 2008/5/14, Don Dailey <drdailey at cox.net>:
>
> This probably explains it better than I could:
>
>  http://senseis.xmp.net/?TrompTaylorRules
>
> - Don
>
>
>
> Norbert Gábor Papp wrote:
> Hi!
>
> Can you tell me some algorithm to compute the score ? (Both players  
> pass,
> and who is the winner...)
>
> Thanks, Norbert
>
>
> --- 
> ---------------------------------------------------------------------
>
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/
>
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http:
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://computer-go.org/pipermail/computer-go/attachments/20080514/0d0b2621/attachment.htm