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

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

The heavy evaluation, to be accurate, has to do lot of local search for
string tactics, connections, etc.  So you are lucky to get 10
evaluations
per second.

* 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
that, for every move, the program needs to do a lot of other stuff than
simply evaluate the move. Activities include game control (who is next
turn), rule validation (is it a legal move), board update (does it kill?
update safeties of groups ...). In terms of program execution, a couple
of nodes need to be created, deleted, modified, which seems to take a
lot of computer power. Now my program spends 1~2 minutes to evaluate a
node, how great it is. :) 

* Thanks for any hints and suggestions.

-- Mousheng Xu