1996 |
27 | EE | Hans J. Berliner,
Chris McConnell:
B Probability Based Search.
Artif. Intell. 86(1): 97-156 (1996) |
1994 |
26 | | Jefferey A. Shufelt,
Hans J. Berliner:
Generating Hamiltonian Circuits without Backtracking from Errors.
Theor. Comput. Sci. 132(2): 347-375 (1994) |
1990 |
25 | EE | Hans J. Berliner,
Danny Kopec,
Ed Northam:
A taxonomy of concepts for evaluating chess strength.
SC 1990: 336-343 |
24 | | Hans J. Berliner,
Donald F. Beal:
Introduction.
Artif. Intell. 43(1): 1-5 (1990) |
23 | | Hans J. Berliner,
Gordon Goetsch,
Murray Campbell,
Carl Ebeling:
Measuring the Performance Potential of Chess Programs.
Artif. Intell. 43(1): 7-20 (1990) |
1989 |
22 | | Hans J. Berliner:
Hitech Chess Report - Hitech Defeats Denker in AGS Challenge Match.
AI Magazine 10(1): 83-84 (1989) |
21 | | Hans J. Berliner:
Chess Report - Deep Thought Wins Fredkin Intermediate Prize.
AI Magazine 10(2): 89-90 (1989) |
20 | | Hans J. Berliner,
Carl Ebeling:
Pattern Knowledge and Search: The SUPREM Architecture.
Artif. Intell. 38(2): 161-198 (1989) |
1988 |
19 | | Hans J. Berliner:
New Hitech Computer Chess Success.
AI Magazine 9(2): 133 (1988) |
18 | | Hans J. Berliner:
Pennsylvania State Chess Championship - Hitech Becomes First Computer Senior Master.
AI Magazine 9(3): 85-87 (1988) |
1987 |
17 | | Hans J. Berliner:
Pennsylvania Chess Championship Report - HITECH Wins Chess Tourney.
AI Magazine 8(4): 101-102 (1987) |
1986 |
16 | | Hans J. Berliner,
Carl Ebeling:
The SUPREM Architecture: A New Intelligent Paradigm.
Artif. Intell. 28(1): 3-8 (1986) |
1985 |
15 | | Hans J. Berliner,
Gordon Goetsch:
A Study of Search Methods: The Effect of Constraint Satisfaction and Adventurousness.
IJCAI 1985: 1079-1082 |
1984 |
14 | | Hans J. Berliner,
Murray Campbell:
Using Chunking to Solve Chess Pawn Endgames.
Artif. Intell. 23(1): 97-120 (1984) |
1983 |
13 | | Murray Campbell,
Hans J. Berliner:
A Chess Program That Chunks.
AAAI 1983: 49-53 |
1982 |
12 | | Hans J. Berliner,
David H. Ackley:
The QBKG System: Generating Explanations From a Non-Discrete Knowledge Representation.
AAAI 1982: 213-216 |
11 | | Hans J. Berliner:
Multiprocessing and Duality in Intelligence.
ECAI 1982: 28-36 |
1981 |
10 | | Hans J. Berliner:
An Examination of Brute Force Intelligence.
IJCAI 1981: 581-587 |
1980 |
9 | | Hans J. Berliner:
Making Judgments.
AAAI 1980: 134-137 |
8 | | Hans J. Berliner:
The Fredkin Challenge Match.
AI Magazine 2(2): 30-33 (1980) |
7 | | Hans J. Berliner:
Backgammon Computer Program Beats World Champion.
Artif. Intell. 14(2): 205-220 (1980) |
1979 |
6 | | Hans J. Berliner:
The B* Tree Search Algorithm: A Best-First Proof Procedure.
Artif. Intell. 12(1): 23-40 (1979) |
1978 |
5 | | Hans J. Berliner:
A Chronology of Computer Chess and its Literature.
Artif. Intell. 10(2): 201-214 (1978) |
1977 |
4 | | C. Perdue,
Hans J. Berliner:
EG - A Case Study in Problem Solving with King and Pawn Endings.
IJCAI 1977: 421-427 |
3 | | Hans J. Berliner:
Experiences in Evaluation with BKG - A Program that Plays Backgammon.
IJCAI 1977: 428-433 |
2 | | Hans J. Berliner,
R. Greenblatt,
Jacques Pitrat,
A. Samuel,
David Slate:
Computer Game Playing.
IJCAI 1977: 975-982 |
1973 |
1 | | Hans J. Berliner:
Some Necessary Conditions for a Master Chess Program.
IJCAI 1973: 77-85 |