Steven Willmott, Julian Richardson, Alan Bundy, John Levine  Home/Search
Context
Related
| dai.ed.ac.uk/~juli..._planning_go.ps.gz liawww.epfl.ch/Publi...Willmott2001e.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cee.hw.ac.uk/~juli...publications (more) Homepages: J.Richardson |
Rate this article:      (best)Comment on this article |
Abstract: Approaches to computer game playing based on ff \Gamma fi search of the tree of possible move sequences combined with a position evaluation function have been successful for many games, notably Chess. Such approaches are less successful for games with large search spaces and complex positions, such as Go, and we are led to seek alternatives. 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... (Update)
Similar documents (at the sentence level):
54.9%: Applying Adversarial Planning Techniques to Go - Willmott, Richardson, Bundy.. (2001) (Correct)
15.7%: An Adversarial Planning Approach to Go - Willmott, Richardson, Bundy, Levine (1998) (Correct)
Active bibliography (related documents): More All
1.4: Computer Go: an AI Oriented Survey - Bouzy (2001) (Correct)
1.4: Adversarial Planning in Complex Domains - Willmott, Bundy, Levine.. (1998) (Correct)
0.5: Computer Go - Müller (2000) (Correct)
Similar documents based on text: More All
0.6: Pursuing abstract goals in the game of Go - Meijer, Koppelaar (2001) (Correct)
0.6: OBDD-Based Optimistic and Strong Cyclic Adversarial Planning - Jensen, Veloso, Bowling (2001) (Correct)
0.3: Agent Communication Semantics for Open Environments.. - Willmott, Dale, Charlton (2002) (Correct)
BibTeX entry: (Update)
@article{ willmott01applying,
author = "Steven Willmott and Julian Richardson and Alan Bundy and John Levine",
title = "Applying adversarial planning techniques to {Go}",
journal = "Theoretical Computer Science",
volume = "252",
number = "1--2",
pages = "45--82",
year = "2001",
url = "citeseer.ist.psu.edu/article/willmott99applying.html" }
Citations (may not include all citations):251 Generating Project Networks (context) - Tate - 1977
89 HTN Planning: Complexity and Expressivity - Erol, Nau et al. - 1994
31 Total-Order and Partial-Order Planning: A Comparative Analys.. - Minton, Bresina et al. - 1994
31 A Structure for Plans and Behaviour (context) - Sacerdoti - 1977
26 Using Patterns and Plans in Chess (context) - Wilkins - 1980
23 GIB: Steps Toward an Expert-Level Bridge-Playing Program - Ginsberg - 1999
22 Knowledge Representation in The Many Faces of Go (context) - Fotland - 1993
20 An Adaptation of Proof-Planning to Declarer Play in Bridge - Frank, Basin et al. - 1992
18 Total-Order Multi-Agent TaskNetwork Planning for Contract Br.. - Smith, Nau et al. - 1996
17 Evolving Neural Networks to Play Go - Richards, Moriarty et al. - 1997
17 UMCP: A Sound and Complete Planning Procedure for Hierarchic.. (context) - Erol, Nau et al. - 1994
17 Strategic Planning for Imperfect Information Games - Smith, Nau - 1993
15 The Program GoTools and its Computer-Generated Tsumego Datab.. - Wolf - 1994
15 Graded Go Problems for beginners (context) - Yoshinori - 1985
15 Go is Polynomial-Space Hard (context) - Lichtenstein, Sipser - 1980
13 Control Strategies in HTN Planning: Theory Versus Practice - Nau, Smith et al. - 1998
12 About Problems in Generalizing a Tsumego Program to Open Pos.. - Wolf - 1996
12 Search and Planning under Incomplete Information: a study us.. - Frank - 1996
11 A Planning Approach to Declarer Play in Contract Bridge - Smith, Nau et al. - 1996
8 Counterplanning: A Strategy Based Model of Adversarial Plann.. (context) - Carbonell - 1981
8 An Analysis of Strong Go-Players' Protocols (context) - Saito, Yoshikawa - 1996
8 A Chess Combination Program Which Uses Plans (context) - Pitrat - 1977
8 An Architecture for Adversarial Planning (context) - Applegate, Elsaesser et al. - 1990
7 Multipurpose Adversary Planning in The Game of Go (context) - Hu - 1995
7 An Evolutionary Algorithm Extended by Ecological Analogy and.. - Kojima, Ueda et al. - 1997
7 Journal of Computer and System Sciences - Storer, Complexity - 1983
6 Computer Go as a Sum of Local Games: An Application of Combi.. (context) - Muller - 1995
5 Metaprogramming Forced Moves - Cazenave - 1998
5 A Model of Strategy for the Game of Go Using Abstraction Mec.. (context) - Ricaud - 1997
5 Strategic Planning in Go (context) - Lehner - 1983
5 rd FOST Cup World-Open Computer-Go Championship (context) - Fotland, Yoshikawa - 1997
5 Do Go Players Think in Words (context) - Saito, Yoshikawa - 1995
5 The Ishi Press Inc (context) - Davies, Death - 1978
5 An Introduction to the Computer Go Field and Associated Inte.. (context) - Burmeister, Wiles - 1997
5 Applications of a Theory of Automated Adversarial Planning t.. (context) - Young, Lehner - 1990
5 A Chronology of Computer Chess and its Literature (context) - Berliner - 1978
4 Second Book of Go (context) - Bozulich - 1987
4 A Strategic Approach to the Game of Go (context) - Sander, Davies - 1983
4 The Structure and Performance of the INTRIM (context) - Reitman, Wilcox - 1979
3 New Scientist (context) - Brown, Dowsey et al. - 1979
3 eme d'Apprentisage par Auto-Observation (context) - Cazenave - 1996
3 Department of Artificial Intelligence (context) - Willmott, the et al. - 1997
3 Evolving Go Playing Strategy in Neural Networks - Donnelly, Corr et al. - 1994
2 Using Plans in Chess (context) - Wilkins - 1979
2 Adversarial Planning in Complex Domains - Willmott, Bundy et al. - 1998
2 The Integration of a Priori Knowledge into a Go Playing Neur.. (context) - Enzberger - 1996
1 The Solution for the Branching Factor of the ff\Gammafi Prun.. (context) - Pearl - 1981
1 Partial-Order Planning; Evaluating Possible Efficiency Gains (context) - Barrett, Weld - 1994
1 Playing Go with Filter Functions (context) - Silva, Genetic - 1996
Documents on the same site (http://www.cee.hw.ac.uk/~julianr/publications.html): More
Proof Planning with Schema Frameworks - Richardson (1998) (Correct)
Proofs About Lists Using Ellipsis - Bundy, Richardson (1999) (Correct)
Development of Correct Transformation Schemata for Prolog Programs - Norbert (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC