What type of positions are you interested in? There is certainly no simple solution for non-final positions (which is why Go is an interesting game), and even in final positions it can be tricky. For final positions Monte-Carlo playouts (with sufficient knowledge) can get very close to perfect, but there are other approaches that also work well (e.g., you could train a neural net on labeled examples). Perhaps start with Benson's algorithm for unconditional life and extend from that with whatever clever tricks you can find.
Good luck, Erik On Thu, Nov 14, 2013 at 11:29 PM, Marek Jasovsky <[email protected]> wrote: > Hello > > can someone recommend me any good and to some extent simple algorithm, I can > use in software of my own, to detect dead stones and evtl seki situations, > where both group remain living , as well as counting territory? > > thank you in advance, > > Marek > > _______________________________________________ > Computer-go mailing list > [email protected] > http://dvandva.org/cgi-bin/mailman/listinfo/computer-go _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
