WorldCat Identities

Berliner, Hans

Overview
Works: 23 works in 52 publications in 1 language and 133 library holdings
Genres: Programmed instructional materials 
Roles: Author
Classifications: GV1449.5, 510.7808
Publication Timeline
.
Most widely held works about Hans Berliner
 
Most widely held works by Hans Berliner
The system : a world champion's approach to chess by Hans Berliner( Book )

4 editions published between 1999 and 2003 in English and held by 29 WorldCat member libraries worldwide

The fifth correspondence chess world championship by Hans Berliner( Book )

6 editions published between 1971 and 1972 in English and held by 20 WorldCat member libraries worldwide

Chess as problem solving : the development of a tactics analyzer by Hans Berliner( Book )

13 editions published between 1974 and 1988 in English and Undetermined and held by 18 WorldCat member libraries worldwide

This thesis concerns itself with progress that has been made in the development of a better model of computer chess. The author considers the fact that chess programs have made almost no gain in strength, as measured on the human scale, in the period 1968 - 1973, as indicative that the popular model of computer chess is near the limits of its exploitability. Some indication of why this could be so is provided in a chapter which discusses some very basic flaws in the current popular model of computer chess. Most serious of these is the Horizon Effect which is shown to cause arbitrary errors in the performance of any program employing a maximum depth in conjunction with a quiescence procedure. (Modified author abstract)
B* probability based search by Hans Berliner( Book )

3 editions published in 1994 in English and held by 6 WorldCat member libraries worldwide

Termination is achieved when the established real value of the best move is so good that the likelihood of this being achieved by any other alternative is minimal. The B* probability based search algorithm has been implemented on the chess machine Hitech. En route we have developed effective techniques for: dealing with independence of alternative moves, producing viable optimistic estimates to guide the search and dealing with the Graph History Interaction problem. This report describes the implementation, and the results of tests including games played against brute-force programs. The data indicate that B* Hitech is a better pure selective searcher than anything previously reported
Search vs. knowledge : an analysis from the domain of games by Hans Berliner( Book )

2 editions published between 1981 and 1982 in Undetermined and English and held by 6 WorldCat member libraries worldwide

BKG -- a program that plays backgammon by Hans Berliner( Book )

3 editions published in 1977 in English and Undetermined and held by 6 WorldCat member libraries worldwide

This paper is both a description of an existing backgammon program and a theoretical discussion of some important issues in evaluation. The program plays a generally competent game at an intermediate level of skill. It correctly solves a high percentage of intermediate level problems in books. Although it only doubles and accepts doubles during the running game, it does several non-trivial things perfectly. In discussing the structure of evaluation, consider partitioning all game states into mutually exclusive state-classes. These state-classes are very useful in a knowledge-based system, as they allow relatively easy assimilation of new knowledge. They also permit the building of opponent models based upon what evidence shows the opponent knows in each state-class
A quantitative study of search methods and the effect of constraint satisfaction by Hans Berliner( Book )

1 edition published in 1984 in English and held by 6 WorldCat member libraries worldwide

Some observations on problem solving by Hans Berliner( Book )

1 edition published in 1980 in English and held by 5 WorldCat member libraries worldwide

Pattern recognition interacting with search by Hans Berliner( Book )

2 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide

Whenever such a pattern appears during the search its value will be part of the evaluation of the position in question. This paper explains how the hardware is constructed, how the whole system works, and the effects on the quality of the chess play as a result of having patterns being recognized."
The B* tree search algorithm : a best-first proof procedure by Hans Berliner( Book )

2 editions published in 1978 in English and held by 5 WorldCat member libraries worldwide

In this paper we present a new algorithm for searching trees. The algorithm, which we have named B*, finds a proof that an arc at the root of a search tree is better than any other. It does this by attempting to find both the best arc at the root and the simplest proof, in best-first fashion. This strategy determines the order of node expansion. Any node that is expanded is assigned two values: an upper (or optimistic) bound and a lower (or pessimistic) bound. During the course of a search, these bounds at a node tend to converge, producing natural termination of the search. As long as all nodal bounds in a sub-tree are valid, B* will select the best arc at the root of that sub-tree. The B* method assigns a greater responsibility for guiding the search to the evaluation functions that compute the bounds than has been done before. In this way knowledge, rather than a set of arbitrary predefined limits can be used to terminate the search itself. It is interesting to note that the evaluation functions may, measure any properties of the domain, thus resulting in selecting the arc that leads to the greatest quantity of whatever is being measured
Generating knight's tours without backtracking from errors by Jefferey Shufelt( Book )

