[Computer-go] Semeais
Aja
ajahuang at gmail.com
Thu Jan 13 19:08:19 PST 2011
> - spot semeai
Usually semeai moves are of fixed sequence. So, maybe we can collect the
moves of sequence from simulations like this to spot semeai (suppose there
are only 5 empty points: A, B, C, D, E in the board).
- Black played A->B->C->D->E and won the semeai.
- Black played B->C->D->E and won the semeai. (A was played by White)
- Black played B->C->D->A and won the semeai. (E was played by White)
- Black played B->C->A->D and lost the semeai. (E was played by White)
- Black played A->B->D->C and lost the semeai. (E was played by White)
Then we can know that B->C->D is the "common sequence" for winning semeai
from some relevant algorithm. Note that we only need to know ONE sequence to
win the semeai, even if there are many ways.
Aja
More information about the Computer-go
mailing list