Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 51
Página 111
A position was considered "terminal" when the target was captured, the target or
complex became stable (too many dame or two eyes), the problem became too
complex (more than 1 2 relevant strings or 1 5 move choices), or the problem ...
A position was considered "terminal" when the target was captured, the target or
complex became stable (too many dame or two eyes), the problem became too
complex (more than 1 2 relevant strings or 1 5 move choices), or the problem ...
Página 139
All moves for which the success curve increases are considered good, all moves
of the loser for which the success curve decreases more rapidly than in the
preceding move are considered bad, and the corresponding moves of the winner
as ...
All moves for which the success curve increases are considered good, all moves
of the loser for which the success curve decreases more rapidly than in the
preceding move are considered bad, and the corresponding moves of the winner
as ...
Página 216
... in close proximity, with no intervening enemy stones, are considered by the
program to be linked together to form a chain. In Figure 2, for example, the white
stones at j5 and m4 are considered to be joined by a "large knight's move"
linkage.
... in close proximity, with no intervening enemy stones, are considered by the
program to be linked together to form a chain. In Figure 2, for example, the white
stones at j5 and m4 are considered to be joined by a "large knight's move"
linkage.
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 |