Two-agent ida*

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 10, Issue 4, 1998, Pages 451-485

  Prieditis, Armand E ^a   Fletcher, Evan ^a  

^a University of California Davis   (United States)

Author keywords

Two agent search algorithm branch and bound pruning with alpha beta pruning tida*

Indexed keywords

EID: 0032333372     PISSN: 0952813X     EISSN: 13623079     Source Type: Journal    
DOI: 10.1080/095281398146707     Document Type: Article

References (36)

1. Abramson, B. and Korf, R., 1987, A model of two-layer evaluation functions. Proceedings AAAI-87, Seattle, WA, August (Menlo Park, CA: American Association for Artificial Intelligence).
2. Allis, L. V., Van Der Meulen, M. and van Den Herik, H., 1990, Alpha-beta conspiracy-number search. Technical Report CS90-03, University of Limburg, October.
3. Beal, D., 1980, An analysis of minimax. Advances in Computer Chess 3 (Edinburgh: Edinburgh University Press).
4. Berliner, H., 1979, The B* search algorithm: A best-first proof procedure. Artificial Intelligence, 12(1), 23-40. Also in Readings in Artificial Intelligence, edited by B. L. Webber and N. J. Nilsson (Palo Alto, CA: Tioga Press).
5. Birmingham, J. and Kent, P., 1997, Tree searching and tree-pruning techniques. Advances in Computer Chess 1 (Edinburgh: Edinburgh University Press), pp. 89-107.
6. Campbell, M. S. and Marsland, T. A., 1983, A comparison of minimax tree search algorithms. Artificial Intelligence, 20(4), 347-367.
7. Christensen, J. and Korf, R., 1986, A unified theory of heuristic evaluation functions and its applications to learning. Proceedings AAAI-86, Philadelphia, Pennsylvania, August (American Association for Artificial Intelligence), pp. 148-152.
8. Greenblatt, R., Eastlake, D. and Crocker, S., 1988, The Greenblatt chess program. Computer Chess Compendium (Berlin: Springer-Verlag), pp. 56-66.
9. Horacek, H., 1983, Knowledge-based move selection and evaluation to guide the search in chess pawn endings. International Computer Chess Association Journal, 6(3), 20-37.
10. Kaindl, H., Shams, R. and Horacek, H., 1991, Minimax search algorithms with and without aspiration windows. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(12), 1225-1235.
11. Knuth, D. and Moore, R., 1975, An analysis of alpha-beta pruning. Artificial Intelligence, 6, 293-326.
12. Korf, R. and Chickering, D., 1994, Best-first minimax search: Othello results. Proceedings AAAI-94, Seattle, WA, August (American Association for Artificial Intelligence).
13. Korf, R., Pemberton, J. and Zhang, W., 1994, Incremental random search trees. Working Notes of the AAAI Spring Symposium Series, Stanford, CA, March (American Association for Artificial Intelligence).
14. Korf, R., 1985, Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27(2), 97-109.
15. Korf, R., 1990, Real-time heuristic search. Artificial Intelligence, 42(2), 189-211.
16. Lee, P., 1989, Bayesian Statistics: An Introduction (New York: Halsted Press).
17. Marsland, T. A., 1983, Relative efficiency of alpha-beta implementations. Proceedings IJCAI-8, Karlsruhe, West Germany, August (International Joint Conferences on Artificial Intelligence), (San Mateo, CA: Morgan Kauffman), pp. 763-766.
18. Marsland, T. A., 1987, Computer chess and search. The Encyclopedia of Artificial Intelligence (Palo Alto, CA: Wiley), pp. 224-241.
19. McAllester, D., 1988, Conspiracy numbers for min-max search. Artificial Intelligence, 35(3), 287-310.
20. Nau, D., 1983, Pathology on game trees revisited and an alternative to minimaxing. Artificial Intelligence, 21(1-2), 221-244.
21. Nilsson, N. J. 1980, Principles of Artificial Intelligence (Palo Alto, CA: Morgan Kaufmann).
22. Patashnik, O., 1986, Qubic: 4X 4X 4 tic-tac-toe. Mathematics Magazine (53), 202-216.
23. Pearl, J., 1984, Heuristics: Intelligent Search Strategies for Computer Problem-Solving (Reading, MA: Addison-W esley).
24. Prieditis, A., 1993. Machine discovery of effective admissible heuristics. Machine Learning, 12, 117-141.
25. Rich, E. and Knight, K., 1991, Artificial Intelligence, second edition (New York: McGraw-Hill, Inc.).
26. Rivest, R., 1987, Game tree searching by min/max approximation. Artificial Intelligence, 34(1), 77-96.
27. Russell, S. and Norvig, P., 1995, Artificial Intelligence: A Modern Approach (Prentice-Hall).
28. Russell, S. and Wefald, E., 1989, On optimal game-tree search using rational meta-reasoning. Proceedings IJCAI-11, Detroit, MI, August (International Joint Conferences on Artificial Intelligence), (San Mateo, CA: Morgan Kauffman), pp. 334-340.
29. Shoo, P., 1992, Qubic's last appearance. Heuristic Programming In Artificial Intelligence, edited by Van Den Herik and V. Allis, pp. 56-58.
30. Smith, S. and Nau, D., 1994, An analysis of forward pruning. Proceedings AAAI-94, Seattle, WA, August (American Association for Artificial Intelligence).
31. Stockman, G. C., 1979, A minimax algorithm better than alpha-beta. Artificial Intelligence, 12(1), 179-196.
32. Tesauro, G., 1992, Practical issues in temporal difference learning. Machine Learning, 8, 257-277.
33. Vempathy, N. R., Kumar, V. and Korf, R. E., 1991, Depth-first vs. best first search. Proceedings AAAI-9, Anaheim, CA (American Association for Artificial Intelligence), pp. 434-440.
34. Winston, P., 1992. Artificial Intelligence, third edition (Reading, MA: Addison-Wesley).
35. Zhang, W. and Korf, R., 1992, An average-case analysis of branch-and-bound with applications: summary of results. Proceedings AAAI-92, San Jose, CA (American Association for Artificial Intelligence), pp. 545-550.
36. Zhang, W. and Korf, R., 1993, Depth-first vs. best first search: new results. Proceedings AAAI-93, Washington, DC (American Association for Artificial Intelligence), pp. 769-775.