GIB: Imperfect information in a computationally challenging game

Journal of Artificial Intelligence Research

Volumn 14, Issue , 2001, Pages 313-368

  Ginsberg, Matthew L ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER PROGRAM LISTINGS; INFORMATION ANALYSIS; MONTE CARLO METHODS; OPTIMIZATION; PROBLEM SOLVING;

INFORMATION GAMES;

GAME THEORY;

EID: 0036374294     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.820     Document Type: Article

References (30)

1. Adelson-Velskiy, G., Arlazarov, V., & Donskoy, M. (1975). Some methods of controlling the tree search in chess programs. Artificial Intelligence, 6, 361-371.
2. Bayardo, R. J., & Miranker, D. P. (1996). A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 298-304.
3. Billings, D., Papp, D., Schaeffer, J., & Szafron, D. (1998). Opponent modeling in poker. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 493-499.
4. Blackwood, E. (1979). Play of the Hand with Blackwood. Bobbs-Merrill.
5. Eskes, O. (1997). GIB: Sensational breakthrough in bridge software. IMP, 8(2).
6. Frank, I. (1998). Search and Planning under Incomplete Information: A Study Using Bridge Card Play. Springer-Verlag, Berlin.
7. Frank, I., & Basin, D. (1998). Search in games with incomplete information: A case study using bridge card play. Artificial Intelligence, 100, 87-123.
8. Frank, I., Basin, D., & Bundy, A. (2000). Combining knowledge and search to solve single-suit bridge. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pp. 195-200.
9. Frank, I., Basin, D., & Matsubara, H. (1998). Finding optimal strategies for imperfect information games. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 500-507.
10. Ginsberg, M. L. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25-46.
11. Ginsberg, M. L., & Harvey, W. D. (1992). Iterative broadening. Artificial Intelligence, 55, 367-383.
12. Ginsberg, M. L., & Jaffray, A. (2001). Alpha-beta pruning under partial orders. In Games of No Chance II. To appear.
13. Grätzer, G. (1978). General Lattice Theory. Birkhäuser Verlag, Basel.
14. Greenblatt, R., Eastlake, D., & Crocker, S. (1967). The greenblatt chess program. In Fall Joint Computer Conference 31, pp. 801-810.
15. Joslin, D. E., & Clements, D. P. (1999). Squeaky wheel optimization. Journal of Artificial Intelligence Research, 10, 353-373.
16. Koller, D., & Pfeffer, A. (1995). Generating and solving imperfect information games. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 1185-1192.
17. Levy, D. N. (1989). The million pound bridge program. In Levy, D., & Beal, D. (Eds.), Heuristic Programming in Artificial Intelligence, Asilomar, CA. Ellis Horwood.
18. Lind-Nielsen, J. (2000). BuDDy: Binary Decision Diagram package. Tech. rep., Department of Information Technology, Technical University of Denmark, DK-2800 Lyngby, Denmark.
19. Lindelöf, T. (1983). COBRA: The Computer-Designed Bidding System. Gollancz, London.
20. Marsland, T. A. (1986). A review of game-tree pruning. J. Intl. Computer Chess Assn., 9(1), 3-19.
21. McAllester, D. A. (1988). Conspiracy numbers for min-max searching. Artificial Intelligence, 35, 287-310.
22. Pearl, J. (1980). Asymptotic properties of minimax trees and game-searching procedures. Artificial Intelligence, 14(2), 113-138.
23. Pearl, J. (1982). A solution for the branching factor of the alpha-beta pruning algorithm and its optimality. Comm. ACM, 25(8), 559-564.
24. Plaat, A., Schaeffer, J., Pijls, W., & de Bruin, A. (1996). Exploiting graph properties of game trees. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 234-239.
25. Schaeffer, J. (1997). One Jump Ahead: Challenging Human Supremacy in Checkers. Springer-Verlag, New York.
26. Sheinwold, A. (1996). Five Weeks to Winning Bridge. Pocket Books.
27. Smith, S. J., Nau, D. S., & Throop, T. (1996). Total-order multi-agent task-network planning for contract bridge. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, Stanford, California.
28. Stallman, R. M., & Sussman, G. J. (1977). Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence, 9, 135-196.
29. Sterling, L., & Nygate, Y. (1990). PYTHON: An expert squeezer. J. Logic Programming, 8, 21-40.
30. Wilkins, D. E. (1980). Using patterns and plans in chess. Artificial Intelligence, 14, 165-203.