Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 26
Página 198
the center node. Whatever the specific pattern of the three corresponding board
points, NEXT uses the X, Y displacement from the first point to the second, and
from the second to the third, to generate by table lookup 0, 1 , or 2 nodes on the (
n ...
the center node. Whatever the specific pattern of the three corresponding board
points, NEXT uses the X, Y displacement from the first point to the second, and
from the second to the third, to generate by table lookup 0, 1 , or 2 nodes on the (
n ...
Página 294
Figure 3 Figure 4 a is the explicit node . . . ). With Black to play he can destroy
both realizations by playing at a common node. Example 3. Figure 3 shows a
board position in which, after play at node 1, there are again two realizations of
the ...
Figure 3 Figure 4 a is the explicit node . . . ). With Black to play he can destroy
both realizations by playing at a common node. Example 3. Figure 3 shows a
board position in which, after play at node 1, there are again two realizations of
the ...
Página 298
A Formal Notation for Descriptions As we have seen, a description specifies a
number of explicit nodes and certain linear 5-pattern relationships between them.
The nodes are labled 1, 2, 3 ... A description consists of a "node list" followed by a
...
A Formal Notation for Descriptions As we have seen, a description specifies a
number of explicit nodes and certain linear 5-pattern relationships between them.
The nodes are labled 1, 2, 3 ... A description consists of a "node list" followed by a
...
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 |