Re: computer-go: Semeai graph

[Martin Mueller <mmueller@xxxxxxxxxxxxxx>]

>I've seen one other piece of work treating go as a graph, although Im sure
>there are completely different ways of approaching the problem:
>

Yes, that's an interesting paper.
Approaching Go as an abstract graph problem goes back a long way, to
Friedenbach's PhD thesis:

@PHDTHESIS{Friedenbach1980,
 AUTHOR       = "Friedenbach, K. J.",
 TITLE        = "Abstraction Hierarchies: A Model of Perception and
Cognition in the Game of Go",
 SCHOOL       = "University of California, Santa Cruz",
 YEAR         = "1980"}

However, there are important details that get thrown out with every such
approach that I have seen so far. For example in semeai, you can compare
Nakamura's work with mine. My papers are much more restricted in scope, but
I think all these extra conditions and precautions in there are necessary.
And even in those papers I don't write down every detail about the ugly
truth :)

@INPROCEEDINGS{Mueller1999f,
 AUTHOR       = "M{\"u}ller, M.",
 TITLE        = "Race to Capture: Analyzing Semeai in {Go}",
 BOOKTITLE    = "Game Programming Workshop in Japan '99",
 SERIES       = "IPSJ Symposium Series",
 VOLUME       = "99(14)",
 PAGES        = "61--68",
 YEAR         = "1999"}

@ARTICLE{Mueller2001a,
 AUTHOR       = "M{\"u}ller, M.",
 TITLE        = "Partial Order Bounding: A new Approach to Evaluation in
Game Tree Search",
 YEAR         = "2001",
 JOURNAL      = "Artificial Intelligence",
 VOLUME       = "129",
 NUMBER       = "1-2",
 PAGES        = "279--311"}

http://web.cs.ualberta.ca/~mmueller/publications.html

>This last conference should have its proceedings published in "Advances in
>Computer Chess 9", but  this seems not to be published yet (and will
>probably be too expensive to buy anyway).

It has just come out. You can contact Martine Tiessen
M.Tiessen@xxxxxxxxxxxxxxxxx for ordering information.

	Martin