The secret of selective game tree search, when using random-error evaluations

DOI10.1007/3-540-45841-7_16MaRDI QIDQ4736840zbMATH OpenFDO

Authors Ulf Lorenz, Burkhard Monien

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850203.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) 2-person games (91A05) Combinatorial games (91A46)

Recommendations

• Error analysis in minimax trees
• Error propagation in game trees
• A theory of heuristic information in game-tree search
• A study of decision error in selective game tree search
• scientific article; zbMATH DE number 269837

Cited in

(10)

• A study of decision error in selective game tree search
• Error analysis in minimax trees
• Controlled conspiracy-2 search. (Extended abstract)
• A theory of heuristic information in game-tree search
• scientific article; zbMATH DE number 805352 (Why is no real title available?)
• Algorithms – ESA 2004
• Partial order bounding: A new approach to evaluation in game tree search
• The effect of mobility on minimaxing of game trees with random leaf values
• Selecting evaluation functions in opponent-model search
• Error propagation in game trees

This page was built for publication: The secret of selective game tree search, when using random-error evaluations

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