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

David N.L. Levy. The lead - understanding module in fact

components ; a supplementary unordered set of productions , a procedural

section to classify suits ( e . g . , as unbid ) , and 12 of these unorthodox ifthen —

else rules .

David N.L. Levy. The lead - understanding module in fact

**contains**threecomponents ; a supplementary unordered set of productions , a procedural

section to classify suits ( e . g . , as unbid ) , and 12 of these unorthodox ifthen —

else rules .

Página 494

An upper bound on the total number of positions which

be calculated in the same manner . Four of the squares of one player are

constricted to lie on a line , and the number of ways the remainder of the pieces

can be ...

An upper bound on the total number of positions which

**contain**four in a row canbe calculated in the same manner . Four of the squares of one player are

constricted to lie on a line , and the number of ways the remainder of the pieces

can be ...

Página 500

Given any two lines which

which

of these lines intersect the two lines with two in a row on empty squares , then a ...

Given any two lines which

**contain**two in a row , if a sequence of lines existswhich

**contain**one in a row and intersect each other on empty squares , and twoof these lines intersect the two lines with two in a row on empty squares , then a ...

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