{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T15:57:30Z","timestamp":1719071850891},"reference-count":50,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4549,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0304-3975(00)00076-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:41:58Z","timestamp":1027593718000},"page":"45-82","source":"Crossref","is-referenced-by-count":9,"title":["Applying adversarial planning techniques to Go"],"prefix":"10.1016","volume":"252","author":[{"given":"Steven","family":"Willmott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Richardson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Bundy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Levine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(00)00076-1_BIB1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1109\/21.47820","article-title":"An architecture for adversarial planning","volume":"20","author":"Applegate","year":"1990","journal-title":"IEEE Trans. Systems Man Cybernet."},{"issue":"1","key":"10.1016\/S0304-3975(00)00076-1_BIB2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(94)90012-4","article-title":"Partial-order planning; evaluating possible efficiency gains","volume":"67","author":"Barrett","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0004-3702(78)80012-5","article-title":"A chronology of computer chess and its literature","volume":"10","author":"Berliner","year":"1978","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB4","series-title":"Second Book of Go","author":"Bozulich","year":"1987"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB5","first-page":"303","article-title":"The challenge of go","volume":"81","author":"Brown","year":"1979","journal-title":"New Sci."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB6","unstructured":"J. Burmeister, J. Wiles, An introduction to the computer go field and associated internet resources, Tech. Rep. The University of Queensland, January 1997. Available online at: http:\/\/www\/psy.uq.edu.au\/\u223cjay\/go\/go_page.html."},{"issue":"1","key":"10.1016\/S0304-3975(00)00076-1_BIB7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(81)90003-5","article-title":"Counterplanning","volume":"16","author":"Carbonell","year":"1981","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB8","unstructured":"T. Cazenave, Syst\u00e8me d'Apprentisage par Auto-Observation. Application au Jeu de Go, Ph.D. Thesis, L'Universit\u00e9 Paris 6, 1996."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB9","series-title":"Proc. 13th European Conf. on Artificial Intelligence (ECAI\u201998)","first-page":"645","article-title":"Metaprogramming forced moves","author":"Cazenave","year":"1998"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB10","unstructured":"S.F. Da Silva, Go and genetic programming, playing go with filter functions, Master's Thesis, Leiden University, Netherlands, 1996. Available online at: http:\/\/www.wi.leidenuniv.nl\/MScThesis\/dasilva.html."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB11","series-title":"Life and Death","author":"Davies","year":"1978"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB12","article-title":"Evolving go playing strategy in neural networks","author":"Donnelly","year":"1994","journal-title":"AISB Workshop in Evolutionary Computing"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB13","unstructured":"M. Enzberger, The integration of a priori knowledge into a go playing neural network, Tech. Rep., University Munich, 1996."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB14","unstructured":"K. Erol, D. Nau, J. Hendler, HTN planning: complexity and expressivity, Proc. AAAI\u201994, July 1994."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB15","unstructured":"K. Erol, D. Nau, J. Hendler, UMCP: a sound and complete planning procedure for hierarchical task-network planning, Proc. AIPS-94, June 1994."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB16","unstructured":"D. Fotland, Knowledge representation in the many faces of go, Tech. Rep., American Go Association, 1993. Available online at: ftp:\/\/bsdserver.ucsf.edu\/Go\/comp\/mfg.Z."},{"issue":"4","key":"10.1016\/S0304-3975(00)00076-1_BIB17","first-page":"276","article-title":"The 3rd FOST cup world-open computer-go championship","volume":"20","author":"Fotland","year":"1997","journal-title":"ICCA J."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB18","unstructured":"I. Frank, Search and planning under incomplete information: a study using bridge card play, Ph.D. Thesis, Department of Artificial Intelligence, University of Edinburgh, 1996."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB19","unstructured":"I. Frank, D. Basin, A. Bundy, An adaptation of proof-planning to declarer play in bridge, Proc. 10th European Conf. on Artificial Intelligence (ECAI\u201992), Vienna, Austria, 1993, pp. 72\u201376. Longer Version available from Edinburgh as DAI Research Paper No. 575."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB20","unstructured":"M.L. Ginsberg, GIB: steps toward an expert-level bridge-playing program, Proc. 16th Internat. Joint Conf. on Artificial Intelligence (IJCAI\u201997), 1999."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB21","unstructured":"S. Hu, Multipurpose adversary planning in the game of go, Ph.D. Thesis George Mason University, 1995."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB22","unstructured":"T. Kojima, K. Ueda, S. Nagano, An evolutionary algorithm extended by ecological analogy and its application to the game of go, Proc. 15th Internat. Joint Conf. on Artificial Intelligence (IJCAI\u201997), 1997, pp. 684\u2013689."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB23","series-title":"Computer Game Playing","first-page":"167","article-title":"Strategic planning in go","author":"Lehner","year":"1983"},{"issue":"2","key":"10.1016\/S0304-3975(00)00076-1_BIB24","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1145\/322186.322201","article-title":"Go is polynomial-space hard","volume":"27","author":"Lichtenstein","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB25","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1613\/jair.64","article-title":"Total-order and partial-order planning","volume":"2","author":"Minton","year":"1994","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB26","unstructured":"M. M\u00fcller, Computer go as a sum of local games: an application of combinatorial game theory, Ph.D. Thesis, Swiss Federal Institute of Technology, Zurich, 1995."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB27","unstructured":"D.S. Nau, S.J.J. Smith, K. Erol, Control strategies in HTN planning: theory versus practice, Proc. Innovative Applications of Artificial Intelligence Conf. (in conjunction with AAAI\u201998), AAAI Press, 1998, pp. 1127\u20131133."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB28","unstructured":"J. Pearl, The solution for the branching factor of the \u03b1\u2013\u03b2 pruning algorithm and its optimality, Research Paper UCLA-ENG-CSL-8019, University of California, Los Angeles (UCLA), June 1981."},{"issue":"1","key":"10.1016\/S0304-3975(00)00076-1_BIB29","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0004-3702(77)90032-7","article-title":"A chess combination program which uses plans","volume":"8","author":"Pitrat","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB30","unstructured":"W. Reitman, B. Wilcox, The structure and performance of the INTRIM.2 go program, Proc. Internat. Joint Conf. on Artificial Intelligence (IJCAI\u201979), 1979, pp. 711\u2013719."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB31","unstructured":"P. Ricaud, A model of strategy for the game of go using abstraction mechanisms, Proc. 15th Internat. Joint Conf. on Artificial Intelligence (IJCAI\u201997), 1997, pp. 678\u2013683."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB32","unstructured":"N. Richards, D. Moriarty, R. Miikkulainen, Evolving neural networks to play go, Tech. Rep., The University of Texas at Austin, 1997."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB33","unstructured":"J.M. Robson, The complexity of go, Tech. Rep. TR-CS-82-14, Department of Computer Science, The Australian National University, Canberra 0200 ACT, Australia, October 1982. Also published IFIP: International Federation of Information Processing, 1983."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB34","series-title":"A Structure for Plans and Behaviour","author":"Sacerdoti","year":"1977"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB35","series-title":"Proc. 2nd Game Programming Workshop","article-title":"Do go players think in words? \u2014 Interim Report of the analysis of go player's protocols","author":"Saito","year":"1995"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB36","series-title":"Proc. 3rd Game Programming Workshop","article-title":"An analysis of strong go-players\u2019 protocols","author":"Saito","year":"1996"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB37","series-title":"Computer Game Playing","first-page":"152","article-title":"A strategic approach to the game of go","author":"Sander","year":"1983"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB38","unstructured":"J.J. Smith, D.S. Nau, Strategic planning for imperfect information games, Games: Planning and Learning, Papers from the 1993 Fall Symp., AAAI Press, 1993, pp. 84\u201391."},{"issue":"1","key":"10.1016\/S0304-3975(00)00076-1_BIB39","doi-asserted-by":"crossref","DOI":"10.1111\/j.1467-8640.1996.tb00255.x","article-title":"A planning approach to declarer play in contract bridge","volume":"12","author":"Smith","year":"1996","journal-title":"Comput. Intelligence"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB40","unstructured":"S.J.J. Smith, D.S. Nau, T.A. Throop, Total-order multi-agent task-network planning for contract bridge, Proc. AAAI\u201996, 1996, pp. 108\u2013113."},{"issue":"1","key":"10.1016\/S0304-3975(00)00076-1_BIB41","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0022-0000(83)90030-2","article-title":"On the complexity of chess","volume":"27","author":"Storer","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB42","unstructured":"A. Tate, Generating project networks, Proc. 5th Internat. Joint Conf. on Artificial Intelligence (IJCAI\u201977), 1977."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB43","unstructured":"D.E. Wilkins, Using plans in chess, Proc. 6th Internat. Joint Conf. on Artificial Intelligence (IJCAI\u201979), Tokyo, Japan, 1979, pp. 960\u2013967."},{"issue":"1","key":"10.1016\/S0304-3975(00)00076-1_BIB44","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(80)90039-9","article-title":"Using patterns and plans in chess","volume":"14","author":"Wilkins","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB45","unstructured":"S.N. Willmott, Adversarial planning and the game of go, Master's Thesis, Department of Artificial Intelligence, University of Edinburgh, September 1997."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB46","unstructured":"S.N. Willmott, A. Bundy, J.M. Levine, J.D.C. Richardson, Adversarial planning in complex domains, Tech. Rep., Department of Artificial Intelligence, University of Edinburgh, January 1998. Research Paper Number 889."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB47","unstructured":"T. Wolf, The program go tools and its computer-generated Tsumego database, Proc. 1st Game Programming Workshop, Computer Shogi Association, 1994, pp. 84\u201396."},{"key":"10.1016\/S0304-3975(00)00076-1_BIB48","series-title":"Proc. 3rd Game Programming Workshop","article-title":"About problems in generalizing a Tsumego program to open positions","author":"Wolf","year":"1996"},{"key":"10.1016\/S0304-3975(00)00076-1_BIB49","series-title":"Graded Go Problems for Beginners, Vols. I\u2013IV","author":"Yoshinori","year":"1985"},{"issue":"6","key":"10.1016\/S0304-3975(00)00076-1_BIB50","first-page":"186","article-title":"Applications of a theory of automated adversarial planning to command and control","volume":"16","author":"Young","year":"1990","journal-title":"IEEE Trans. Systems Man Cybernet."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000761?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000761?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T09:55:10Z","timestamp":1578563710000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":50,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0304397500000761"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00076-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}