All the Right Moves: A Vlsi Architecture for Chess
Computer chess programs traditionally have been subject to a tradeoff between search speed and chess knowledge. All the Right Moves presents a parallel architecture that makes this tradeoff irrelevant: using the VLSI architecture described in this book, the Hitech chess program is able to search both quickly and knowledgeably. Hitech recently won the ACM computer chess championship, and now owns a USCF rating of 2532, placing it in the top one percent of all rated U.S. chess players.The book describes a VLSI implementation for both move generation and position evaluation. The VLSI move generator searches about 200,000 moves per second and includes all the ancillary circuitry required for it to interface cleanly with the rest of the system. The speed of the move generator is independent of the number of legal moves in a position, and the speed of the evaluation depends only logarithmically on the amount of knowledge encoded in the evaluation. In practice, this means that the amount of analysis performed by the evaluation does not slow the speed of the search.Beyond the VLSI architecture, Ebeling also describes the other Hitech hardware and software, and presents a performance analysis of Hitech as a whole.Hitech already has had a revolutionary effect on computer chess, the impact of which is discussed in the book's final chapter.Contents: Introduction. Background and Related Work. The Move Generator Architecture. Position Evaluation. The Hitech System. Performance Results. Conclusion.Carl Ebeling is an Assistant Professor in the Department of Computer Science at the University of Washington, Seattle. All the Right Moves is a 1986 ACM Distinguished Dissertation.
13 pages matching halfmove in this book
Results 1-3 of 13
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
a-B search allows architecture backward pawn Belle’s best move board control chess knowledge chess machine chess program circuit computer chess context stack Cray Blitz deep search described destination condition destination square detect determine doubled pawns effect evaluation chip evaluation components evaluation function ever-possible moves example factor ﬁrst move ﬁrst-order evaluation halfmove hash table Hitech identiﬁed illegal moves implementation incremental evaluation inputs isolated pawns iterative deepening king safety knight legal moves microinstruction microprogram minterms move computation move generator ordering move ordering nodes open ﬁles operation opponent’s optimal oracle output parallel passed pawn pawn guard pawn shelter pawn structure performance piece guard player ply search position evaluation priority encoder problem produce queen reduced refutation rook search algorithm Search Depth search efficiency search speed search tree second-order evaluation sliding moves speciﬁed status signals subtree transposition table VLSI vote bus vote cycle wires