Computer Games IISpringer New York, 1988 M06 24 - 546 páginas Long 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 84
Página 46
... i = 0 , 1 , ... , 4 , Now denote by Pil - hb , + ( 1 − h ) d , for i = 5 , & - for i = 6 , 7 , 8 , 9 . the probability that B's further point is m when his initial point is j , when he observes A's further point of I and when he uses a ...
... i = 0 , 1 , ... , 4 , Now denote by Pil - hb , + ( 1 − h ) d , for i = 5 , & - for i = 6 , 7 , 8 , 9 . the probability that B's further point is m when his initial point is j , when he observes A's further point of I and when he uses a ...
Página 47
... i = 0 j = 0 l = 0 m = 0 Σ , 10 Define djim = πjlm — Pim , noting that odjim = 0 , since we are summing over two ... ( i , j , l , m ) = i = 0 j = 3 l = 0 m = 0 6 10 9 10 Σα , Σ Σaipa Σ dim f ( i , j , l , m ) . 1 = 0 i = 0 m = 0 But for j ...
... i = 0 j = 0 l = 0 m = 0 Σ , 10 Define djim = πjlm — Pim , noting that odjim = 0 , since we are summing over two ... ( i , j , l , m ) = i = 0 j = 3 l = 0 m = 0 6 10 9 10 Σα , Σ Σaipa Σ dim f ( i , j , l , m ) . 1 = 0 i = 0 m = 0 But for j ...
Página 209
... i ≤ k , and that b , is the first block neighboring R , to be captured , 0 < i < k . Consider b . Since by is not safe , by Lemma 2 and the fact that by is the first block neighboring R1 to be captured , b1 has no eyes . As by e X ...
... i ≤ k , and that b , is the first block neighboring R , to be captured , 0 < i < k . Consider b . Since by is not safe , by Lemma 2 and the fact that by is the first block neighboring R1 to be captured , b1 has no eyes . As by e X ...
Contenido
Chess | 3 |
by ALAN M STANIER 127 | 12 |
by ALAN M STANIER | 21 |
Derechos de autor | |
Otras 27 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
5-pattern adjacent algorithm analysis artificial intelligence block board position board situation branch branching factor called capture chess color complete components Computer Go configuration considered corner data structure decision described determined discs dominoes draw edge endgame evaluation function example expert Figure game tree games played given Go game Go player Go program Go-Moku goal Gopal half-moves Hand 3 Hand heuristic high-card points human players IAGO IAGO's initial Jonathan Cerf joseki learning legal moves lens linkage list of subgoals look-ahead machine minimax Move number msec node opponent opponent's optimal Othello pair pass perception pieces poker possible moves problem qubic REVERSI routine rules Santa Cruz Open schema score selection sequence square stable strand strategy string tactical techniques territory Theorem token tournament Trick tsumego update vacant weighting factors White winning