[computer-go] How to change the influence function?

[tk424]

Hello,
 
I am trying to implement a new influence function in GNU Go version 3.6.
I have two questions about this issue.
 
The first question is how to prove the new influence function is better the old 
one.
I believe it can be said the new influence function is better if the new GNU Go 
wins more games, in average, than the old one. The rest of the parts will stay 
the same.
In other words, this new influence function should be compared from self-play 
(old influence function vs. new influence fn).
Does this sound reasonable? Any comment will be appreciated!
 
The second question is more practical.
Could anyone tell what part in the source codes should be modified?
I have no experience of working with influence function, setting up a 
self-play, and counting the number of wins.
ANY input will be helpful...

After reading the GNU Go documentation 13. Influence function 
(http://www.gnu.org/software/gnugo/gnugo_13.html), I was trying to understand 
engine/influence.h and engine/influence.c.
But it's all puzzling to me.
 
Thank you in advance!
 
 
T Kim
!!!
  Friends are angels who lift us to our feet when  
  our wing have trouble remembering how to fly.
!!!
Address:
Missouri University of Science and Technologies
Formerly, University of Missouri-Rolla
Applied Computational Intelligence Laboratory
G11 Emerson Electric Co. Hall
1870 Miner Circle Rolla, MO 65409-0040
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

[computer-go] Calculate the number of stones in the same group?

[tk424]

Hello,
 
I am looking for an efficient data structure and algorithm to calculate the 
number of stones in the same group.
 
I believe this should've been done by someone else earlier.
But I couldn't find anything directly related so far when I searched the web 
and the archives.
 
My closest guess of others' work is GNU Go, and I found something related to 
what I'm looking for.
If I understood correctly, (a worm)=(a string)=(a group of stones) in GNU Go.
So, a function to calculate the number of stones in the same worm should be 
able to calculate what I want.
Function countstones(int str) in engine/board.c is used in function build_worm 
in order to compute the number of stones in the same group. Is my understanding 
correct?
 
Well, I read the source codes and the manual, and understood how it works to 
some levels.
But I don't fully understand to the level I can write my own program or use the 
exisiting codes.
Does anybody have any pointers to help this situation?
 
Just in case, I'd like to describe the problem I'm attacking below.
This problem is described the best in a figure given below.

   a b c d e f g h j
 1 . . . . . . . . . 1
 2 . . . . . . . . . 2
 3 . . O . . . . . . 3
 4 . . O . . . . . . 4
 5 . . O O . . . . . 5
 6 . # O # . . . . . 6
 7 . # # # . . . . . 7
 8 . . # . . . . . . 8
 9 . . . . . . . . . 9
   a b c d e f g h j

In above example, both black (#) and white (O) have a group of stones, 
respectively.
Black's group has six stones, and white's group has five stones.

I'd like to compute the number of stones incrementally as a new stone is placed.
Say, a white stone is placed at 3b as given below.
Then the number of stones in the white's group should be recalculated, starting 
from the the location 3b.

   a b c d e f g h j
 1 . . . . . . . . . 1
 2 . . . . . . . . . 2
 3 . O O . . . . . . 3
 4 . . O . . . . . . 4
 5 . . O O . . . . . 5
 6 . # O # . . . . . 6
 7 . # # # . . . . . 7
 8 . . # . . . . . . 8
 9 . . . . . . . . . 9
   a b c d e f g h j

This is a simple example to exmplain the problem.
The data structure and algorithm should handle more complex situations with a 
multiple number of groups and more complicated shapes of stones.

Could you provide me a pointer to solve this problem?
Thanks!

Best regards,
Tae-hyung D. Kim

!!!
  Friends are angels who lift us to our feet when 
  our wing have trouble remembering how to fly.
!!!


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

RE: Re: [computer-go] computer Go article in The Economist

[tk424]

Dear all,

In the Economist, two Hungarian guys are mentioned.
Do you guys know who they are?
Do they have a website?

Thank you in advance!

Yours truly,
Tae-Hyung
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/