Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 60
Página 81
The notation for the arrows: (1) the player J, has skipped his turn; (2) the player J,
has skipped his turn; the player J3 has skipped his turn; (4) the selection of the
pretactical checks is unique; (5) the selection of the pretactical checks is not ...
The notation for the arrows: (1) the player J, has skipped his turn; (2) the player J,
has skipped his turn; the player J3 has skipped his turn; (4) the selection of the
pretactical checks is unique; (5) the selection of the pretactical checks is not ...
Página 190
First outlined by Shannon (1950a), this paradigm focuses on the move selection
problem, conducting a forward search through a subtree of legal moves rooted at
the current position. Terminal positions of the subtree are given static ...
First outlined by Shannon (1950a), this paradigm focuses on the move selection
problem, conducting a forward search through a subtree of legal moves rooted at
the current position. Terminal positions of the subtree are given static ...
Página 381
Five factors make this simple approach inadequate: (1) Time that is left unused
by one move selection can be fruitfully added to later moves. (2) There is
overhead time for disc flipping (on the physical board), typing in moves, and
hitting the ...
Five factors make this simple approach inadequate: (1) Time that is left unused
by one move selection can be fruitfully added to later moves. (2) There is
overhead time for disc flipping (on the physical board), typing in moves, and
hitting the ...
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 |