Applying adversarial planning techniques to Go

DOI10.1016/S0304-3975(00)00076-1zbMath0962.91011OpenAlexW2149369860MaRDI QIDQ1589506

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)

Related Items (4)

Computer Go ⋮ Applying adversarial planning techniques to Go ⋮ Automated planning as an early verification tool for distributed control ⋮ A Survey of Opponent Modeling in Adversarial Domains

Cites Work

• Unnamed Item
• On the complexity of chess
• Using patterns and plans in chess
• A chronology of computer chess and its literature
• Partial-order planning: Evaluating possible efficiency gains
• Applying adversarial planning techniques to Go
• GO Is Polynomial-Space Hard

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