Abstract
Approaches to computer game playing based on (typically α- β) search of the tree of possible move sequences combined with an evaluation function have been successful for many games, notably Chess. For games with large search spaces and complex positions, such as Go, these approaches are less successful and we are led to seek alternative approaches.
One such alternative is to model the goals of the players, and their strategies for achieving these goals. This approach means searching the space of possible goal expansions, typically much smaller than the space of move sequences.
In this paper we describe how adversarial hierarchical task network planning can provide a framework for goal-directed game playing, and its application to the game of Go.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Applegate, C. Elsaesser, and D. Sanborn. An Architecture for Adversarial Planning. IEEE Transactions on Systems, Man and Cybernetics, 20(1):186–294, 1990.
H. J. Berliner. A chronology of computer chess and its literarture. Artificial Intelligence, 10:201–214, 1978.
R. Bozulich. Second Book of Go. The Ishi Press Inc, 1987.
J. Burmeister and J. Wiles. An Introduction to the Computer Go field and Associated Internet Resources. Technical report, The University of Queensland, January 1997. Available online at: http://www/psy.uq.edu.au/~jay/go/gopage.html.
J. G. Carbonell. Counterplanning: A Strategy Based Model of Adversarial Planning in Real World Situations. Artificial Intelligence, 16(1):295–329, 1981.
T. Cazenave. Système d’Apprentisage par Auto-Observation. Application au jeu de Go. PhD thesis, L’Université Paris 6, 1996.
J. Davies. Life and Death. The Ishi Press Inc, 1978.
K. Erol, D. Nau, and J. Hendler. UMCP: A Sound and Complete Planning Procedure for Hierarchical Task-Network Planning. AIPS-94, June 1994.
D. Fotland. Knowledge Representation in The Many Faces of Go. Technical report, American Go Association, 1993. Available online at: ftp://bsdserver.ucsf.edu/Go/comp/mfg.Z.
I. Frank. Search and Planning under Incomplete Information: a study using Bridge card play. PhD thesis, Department of Artificial Intelligence-University of Edinburgh., 1996.
S. Hu. Multipurpose Adversary Planning in The Game of Go. PhD thesis, George Mason University, 1995.
P. Lehner. Strategic Planning in Go. In M. A. Bramer, editor, Computer Game Playing: Theory and Practice, pages 167–176. Ellis Horwood, 1983.
M. Müller. Computer Go as a Sum of Local Games: An application of Combinatorial Game Theory. PhD thesis, Swiss Federal Institute of Technology, Zurich, 1995.
J. Pitrat. A Chess Program which uses Plans. Artificial Intelligence, 8(1):275–321, 1977.
W. Reitman and B. Wilcox. The Structure and Performance of the Intrim 2.0 Program. In International Joint Conference on Artificial Intelligence, pages 711–719, 1979.
P. Ricaud. A Model of Strategy for the Game of Go Using Abstraction Mechanisms. International Joint Conference on Artificial Intelligence, pages 678–683, 1997.
E. D. Sacerdoti. A Structure for Plans and Behaviour. Elsevier, 1977.
Yasuki Saito and Atsushi Yoshikawa. Do Go players think in words? — interim report of the analysis of Go player’s protocols. In Hitoshi Matsubara, editor, Proceedings of the Second Game Programming Workshop. Computer Shogi Association, 1995
Yasuki Saito and Atsushi Yoshikawa. An analysis of strong Go-players’ protocols. In Hitoshi Matsubara, editor, Proceedings of the Third Game Programming Workshop. Computer Shogi Association, 1996.
P. T. Sander and D. J. M. Davies. A strategic approach to the game of Go. In M. A. Bramer, editor, Computer Game Playing: Theory and Practice, pages 152–166. Ellis Horwood, 1983.
S. J. J. Smith, D. S. Nau, and T. A. Throop. A Planning Approach to Declarer Play in Contract Bridge. Computational Intelligence, 12(1), 1996.
S. J. J. Smith, D. S. Nau, and T. A. Throop. Total-Order Multi-Agent Task-Network Planning for Contract Bridge. Proceedings AAAI-96, pages 108–113, 1996.
A. Tate. Generating Project Networks. In Proceedings: 5th International Joint Conference on Artificial Intelligence. 1977.
D. E. Wilkins. Using Patterns and Plans in Chess. Artificial Intelligence, 14(1):165–203, 1980.
S. Willmott. Adversarial Planning and the Game of Go. Master’s thesis, Department of Artificial Intelligence, University of Edinburgh, September 1997.
S. Willmott, J. Richardson, A. Bundy, and J. Levine. An Adversarial Planning Approach to Go (long version). Technical report, Department of Artificial Intelligence, University of Edinburgh, 1998. Forthcoming, Serial number TBA.
T. Wolf. The program GoTools and its computer-generated tsume go database. In Proceedings of the First Game Programming Workshop, pages 84–96. Computer Shogi Association, 1994.
T. Wolf. About problems in generalizing a Tsumego program to open positions. In Hitoshi Matsubara, editor, Proceedings of the Third Game Programming Workshop. Computer Shogi Association, 1996.
K. Yoshinori. Graded Go Problems for beginners (Volumes I-IV). The Ishi Press Inc, 1985.
P. R. Young and P. Lehner. Applications of a Theory of Automated Adversarial Planning to Command and Control. IEEE Transactions on Systems, Man and Cybernetics, 16(6):186–294, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Willmott, S., Richardson, J., Bundy, A., Levine, J. (1999). An Adversarial Planning Approach to Go. In: van den Herik, H.J., Iida, H. (eds) Computers and Games. CG 1998. Lecture Notes in Computer Science, vol 1558. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48957-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-48957-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65766-8
Online ISBN: 978-3-540-48957-3
eBook Packages: Springer Book Archive