Applying adversarial planning techniques to Go

DOI10.1016/S0304-3975(00)00076-1MaRDI QIDQ1589506zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 12 December 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00076-1

zbMATH Keywords

computer gamesGoadversarial planning

Mathematics Subject Classification ID

Combinatorial games (91A46)

Recommendations

• Goal-based game tree search for complex domains
• Computer Go: An AI oriented survey
• scientific article; zbMATH DE number 1759673
• Computer Go
• Global and local game tree search

Cites work

• scientific article; zbMATH DE number 3599517 (Why is no real title available?)
• A chronology of computer chess and its literature
• Applying adversarial planning techniques to Go
• GO Is Polynomial-Space Hard
• On the complexity of chess
• Partial-order planning: Evaluating possible efficiency gains
• Using patterns and plans in chess

Cited in

(11)

• Automated planning as an early verification tool for distributed control
• Computer Go
• Applying adversarial planning techniques to Go
• Computer Go: An AI oriented survey
• Computer-aided Go: Chess as a role model
• Goal threats, temperature, and Monte-Carlo Go
• The integration of practical search and heuristic knowledge into a competitive Go-playing program
• Using Artificial Boundaries in the Game of Go
• A survey of opponent modeling in adversarial domains
• scientific article; zbMATH DE number 2086967 (Why is no real title available?)
• Goal-based game tree search for complex domains

This page was built for publication: Applying adversarial planning techniques to Go

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589506)