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 75
Página 77
Move 16 ( Right - hand opponent ) – score 5 Move 14 ( Left - hand opponent )
Move 10 ( Left - hand opponent ) Move 9 ( Machine ) – score 2 Move 4 ( Right -
hand opponent ) — score 2 Move 2 ( Left - hand opponent ) – drew 2 Move 1 ...
Move 16 ( Right - hand opponent ) – score 5 Move 14 ( Left - hand opponent )
Move 10 ( Left - hand opponent ) Move 9 ( Machine ) – score 2 Move 4 ( Right -
hand opponent ) — score 2 Move 2 ( Left - hand opponent ) – drew 2 Move 1 ...
Página 307
The question arises as to how flexible the above logical structures are . Can the
machine modify and improve them on the basis of further experience ? What is
involved in the optimization of a decision system ? What are the limits , if any , of ...
The question arises as to how flexible the above logical structures are . Can the
machine modify and improve them on the basis of further experience ? What is
involved in the optimization of a decision system ? What are the limits , if any , of ...
Página 504
since the machine is surrendering the offensive for a not too important block The
player again takes 32 to form the diagonal two in a rows. The machine blocks
one of them by taking 13 and also develops a winning situation in the bottom
plane.
since the machine is surrendering the offensive for a not too important block The
player again takes 32 to form the diagonal two in a rows. The machine blocks
one of them by taking 13 and also develops a winning situation in the bottom
plane.
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