Hans J. Berliner

Berliner, Hans J. 1978. “A Chronology of Computer Chess and its Literature.” Artificial Intelligence 10(2): 201–214.

Berliner, Hans J. 1979. “The B* Tree Search Algorithm: A Best-First Procedure.” Artificial Intelligence 12(1): 23–40. Reprinted in Webber and Nilsson (1981, 79–87).

Berliner, Hans J. 1980. “Backgammon Computer Program Beats World Champion.” Artificial Intelligence 14(2): 205–220.

Berliner, Hans J. and Beal, Don F. 1990. “Introduction.” Artificial Intelligence 43(1): 1–5.

Berliner, Hans J. and Campbell, Murray S. 1984. “Using Chunking to Solve Chess Pawn Endgames.” Artificial Intelligence 23(1): 97–120.

Berliner, Hans J. and Ebeling, Carl L. 1989. “Pattern Knowledge and Search: The SUPREM Architecture.” Artificial Intelligence 38(2): 161–198.

Berliner, Hans J., Goetsch, Gordon, Campbell, Murray S. and Ebeling, Carl L. 1990. “Measuring the Performance Potential of Chess Programs.” Artificial Intelligence 43(1): 7–20.

Berliner, Hans J. and McConnell, Chris. 1996. “B Probability Based Search[*].” Artificial Intelligence 86(1): 97–156.

Webber, Bonnie Lynn and Nilsson, Nils J., eds. 1981. Readings in Artificial Intelligence. San Francisco, California: Morgan Kaufmann Publishers.