Computer games, Volume 1
"Computer Games I" is the first volume in a two part compendium of papers covering the most important material available on the development of computer strategy games. These selections range from discussions of mathematical analyses of games, to more qualitative concerns of whether a computer game should follow human thought processes rather than a "brute force" approach, to papers which will benefit readers trying to program their own games. Contributions include selections from the major players in the development of computer games: Claude Shannon whose work still forms the foundation of most contemporary chess programs, Edward O. Thorpe whose invention of the card counting method caused Las Vegas casinos to change their blackjack rules, and Hans Berliner whose work has been fundamental to the development of backgammon and chess games.
What people are saying - Write a review
We haven't found any reviews in the usual places.
L2 Backgammon Computer Program Beats World Champion
10 other sections not shown
ACM Tournament AIIAY alpha analysis attack backgammon best move better Black King blot board position capture CASTLE CDC CYBER checkers chess players chess program CLEAI coefﬁcients computer chess considered continuations coordinate squares cube deﬁned deﬁnitely depth difﬁcult double efﬁcient EIOI endgame endgame play evaluation function example expectation ﬁeld Figure ﬁnal ﬁnd ﬁrst ﬁve ﬁxed goal half-moves heuristics home board human players IEGII IEGIN IIOEI INTI IOAIO IOVE KAISSA killer heuristic learning Levy look-ahead MAC HACK machine middle game minimax node NOVE OEGIN OOAIO opponent opponent’s passed pawn pawn structure piece PIOCEOUIE pips plausibility play polynomial possible problem procedure pruning roll Rook routine SCIATCN scoring polynomial selection side signiﬁcant SIOE situation speciﬁc speed chess SQUAIE state-class static evaluation strategy sufﬁcient terminal positions TNEI TNEN transposition table tree tree-search USCF White King winning words