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 20
Página 480
... forcing moves exist ( Shannon , 1950a ) . The best technique seems to be a dynamic decision in which another type of evaluation is made to determine if the direction of play is not promising and should be discontinued , or if the ...
... forcing moves exist ( Shannon , 1950a ) . The best technique seems to be a dynamic decision in which another type of evaluation is made to determine if the direction of play is not promising and should be discontinued , or if the ...
Página 482
... forcing situations , especially in a particular plane . ( Although these principles were not used directly , they are discussed in Appendix 4. ) For this reason , it was decided to employ a forcing look - ahead routine which would run ...
... forcing situations , especially in a particular plane . ( Although these principles were not used directly , they are discussed in Appendix 4. ) For this reason , it was decided to employ a forcing look - ahead routine which would run ...
Página 499
... forcing . All sets of this set are not necessarily forcing , for some do not even contain a two in a row . Of the 15 possible configurations that can come from this set , 11 are forcing . A more general rule can be stated for the entire ...
... forcing . All sets of this set are not necessarily forcing , for some do not even contain a two in a row . Of the 15 possible configurations that can come from this set , 11 are forcing . A more general rule can be stated for the entire ...
Contenido
by ALAN M STANIER | 12 |
by ALAN M STANIER | 21 |
CHAPTER 3 | 32 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
5-pattern abcdefgh adjacent algorithm analysis artificial intelligence basic block board position board situation branch branching factor called capture chess color complete components computer chess Computer Go configuration considered corner data structure decision described 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 2 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 points poker possible moves problem REVERSI routine rules Santa Cruz Open schema score selection sequence square stable strand strategy string tactical techniques territory Theorem tournament Trick tsumego update vacant weighting factors winning