Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 30
Página 148
Then the value of each remaining branch and the game is either unaltered or
becomes a draw. Proof. Assign the values + 1, 0, and - 1 to wins, draws and
losses, respectively, for Black. To assign values to branches of the tree, we
maximize ...
Then the value of each remaining branch and the game is either unaltered or
becomes a draw. Proof. Assign the values + 1, 0, and - 1 to wins, draws and
losses, respectively, for Black. To assign values to branches of the tree, we
maximize ...
Página 168
In branch 2, a White move 2 to the other vertex is game-equivalent, by spatial
symmetry, so we may omit the branches corresponding to 2 and 3 which would
otherwise arise. At the end of branch 3. Black gains 1 point for territory and 1
point for ...
In branch 2, a White move 2 to the other vertex is game-equivalent, by spatial
symmetry, so we may omit the branches corresponding to 2 and 3 which would
otherwise arise. At the end of branch 3. Black gains 1 point for territory and 1
point for ...
Página 171
Since the value of each branch of the game tree (outcome of the game) is
bounded by MN, V(M, N) g MN. Note that the bound MN is best possible and is
attained by any legal final position in which nB > 0 and ns = 0. Corollary 3 (
Chinese ...
Since the value of each branch of the game tree (outcome of the game) is
bounded by MN, V(M, N) g MN. Note that the bound MN is best possible and is
attained by any legal final position in which nB > 0 and ns = 0. Corollary 3 (
Chinese ...
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 |