Probabilistic analysis for randomized game tree evaluation

MaRDI QIDQ3154675zbMATH OpenFDO

Authors Tämur Ali Khan, Ralph Neininger

Publication date 14 January 2005

Full work available at URL https://arxiv.org/abs/math/0405322

Mathematics Subject Classification ID

Combinatorial probability (60C05) Central limit and other weak theorems (60F05) Large deviations (60F10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 5764927
• On the Optimality of Randomized \alpha-\beta Search
• Probabilistic recurrence relations revisited
• scientific article; zbMATH DE number 850228
• The Variance of Two Game Tree Algorithms

Cited in

(4)

• On tail bounds for random recursive trees
• The Variance of Two Game Tree Algorithms
• A large deviation theory analysis of Bayesian tree search
• The Complexity of Algorithms Computing Game Trees on Random Assignments

This page was built for publication: Probabilistic analysis for randomized game tree evaluation

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