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

Página 79

On

Originally published in : Doklady Akad . ... The proposed

for substituting machine play for one or all four participants . Each such

substitution is ...

On

**Algorithms**and Programming for Playing at Dominoes YURI A . PERVINOriginally published in : Doklady Akad . ... The proposed

**algorithm**may be usedfor substituting machine play for one or all four participants . Each such

substitution is ...

Página 212

An Unconditional Life

section finds the support of Y , as will be proved . We envision the

being used on a single block , Y = { b } , or on a set of blocks in some “ area ” of

the ...

An Unconditional Life

**Algorithm**For any Y = B ( x ) the**algorithm**implicit in thissection finds the support of Y , as will be proved . We envision the

**algorithm**being used on a single block , Y = { b } , or on a set of blocks in some “ area ” of

the ...

Página 392

David N.L. Levy. unprocessed stable squares , and a boolean vector which tells

for each square whether there is a stable disc on it . The

Step 1 . Initialize the set to be empty and all elements of the vector to be false ( all

...

David N.L. Levy. unprocessed stable squares , and a boolean vector which tells

for each square whether there is a stable disc on it . The

**algorithm**is as follows :Step 1 . Initialize the set to be empty and all elements of the vector to be false ( all

...

### Comentarios de la gente - Escribir un comentario

No encontramos ningún comentario en los lugares habituales.

### Otras ediciones - Ver todas

### Términos y frases comunes

added analysis arrangement attack basic Black block branch called chess complete components configuration connected considered created data structure decision defined described determined developed discs discussed draw edge effect element evaluation example expert fact factors Figure final forcing four function further given gives goal Hand heuristic holds human important initial interesting knowledge lead learning linkage look look-ahead machine means method move node Note object opening opponent particular pass pattern pieces planning play player points position possible present probability problem reasonable recognize represent routine rules score selection sequence shows side simple situation specific square stones strategy string structure subgoals success suit tactical territory tree Trick turn weighting White winning