There's a sort of hierarchy of life-and-death methods, for which Benson's algorithm is the base.
My status database is next above that, but it is actually a lookup table based on a problem solver, such as Wolfs or mine. The unique thing about the database is that it could be "dropped in" to a program which was prepared to provide the inputs it requires. Thomas and I compared results and cross validated our problem solvers back in the day, so for the set of positions both solvers accepted, very similar results are produced. My solver was not limited to closed shapes, but his was always orders of magnitude faster. In any case, other than discussing the techniques used, these solvers aren't any use to practical programs - there's no "solve" module anyone can load and use. Above this level (of solvers which work on very simple positions) there is the problem of applying it to a realistic board position. Much more go-specific knowledge is needed here. I worked some on the problem near endgame, but earlier than that is pretty much unexplored territory, except of course by real playing programs which have to apply some heuristics just to function. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
