The effect of mobility on minimaxing of game trees with random leaf values

DOI10.1016/S0004-3702(01)00072-8zbMath0992.68165MaRDI QIDQ5958105

Mark Levene, Trevor I. Fenner

Publication date: 3 March 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

minimaxdominationmobilityrandom evaluation functionrandom minimaxingsearch depthtame trees

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (2)

Effect of look-ahead depth in evolutionary checkers ⋮ Bias and pathology in minimax search

Cites Work

• A Bayesian approach to relevance in game playing
• The last player theorem
• On the nature of pathology in game searching
• Decision Quality As a Function of Search Depth on Game Trees
• Correlation of Boolean Functions and Pathology in Recursion Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The effect of mobility on minimaxing of game trees with random leaf values