Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 85
Página 265
Analysis. Techniques. in. Tsumego. David B. Benson, Bruce R. Hilditch, and J.
Denbigh Starkey Originally published in: Proceedings of the International Joint
Conference on Artificial Intelligence, 1979, pp. 50-52. Reprinted by permission of
...
Analysis. Techniques. in. Tsumego. David B. Benson, Bruce R. Hilditch, and J.
Denbigh Starkey Originally published in: Proceedings of the International Joint
Conference on Artificial Intelligence, 1979, pp. 50-52. Reprinted by permission of
...
Página 277
An immediately attractive way of doing this is to get the program to analyze its
played games and obtain the required ordering as a result of its accumulated
experience of the analyses. There are various ways in which the descriptive and
...
An immediately attractive way of doing this is to get the program to analyze its
played games and obtain the required ordering as a result of its accumulated
experience of the analyses. There are various ways in which the descriptive and
...
Página 537
programs for goal- and plan-implementing, see Goal- and plan-implementing Go
program Japanese, see Japanese Go-playing program NEMESIS 132-134
partial analysis 145-151 pattern recognition, see INTERIM.] Go program;
INTERIM.
programs for goal- and plan-implementing, see Goal- and plan-implementing Go
program Japanese, see Japanese Go-playing program NEMESIS 132-134
partial analysis 145-151 pattern recognition, see INTERIM.] Go program;
INTERIM.
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 |