[Computer-go] [computer-go] Dynamic Komi's basics

Petr Baudis pasky at ucw.cz
Mon Mar 1 04:37:45 PST 2010


  Hi!

On Thu, Feb 11, 2010 at 11:24:25PM +0900, Hiroshi Yamashita wrote:
> if ( boardsize == 19 ) {
>  if ( moves < 20 ) latest_score = komi;      // sum of stone existing propability of previous thinking.
>  double stones_per = occupied_percent();     // stones / (boardsize*boardsize)
>  double t   = (1.0 - stones_per)-0.5 + 0.05; // change big around 240 moves
>  double per = 1.0 / ( 1.0 + exp( -20.0*t));  if ( per > 0.95 ) per =
> 0.95;
>  int diff = (int)(latest_score - original_komi);
>  diff = (int)(per * diff);                   // big in opening, almost 0 in endgame.
>  komi = original_komi + diff;
> }

  Another question - what is latest_score otherwise? Average value of
all scores throughout simulations for previous move?

  I'm currently mainly researching slightly different methods, but with
your permission, I would also like to include your algorithm in the
comparison in my paper.

  Thanks again,

-- 
				Petr "Pasky" Baudis
http://pasky.or.cz/ | "Ars longa, vita brevis." -- Hippocrates



More information about the Computer-go mailing list