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 48
Página 57
Although from this description it appears that the game is not complicated ,
nevertheless the number of possible ways in which a player ' s pieces can reach
their final positions with single steps , i . e . , when only the different routes are ...
Although from this description it appears that the game is not complicated ,
nevertheless the number of possible ways in which a player ' s pieces can reach
their final positions with single steps , i . e . , when only the different routes are ...
Página 60
( e ) Moves into the final two lines might be of somewhat less value ( there being
no need to worry about them any more ) . Clearly , ( d ) partly involves this aspect
; however , we can introduce another FOM as follows : Qs = nu where nm ) = 0 or
...
( e ) Moves into the final two lines might be of somewhat less value ( there being
no need to worry about them any more ) . Clearly , ( d ) partly involves this aspect
; however , we can introduce another FOM as follows : Qs = nu where nm ) = 0 or
...
Página 374
The concern must be with maximizing the final disc differential . 3 . 2 . 1 . 1 .
Solving Endgame Positions . One way to maximize the final disc differential is by
solving the position ; that is , to completely search the game tree to the end of the
...
The concern must be with maximizing the final disc differential . 3 . 2 . 1 . 1 .
Solving Endgame Positions . One way to maximize the final disc differential is by
solving the position ; that is , to completely search the game tree to the end of the
...
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 23 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
addition analysis arrangement begin Black block branch called changes chess complete components configuration considered consists 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