An Adversarial Planning Approach to Go

@inproceedings{Willmott1998AnAP,
  title={An Adversarial Planning Approach to Go},
  author={Steven Willmott and Julian Richardson and Alan Bundy and John Levine},
  booktitle={Computers and Games},
  year={1998}
}
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… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Graded Go Problems for beginners (Volumes I - IV)

  • K. Yoshinori
  • 1985
Highly Influential
6 Excerpts

A strategic approach to the game of Go

  • P. T. Sander, D.J.M. Davies
  • Computer Game Playing: Theory and Practice,
  • 1983
Highly Influential
5 Excerpts

Strategic Planning in Go

  • P. Lehner
  • Computer Game Playing: Theory and Practice,
  • 1983
Highly Influential
5 Excerpts

An Adversarial Planning Approach to Go (long version)

  • S. Willmott, J. Richardson, A. Bundy, J. Levine
  • Technical report, Department of Artificial…
  • 1998
2 Excerpts

Adversarial Planning and the Game of Go

  • S. Willmott
  • Master’s thesis, Department of Artificial…
  • 1997
3 Excerpts

Similar Papers

Loading similar papers…