Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 83
Página 206
If block b remains on the board in all arrangements in s/, then b is safe. This
definition is intended to capture the intuitive notion of unconditional life, x does
not play at all, so cannot hinder attempts by x to capture b. By this definition we
have no ...
If block b remains on the board in all arrangements in s/, then b is safe. This
definition is intended to capture the intuitive notion of unconditional life, x does
not play at all, so cannot hinder attempts by x to capture b. By this definition we
have no ...
Página 216
(a) Placement of a single stone on a portion of the board, (b) The four liberties for
the stone are also indicated, (c) The results of capturing the single black stone in
Figure 1(a) by playing on all of its liberties. From Iwamoto (1972). when the ...
(a) Placement of a single stone on a portion of the board, (b) The four liberties for
the stone are also indicated, (c) The results of capturing the single black stone in
Figure 1(a) by playing on all of its liberties. From Iwamoto (1972). when the ...
Página 266
Tsumego The main threat used in deterring intrusions into one's rightful territory
is the threat to capture the invading stones. It is thus frequently necessary to
evaluate small sections of the board to determine whether a group of stones will
be ...
Tsumego The main threat used in deterring intrusions into one's rightful territory
is the threat to capture the invading stones. It is thus frequently necessary to
evaluate small sections of the board to determine whether a group of stones will
be ...
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 |