Attached is another simple problem. A tactical-solver might work as this. It checks all strings. If the number of liberties is below a thresold (e.g. 3) it defines the string as a prey and tries to kill the string. Then the solver takes the next prey, tries to kill it. For this tactical solver the white stones are save. Each prey can escape individually, but due to the double-atari one of them is dead. This is a trivial example, but there are more difficult ones which are much harder to solve. Even the best strong programms like Handtalk are very vulnerable to double attacks (there are other ones like Many Faces which do not suffer from this problem)..

Chrilly

Attachment: DoubleThreat.sgf
Description: Binary data

_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Reply via email to