Applying adversarial planning techniques to Go

Theoretical Computer Science

Volumn 252, Issue 1-2, 2001, Pages 45-82

  Willmott, Steven ^a   Richardson, Julian ^b   Bundy, Alan ^b   Levine, John ^b  

^a EPFL   (Switzerland)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Adversarial planning; Computer games; Go; Planning

Indexed keywords

THEOREM PROVING; TREES (MATHEMATICS);

ADVERSARIAL HIERARCHICAL TASK NETWORK PLANNING;

GAME THEORY;

EID: 0034922985     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00076-1     Document Type: Article

References (50)

1. An architecture for adversarial planning
2. Partial-order planning; evaluating possible efficiency gains
3. A chronology of computer chess and its literature
4. The challenge of go
5. An introduction to the computer go field and associated internet resources
6. Counterplanning: A strategy based model of adversarial planning in real world situations
7. Système d'Apprentisage par Auto-Observation
8. Metaprogramming forced moves
9. Evolving go playing strategy in neural networks
10. HTN planning: Complexity and expressivity
11. UMCP: A sound and complete planning procedure for hierarchical task-network planning
12. The 3rd FOST cup world-open computer-go championship
13. An adaptation of proof-planning to declarer play in bridge
14. GIB: Steps toward an expert-level bridge-playing program
15. An evolutionary algorithm extended by ecological analogy and its application to the game of go
16. Strategic planning in go
17. Go is polynomial-space hard
18. Total-order and partial-order planning: A comparative analysis
19. Control strategies in HTN planning: Theory versus practice
20. A chess combination program which uses plans
21. The structure and performance of the INTRIM.2 go program
22. A model of strategy for the game of go using abstraction mechanisms
23. Do go players think in words? - Interim Report of the analysis of go player's protocols
24. An analysis of strong go-players' protocols
25. A strategic approach to the game of go
26. Strategic planning for imperfect information games
27. A planning approach to declarer play in contract bridge
28. Total-order multi-agent task-network planning for contract bridge
29. On the complexity of chess
30. Generating project networks
31. Using plans in chess
32. Using patterns and plans in chess
33. The program go tools and its computer-generated Tsumego database
34. About problems in generalizing a Tsumego program to open positions
35. Applications of a theory of automated adversarial planning to command and control