Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 50
Página 71
P4 is index of the player on fourth set. if number of pieces held by the machine
exceeds, by two or Dl =•{ more, number of pieces held by the player on set;
otherwise. D2=^ 1 if number of pieces held by the machine's partner exceeds, by
two or ...
P4 is index of the player on fourth set. if number of pieces held by the machine
exceeds, by two or Dl =•{ more, number of pieces held by the player on set;
otherwise. D2=^ 1 if number of pieces held by the machine's partner exceeds, by
two or ...
Página 136
Horizontal and vertical rows of pieces of the same color form chains (Figure 1). A
vacant point contiguous to a chain in the horizontal or vertical direction is a
degree of freedom, A chain (or a single piece) without any degrees of freedom is
a ...
Horizontal and vertical rows of pieces of the same color form chains (Figure 1). A
vacant point contiguous to a chain in the horizontal or vertical direction is a
degree of freedom, A chain (or a single piece) without any degrees of freedom is
a ...
Página 137
Chain of white pieces (0=4 pieces) - no degrees of freedom Chain of black
pieces (•= 16 pieces) - 15 degrees of freedom KO-Rule 1 . Black - (a) (takes W(b))
2. White - (b) forbidden Figure 1. Definitions of Go. have been removed). Areas in
...
Chain of white pieces (0=4 pieces) - no degrees of freedom Chain of black
pieces (•= 16 pieces) - 15 degrees of freedom KO-Rule 1 . Black - (a) (takes W(b))
2. White - (b) forbidden Figure 1. Definitions of Go. have been removed). Areas in
...
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 |