Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 54
Página 431
In poker the relevant variables are relatively easy to identify and small in number;
so their individual and combined effects can be investigated and incorporated
into a theory of fairly wide applicability. The information processing models aimed
...
In poker the relevant variables are relatively easy to identify and small in number;
so their individual and combined effects can be investigated and incorporated
into a theory of fairly wide applicability. The information processing models aimed
...
Página 434
(1972a) a number of abstract mathematical models of poker and their
shortcomings and usefulness. We also refer to Findler et al. (1972a); and Findler
et al. (1973) concerning the characterization of the interesting work by Waterman
(1970).
(1972a) a number of abstract mathematical models of poker and their
shortcomings and usefulness. We also refer to Findler et al. (1972a); and Findler
et al. (1973) concerning the characterization of the interesting work by Waterman
(1970).
Página 454
in. Poker. It is now in order to collect some ideas about the information structures
and processes that play a part in poker. As will be seen, the fact that poker is
used as the general framework of the discussion is, to a large degree, irrelevant.
in. Poker. It is now in order to collect some ideas about the information structures
and processes that play a part in poker. As will be seen, the fact that poker is
used as the general framework of the discussion is, to a large degree, irrelevant.
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Contenido
Chess | 3 |
by Alan M Stanier | 12 |
by Alan M Stanier | 21 |
Derechos de autor | |
Otras 6 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
5-pattern adjacent algorithm analysis artificial intelligence Bayesean block board position board situation branch branching factor called capture chess color complete components Computer Go configuration considered corner data structure decision described determined developed 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 heuristic high-card points human players IAGO IAGO's initial interactions intersection Jonathan Cerf joseki learning legal moves lens linkage list of subgoals look-ahead minimax msec node opponent opponent's optimal Othello pair pass perception pieces points poker possible moves potential problem qubic REVERSI routine rules Santa Cruz Open schema score selection sequence square stable strand strategy string tactical techniques territory Theorem tic-tac-toe token tournament Trick tsumego turn update vacant weighting factors winning
Referencias a este libro
Información bibliográfica
| Título | Computer games, Volumen2 Computer Games, David N. L. Levy |
| Autor | David N. L. Levy |
| Editor | David N. L. Levy |
| Edición | ilustrada |
| Editor | Springer-Verlag, 1988 |
| Procedencia del original | Universidad de California |
| Digitalizado | 28 Jul. 2008 |
| ISBN | 0387966099, 9780387966090 |
| Largo | 546 páginas |
| Exportar cita | BiBTeX EndNote RefMan |