21
1. Name: Yong-Goo Park
2. Country: Korea
3. Name of My Program: FunGo
4. Feature of My Program:
A block: find connection degrees between stones
find life and death for each stone
find safety degree for each stone(scale is 0 to 1.0)
find size for each stone
B block: do the same procedure in the block A for each group
C block: for all free space in a board,
find strength in black territory
find strength in white territory
S block: treat a set moves
if matches with a set moves in database return values to output
D block: #n small blocks D1,D2,D3...., Dn are inside this block in parallel,
sum the output values of Di(l<=i<=n) and return top 20 candidate places
Di(l<=i<=n) block:if matches with type(black ,white stone) conditions in a board,
calculate the values using the results of block A,B,C
E block: re_evaluate the candidate places with more sophiscated function
generate final one candidate place