2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide

Abstract: "We describe research on the problem of generating multiple closed tours of an mxn chessboard by a knight, subject to the constraint that the search scheme used to solve the problem is non- backtracking; i.e., that the search engine never visits a node in the search tree that will ultimately lead to a dead end. We describe our experiences and results in the context of KTC, a search program developed to undertake this task. We describe the implementation of KTC, the search constraints we discovered, and KTC's performance to date, illustrating that a limited amount of domain knowledge can lead to near-perfect search on this class of Hamiltonian circuit construction problems
Pattern knowledge and search : the SUPREM architecture by Hans Berliner( Book )

1 edition published in 1988 in English and held by 4 WorldCat member libraries worldwide

The QBKG system : knowledge representation for producing and explaining judgments by David H Ackley( Book )

1 edition published in 1983 in English and held by 4 WorldCat member libraries worldwide

Using chunking to solve chess pawn endgames by Hans Berliner( Book )

1 edition published in 1983 in English and held by 3 WorldCat member libraries worldwide

Hitech Becomes First Computer Senior Master by Hans Berliner( )

1 edition published in 1988 in English and held by 1 WorldCat member library worldwide

The Pennsylvania State Chess Championship was held in Pittsburgh, on July 23-24. In a field of 46 players, including 8 masters, Carnegie-Mellon University's Hitech won the title outright with a score of 4.5 - 0.5. The finale was very exciting as the number one seeded player, International Master Ed Formanek, had a perfect 4-0 going into the final round against the number two seed Hitech, which was the only competitor with 3.5 - 0.5. Hitech had to win to gain the title, whereas Formanek could become Champion by drawing this game. Hitech played beautifully, and the game culminated in a brilliant endgame that Hitech handled perfectly
Special issue on computer chess( Book )

1 edition published in 1990 in English and held by 1 WorldCat member library worldwide

New Hitech Computer Chess Success by Hans Berliner( )

1 edition published in 1988 in English and held by 1 WorldCat member library worldwide

Carnegie-Mellon University's Hitech chess computer scored 5-1 in the National Open Chess Championships held in Chicago March 18-20. The Championship Section in which Hitech competed, had 380 entries
Deep Thought Wins Fredkin Intermediate Prize by Hans Berliner( )

1 edition published in 1989 in English and held by 1 WorldCat member library worldwide

Since May 1988, Deep Thought (DT), the creation of a team of students at Carnegie Mellon University, has been attracting a lot of notice. In the Fredkin Masters Open, May 28-30, DT tied for second in a field of over 20 masters and ahead of three other computers, including Hitech and Chiptest (the winner of the 1987 North American Computer Championships). In August at the U.S. Open, DT scored 8.5, 3.5 to tie for eighteenth place with Arnold Denker among others. Its performance was marred by hardware and software bugs. However, DT astounded everyone by beating International Master (IM) Igor Ivanov, the perennial winner of the U.S. Grand Prix circuit prize, who is generally regarded to be as strong as the average Grandmaster
HITECH Wins Chess Tourney by Hans Berliner( )

1 edition published in 1987 in English and held by 1 WorldCat member library worldwide

In a tourney with 76 players including 15 masters, Hitech won the Pennsylvania State Chess Championship. It scored 4.5 points out of 5, and ended in a four-way tie for first place. However, the tie-breaking system was decisively in favor of Hitech, since it had played the strongest opponents. Hitech's performance rating for the event was 2559, which is a very high Senior Master rating
A Representation and Some Mechanisms for a Problem Solving Chess Program by H Berliner( Book )

2 editions published in 1975 in Undetermined and English and held by 1 WorldCat member library worldwide

This paper is a condensation of a recent PhD dissertation. It describes a program, CAPS-2, and presents both its form and some of the results obtained in testing it. The domain of the work is chess tactics, and the emphasis is on recognizing situations and dealing with them explicitly. Discussed are (1) Recognition predicates, (2) Methods of stating specific problems so that their solution is easier than the general problems that include them, and (3) Ways that results of dynamic analysis (tree search) can be made available throughout a search tree for various purposes
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.74 (from 0.60 for The system ... to 1.00 for HITECH Win ...)

The system : a world champion's approach to chess
Alternative Names
Berliner, Hans b. 1929

Berliner, Hans J. 1929-

Hans Berliner Amerikaans schaker

Hans Berliner scacchista statunitense

Hans Berliner US-amerikanischer Schachspieler

Hanss Berliners

Ханс Берлинер американский шахматист

Languages
English (46)

Covers