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

Artificial Intelligence

Volumn 130, Issue 1, 2001, Pages 1-26

  Levene, Mark ^a   Fenner, Trevor I ^b  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Domination; Game trees; Minimax; Mobility; Random evaluation function; Search depth

Indexed keywords

GAME THEORY; PROBABILITY; RANDOM PROCESSES; TREES (MATHEMATICS);

GAME TREES; RANDOM MINIMAXING;

ARTIFICIAL INTELLIGENCE;

EID: 0035399521     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00072-8     Document Type: Article

References (25)

1. Correlation of boolean functions and pathology in recursion trees
2. A Bayesian approach to relevance in game playing
3. Random evaluation in Chess
4. Comparison of the minimax product back-up rules in a variety of games
5. What is a game?
6. How to extract relevant knowledge from grandmaster games, Part 2: The notion of mobility, and the work of De Groot and Slater
7. Sundry computer chess topics
8. Tree searching algorithms
9. Reasons for the effects of bounded look-ahead search
10. The development of a world class Othello program
11. A partial analysis of minimaxing game trees with random leaf nodes
12. The last player theorem
13. Decision quality as a function of search depth on game trees
14. Search with probabilities
15. On the nature of pathology in game searching
16. A re-examination of brute-force search
17. Presence and absence of pathology in game trees
18. Programming a computer for playing chess
19. Statistics for the chess computer and the factor of mobility