An Algorithm for Solving Alive Situation Puzzles in GO Game
暂无分享，去创建一个
Le nouvel algorithme partitionne tout d'abord les pierres en groupes et analyse ensuite la situation. Le programme a permis de resoudre des puzzles de situation vivantes dans un temps raisonnable
[1] Walter Reitman,et al. Pattern recognition and pattern-directed inference in a program for playing go , 1977, SGAR.
[2] Hans J. Berliner,et al. A Chronology of Computer Chess and its Literature , 1978, Artif. Intell..
[3] 実近 憲昭. Notes on Modelling and Implementation of the Human Player′s Decision Processes in the Game of GO , 1981 .