The Benson algorithm is used to detect unconditional life. It should identify these strings as alive, which is good. I think that most of the problem with the two false eyes is that their owner might incorrectly fill one of them before reaching a late game stage, so perhaps that does not solve the problem.
Can you tell me how the Benson algorithm is used in StoneGrid? Thanks, Brian From: [email protected] [mailto:[email protected]] On Behalf Of fastgo Sent: Wednesday, April 06, 2011 10:11 AM To: Aja; [email protected] Subject: Re: [Computer-go] living by two false eyes In StoneGrid, it has built in the Benson algorithm in the playout. It does not seem to help much on overall strength. But I think it should solve the case here. I think you can implement the Benson Algorithm in the late stage of the playout. It has another advantage finishing the playout in shorter length. In StoneGrid, the playout on average finishes in a little bit more than 70 stones on 9x9. You need quite a lot of effort to get it fast as well as correct. So the return of the effort is low.
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
