Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 55
Página 213
S{Y) = Y n Z and Z = S[_Yl Three algorithms have been mentioned, pure game
tree look-ahead, look- ahead distinguishing between inside and outside liberties,
and computation of the support. In the order given, each algorithm requires more
...
S{Y) = Y n Z and Z = S[_Yl Three algorithms have been mentioned, pure game
tree look-ahead, look- ahead distinguishing between inside and outside liberties,
and computation of the support. In the order given, each algorithm requires more
...
Página 480
Although in a specific program the move generator routine may actually generate
moves from the present board position, it can be considered to be a simple look-
ahead of all possible moves and then the application of a rough evaluation ...
Although in a specific program the move generator routine may actually generate
moves from the present board position, it can be considered to be a simple look-
ahead of all possible moves and then the application of a rough evaluation ...
Página 489
modifying the "score" award for the line as a function of the state of the lines
which intersect it, the evaluation formula could be improved a great deal.
Extending the length of the general look-ahead would also help, and it could
probably be run ...
modifying the "score" award for the line as a function of the state of the lines
which intersect it, the evaluation formula could be improved a great deal.
Extending the length of the general look-ahead would also help, and it could
probably be run ...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
jlnknkn jytkjty jytrjytrj jt yjtrj
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 |