On Dec 13, 2007 4:50 PM, David Fotland <[EMAIL PROTECTED]> wrote: > I think Martin Mueller published an improvement to benson's algorithm > that is also proved correct. >
Yes. "Safety under alternating play". It's more generally applicable but I didn't think it met the needs of the original request. There's some guesswork/backup&retry that occurs in certain situations with that algorithm. I've also seen plenty of other papers on safety solvers. All are far more complex than Benson's. I've always seen Benson's as the classic example of a safety solver (all papers mention it)
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
