[Computer-go] Semeais

[Kahn Jonas]

On Thu, 13 Jan 2011, Stefan Kaitschick wrote:

> I have also advocated this, comparing it to quiesence search in chess.
> I still think this would be effective if done well.
> Actually I think it is actually critical for high level play.
> Because permutating between multiple semeais in all parts of the tree will 
> always kill any amount of computing power available.
> There are problems that go beyond spotting local semeais and playing the 
> correct moves.
> You artificially remove ko threats, and you also change ladders.

On the second point, use of Mogo Fillboard would probably turn the
trick.

Jonas