RE: computer-go: Applying Moore's Law to Computer Go

["Xu, Mousheng (SEA)" <moushengxu@xxxxxxxxxxxxxxxx>]

>* How I wish my program can evaluate 1 node per second. :) My feeling
is
>that if my program can evaluate 10^5 nodes in a couple of minutes, it's
>hopeful to get IGS *2k, and thus win a tournament. My problem might be

Here's how you do it:
   Search to the end of the game
   Have a very simple evaluation function: count territory

* Count territory without calculating which stones are dead?


So spread your 10^5 nodes, as 500 x 200-ply searches. That implies that
almost every node will have a branching factor of 1.

* A branching factor of 1 except the root? That's interesting. Then why
make the root spcial? how about a 1 x 200 ply search? My current
ambition is to do 200 nodes/minute, and it would be fantastic to achieve
such a goal. :)

Thanks a lot.

-- Mousheng Xu