Computer Games IILong before the advent of the electronic computer, man was fascinated by the idea of automating the thought processes employed in playing games of skill. The very first chess "Automaton" captured the imagination oflate eighteenth century Vienna, and by the early 1900s there was a genuine machine that could play the chess endgame of king and rook against a lone king. Soon after the invention of the computer, scientists began to make a serious study of the problems involved in programming a machine to play chess. Within a decade this interest started to spread, first to draughts (checkers) and later to many other strategy games. By the time the home computer was born, there had already been three decades of research into computer games. Many of the results of this research were published, though usually in publications that are extremely difficult (or even impossible for most people) to find. Hence the present volumes. Interest in computers and programming has now reached into almost every home in the civilized world. Millions of people have regular access to computers, and most of them enjoy playing games. In fact, approximately 80 percent of all software sold for use on personal computers is games software. |
Dentro del libro
Resultados 1-3 de 62
Página 164
A natural way to end a play of the game tree is by two consecutive passes : Rule
6 ( a ) ( End ) . The game ends if there are ... On a 1 x 1 board , for instance ,
Black and White are forced to pass in turn because suicide is illegal . Rule 6 ends
the ...
A natural way to end a play of the game tree is by two consecutive passes : Rule
6 ( a ) ( End ) . The game ends if there are ... On a 1 x 1 board , for instance ,
Black and White are forced to pass in turn because suicide is illegal . Rule 6 ends
the ...
Página 165
( b ) After the moves b2 ; a2 , Pass ; c2 , Pass ; b3 , Black controls 9 units of
territory , White controls 7 , and C = - 4 . White wins by 2 points . the game . Thus ,
this voluntary pass rule would seem not to be in conflict with practice . However ,
in ...
( b ) After the moves b2 ; a2 , Pass ; c2 , Pass ; b3 , Black controls 9 units of
territory , White controls 7 , and C = - 4 . White wins by 2 points . the game . Thus ,
this voluntary pass rule would seem not to be in conflict with practice . However ,
in ...
Página 170
V ( W ) = 1 × V ( B ) – 1 = V ( B ) < 0 , where the first 1 is from the initial Black pass
, V ( B ) is the value of a Black active first move to the same vertex , and the – 1
arises as follows : The subtree Sw of the game tree arising from the active White ...
V ( W ) = 1 × V ( B ) – 1 = V ( B ) < 0 , where the first 1 is from the initial Black pass
, V ( B ) is the value of a Black active first move to the same vertex , and the – 1
arises as follows : The subtree Sw of the game tree arising from the active White ...
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Otras ediciones - Ver todas
Términos y frases comunes
added analysis arrangement attack basic Black block branch called chess complete components configuration connected considered created data structure decision defined described determined developed discs discussed draw edge effect element evaluation example expert fact factors Figure final forcing four function further given gives goal Hand heuristic holds human important initial interesting knowledge lead learning linkage look look-ahead machine means method move node Note object opening opponent particular pass pattern pieces planning play player points position possible present probability problem reasonable recognize represent routine rules score selection sequence shows side simple situation specific square stones strategy string structure subgoals success suit tactical territory tree Trick turn weighting White winning
Información bibliográfica
| Título | Computer Games II |
| Editor | David N.L. Levy |
| Edición | ilustrada |
| Editor | Springer New York, 1988 |
| Procedencia del original | Universidad de California |
| Digitalizado | 2 Sep. 2011 |
| ISBN | 0387966099, 9780387966090 |
| Largo | 546 páginas |
| Exportar cita | BiBTeX EndNote RefMan |