Goal-based game tree search for complex domains

DOI10.1007/978-3-642-11819-7_8MaRDI QIDQ4932618zbMATH OpenOpenAlexWikidataFDO

Authors Viliam Lisý, Branislav Bošanský, Michal Jakob, Michal Pěchouček

Publication date 6 October 2010

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11819-7_8

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Searching and sorting (68P10) (n)-person games, (n>2) (91A06) Noncooperative games (91A10)

Recommendations

• Applying adversarial planning techniques to Go
• scientific article; zbMATH DE number 4162295
• scientific article; zbMATH DE number 4162309
• scientific article; zbMATH DE number 269837
• scientific article; zbMATH DE number 4001519

Cited in

(3)

• Applying adversarial planning techniques to Go
• scientific article; zbMATH DE number 4162295 (Why is no real title available?)
• Sokoban: Enhancing general single-agent search methods using domain knowledge

This page was built for publication: Goal-based game tree search for complex domains

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