Remarks on History and Presence of Game Tree Search and Research

DOI10.1007/978-3-642-36899-8_34zbMath1309.68170OpenAlexW120731911MaRDI QIDQ4915265

Ingo Althöfer

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_34

zbMATH Keywords

game tree searchcomputer chesscomputer gomonte carlo game search

Mathematics Subject Classification ID

Games in extensive form (91A18) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• Computing a perfect strategy for nxn chess requires time exponential in n
• An investigation of the causes of pathology in games
• Improved game play by multiple computer hints
• Checkers Is Solved
• Random-Turn Hex and Other Selection Games
• GO Is Polynomial-Space Hard
• Correlation of Boolean Functions and Pathology in Recursion Trees
• ON THE APPLICATION OF DYNAMIC PROGRAMING TO THE DETERMINATION OF OPTIMAL PLAY IN CHESS AND CHECKERS

This page was built for publication: Remarks on History and Presence of Game Tree Search and Research