Computer Games ISpringer New York, 1988 M03 28 - 456 páginas 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. |
Dentro del libro
Resultados 1-3 de 48
Página 97
... increase in problem size of the 8 × 8 board over the 6 × 6 board ( about 5 to 1 ) is approximately canceled by the increase in speed of the IBM 704 over the MANIAC ( also about 5 to 1 , counting the increased power of the 704 order code ) ...
... increase in problem size of the 8 × 8 board over the 6 × 6 board ( about 5 to 1 ) is approximately canceled by the increase in speed of the IBM 704 over the MANIAC ( also about 5 to 1 , counting the increased power of the 704 order code ) ...
Página 190
... increases as search depth increases and also as fewer and fewer pieces remain on the board . DUCHESS is programmed to try to make moves that lead to positions that are in the transposition table and thus increase its benefits ...
... increases as search depth increases and also as fewer and fewer pieces remain on the board . DUCHESS is programmed to try to make moves that lead to positions that are in the transposition table and thus increase its benefits ...
Página 374
... increasing the amount of alpha - beta pruning , it suffers from two defects . In the first place , the actual amount ... increase in data storage requirements and with a relatively small amount of reprogramming of the tree - search . The ...
... increasing the amount of alpha - beta pruning , it suffers from two defects . In the first place , the actual amount ... increase in data storage requirements and with a relatively small amount of reprogramming of the tree - search . The ...
Contenido
Dama CHAPTER | 10 |
by EDWARD O THORP | 44 |
by EMMETT B KEELER and JOEL SPENCER | 71 |
Derechos de autor | |
Otras 7 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
00 BEGIN alpha alpha-beta pruning analysis ANORS ARRAY Artificial Intelligence assigned ATTACKS backgammon best move BIT BOARD Black King board position CAPTURE MOVE CASTLE checkers chess players chess program coefficients computer chess considered continuations coordinate squares cube depth DESTINATION SQUARES double endgame endgame play ENPASSANT evaluation function example EXIT Figure FILE frontier squares goal GOTO heuristics home board human players INDEX INITIALIZE INRS INTJ INTR INTS INTT INTV INTY JNTJ JNTK JNTM KAISSA killer heuristic learning legal moves letters Levy MAC HACK machine mate middle game minimax MOVESI opponent opponent's PANN parameters passed pawn piece pips plausibility play polynomial possible PRIONE problem procedure pruning roll ROOK routine SCRATCH selection side situation state-class static evaluation strategy Table technique terminal positions transposition table tree-search variations White King winning words