## 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 87

Página 148

Suppose a branch is

reassigned the value 0 . Assume the

minimize the values of the subbranches . If the original value of the branch is + 1 ,

then the ...

Suppose a branch is

**given**, and some of the subbranches of this branch arereassigned the value 0 . Assume the

**given**branch is Black , so we want tominimize the values of the subbranches . If the original value of the branch is + 1 ,

then the ...

Página 180

With

these areas ? It is probably within the range of our computer program and

associated techniques to solve such problems .

one can ...

With

**given**tempo and best play , what is the value of the subgame played out inthese areas ? It is probably within the range of our computer program and

associated techniques to solve such problems .

**Given**such an isolated area ,one can ...

Página 356

Find the lowest card in a

highest card in a

hand containing the fewest cards ( short - suit routine ) . Four different strategies ...

Find the lowest card in a

**given**suit above x ( low - winner routine ) . 4 . Find thehighest card in a

**given**suit below x ( high - order routine ) . 5 . Find the suit in ahand containing the fewest cards ( short - suit routine ) . Four different strategies ...

### 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