
## References

Adelson-Velskiy, G., Arlazarov, V., & Donskoy, M. (1975). Some methods of controlling the tree search in chess programs. Artificial Intelligence, 6, 361-371.

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.

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–
49.

Blackwood, E. (1979). Play of the Hand with Blackwood. Bobbs-Merrill. Eskes, O. (1997). GIB: Sensational breakthrough in bridge software. IMP, 8 (2). Frank, I. (1998). Search and Planning under Incomplete Information: A Study Using Bridge Card Play. Springer-Verlag, Berlin.

Frank, I., & Basin, D. (1998). Search in games with incomplete information: A case study using bridge card play. Artificial Intelligence, 100, 87-123.

Frank, I., Basin, D., & Bundy, A. (2000). Combining knowledge and search to solve singlesuit bridge. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pp. 195–200.

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.

Ginsberg, M. L. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25-46.

Ginsberg, M. L., & Harvey, W. D. (1992). Iterative broadening. Artificial Intelligence, 55, 367-383.

Ginsberg, M. L., & Jaffray, A. (2001). Alpha-beta pruning under partial orders. In Games of No Chance II. To appear.

Gratzer, G. (1978). General Lattice Theory. Birkhauser Verlag, Basel. Greenblatt, R., Eastlake, D., & Crocker, S. (1967). The greenblatt chess program. In Fall Joint Computer Conference 31, pp. 801-810.

Joslin, D. E., & Clements, D. P. (1999). Squeaky wheel optimization. Journal of Artificial Intelligence Research, 10, 353-373.

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.

Levy, D. N. (1989). The million pound bridge program. In Levy, D., & Beal, D. (Eds.),
Heuristic Programming in Artificial Intelligence, Asilomar, CA. Ellis Horwood.

Lind-Nielsen, J. (2000). BuDDy: Binary Decision Diagram package. Tech. rep., Department of Information Technology, Technical University of Denmark, DK-2800 Lyngby, Denmark.