Not Like Other Games - Why Tree Search in Go is Different

Proceedings of the Joint Conference on Information Sciences

Volumn 5, Issue 1, 2000, Pages 974-977

  Müller, Martin ^a  

^a ELECTROTECHNICAL LABORATORY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; DATABASE SYSTEMS; FUNCTIONS; GAME THEORY; GRAPHIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

ENDGAMES; STATIC ANALYSIS;

COMPUTER SCIENCE;

EID: 1642330034     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. E. Berlekamp and D. Wolfe. Mathematical Go: Chilling Gets the Last Point. A K Peters, Wellesley, 1994.
2. K. Chen. The move decision process of Go Intellect. Computer Go, 14:9-17, 1990.
3. A. Junghanns and J. Schaeffer. Domain-dependent single-agent search enhancements. In IJCAI-99, pages 570-575, 1999.
4. M. Müller. Decomposition search: A combinatorial games approach to game tree search, with applications to solving Go endgames. In IJCAI-99, pages 578-583, 1999.
5. M. Müller. Partial order bounding: Using partial order evaluation in game tree search. Technical Report TR-99-12, Electrotechnical Laboratory, Tsukuba, Japan, 1999.