Unifying single-agent and two-player search

Information Sciences

Volumn 135, Issue 3-4, 2001, Pages 151-175

  Schaeffer, Jonathan ^a   Plaat, Aske ^b   Junghanns, Andreas ^c  

^a UNIVERSITY OF ALBERTA   (Canada)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

^c Research and Technology   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

HEURISTIC SEARCH;

HEURISTIC PROGRAMMING;

EID: 0035398782     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(01)00134-7     Document Type: Article

References (47)

1. Which games will survive
2. An approach to heuristic problem-solving and theorem proving in the propositional calculus
3. Singular extensions: Adding selectivity to brute-force searching
4. A Bayesian approach to relevance in game playing
5. The B* tree search algorithm: A best-first proof procedure
6. B* probability based search
7. Hitech
8. ProbCut: A powerful selective extension of the αβ algorithm
9. Searching with pattern databases
10. Pattern databases
11. An analysis of time-dependent planning
12. Experiments with the null move heuristic
13. The Greenblatt chess program
14. A formal basis for the heuristic determination of minimum cost paths
15. Limited discrepancy search
16. A space-time tradeoff for memory-based heuristics
17. Single-agent search in the presence of deadlock
18. Domain-dependent single-agent search enhancements
19. How to use limited memory in heuristic search
20. Iterative deepening: An optimal admissible tree search
21. Real-time heuristic search
22. Linear-space best-first search
23. Complexity analysis of admissible heuristic search
24. BIDA*: An improved perimeter search algorithm
25. Enhanced iterative-deepening search
26. Conspiracy numbers for min-max searching
27. Pathology on game trees revisited, and an alternative to minimaxing
28. On the nature of pathology in game searching
29. Best-first fixed-depth minimax algorithms
30. Exploiting graph properties of game trees
31. Complete solution of the eight-puzzle and the benefit of node ordering in IDA*
32. The history heuristic and alpha-beta search enhancements in practice
33. A chess-playing program
34. Chess 4.5 - The Northwestern University chess program
35. Pruning duplicate nodes in depth-first search
36. Computer chess strength
37. Performance of linear-space search algorithms
38. A study of complexity transitions on the asymmetric traveling salesman problem