[Computer-go] Semeais

Stefan Kaitschick Stefan.Kaitschick at Hamburg.de
Fri Jan 14 00:04:09 PST 2011


Am 14.01.2011 08:26, schrieb Robert Jasiek:
> Suggestion for MC:
>
> 1) Identify semeais by expert knowledge.
>
> 2) Divide the board into each semeai / non-semeai region.
>
> 3) Solve / represent each semeai by expert knowledge.
>
> 4) Do global MC with the change of special treatment for each semeai 
> region. E.g., know the best black / white move in each semeai region 
> and treat that region like just one intersection for the respective 
> player to move (alternatively: as two intersections for either player).
>
> For other problems like life and death, endgame or game's first move, 
> a similar Local Expert Knowledge approach could be used.
>
> There are complications of course:
> - dynamic region update
> - multiple threats on several regions
> - ko 

When you look at bot behaviour in the face of multiple semeais the 
reaction is "there has to be a better way".
But trying to isolate semeais from the rest of the board gets you back 
into the mud that go programming was stuck in before mc.
You need to be able to formulate improvements within the mc paradigm.
Something along the line of finding move equivalency classes by 
statistical means.

Stefan




More information about the Computer-go mailing list