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 51
Página 111
A position was considered “ terminal ” when the target was captured , the target
or complex became stable ( too many dame or two eyes ) , the problem became
too complex ( more than 12 relevant strings or 15 move choices ) , or the problem
...
A position was considered “ terminal ” when the target was captured , the target
or complex became stable ( too many dame or two eyes ) , the problem became
too complex ( more than 12 relevant strings or 15 move choices ) , or the problem
...
Página 139
All moves for which the success curve increases are considered good , all moves
of the loser for which the success curve decreases more rapidly than in the
preceding move are considered bad , and the corresponding moves of the
winner as ...
All moves for which the success curve increases are considered good , all moves
of the loser for which the success curve decreases more rapidly than in the
preceding move are considered bad , and the corresponding moves of the
winner as ...
Página 216
Linkages and Chains Two strings of the same color , in close proximity , with no
intervening enemy stones , are considered by the program to be linked together
to form a chain . In Figure 2 , for example , the white stones at j5 and m4 are ...
Linkages and Chains Two strings of the same color , in close proximity , with no
intervening enemy stones , are considered by the program to be linked together
to form a chain . In Figure 2 , for example , the white stones at j5 and m4 are ...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
jlnknkn jytkjty jytrjytrj jt yjtrj
Contenido
Chess | 3 |
by ALAN M STANIER | 12 |
by ALAN M STANIER | 21 |
Derechos de autor | |
Otras 22 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
analysis arrangement begin Black block branch called changes chess complete components configuration considered consists contains corner data structure decision defined described determined developed discs discussed draw edge effect element evaluation example expert fact factor Figure final forcing four function given gives goal Hand heuristic human IAGO important initial interesting knowledge lead learning limited linkage machine means method move node Note object opening opponent pair particular pass pattern pieces planning play player poker position possible present probability problem reason region relations represent routine rules score selection sequence shows side simple situation square stones strategy string structure subgoals success suit tactical territory tournament tree Trick turn weighting White winning
Referencias a este libro
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 | 28 Jul. 2008 |
| ISBN | 0387966099, 9780387966090 |
| Largo | 546 páginas |
| Exportar cita | BiBTeX EndNote RefMan |