Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 61
Página 164
A natural way to end a play of the game tree is by two consecutive passes: Rule 6
(a) (End). The game ends if there ... On a 1 x 1 board, for instance, Black and
White are forced to pass in turn because suicide is illegal. Rule 6 ends the game
...
A natural way to end a play of the game tree is by two consecutive passes: Rule 6
(a) (End). The game ends if there ... On a 1 x 1 board, for instance, Black and
White are forced to pass in turn because suicide is illegal. Rule 6 ends the game
...
Página 165
(b) After the moves b2; a2, Pass; c2, Pass; b3, Black controls 9 units of territory,
White controls 7, and C = -4. White wins by 2 points. the game. Thus, this
voluntary pass rule would seem not to be in conflict with practice. However, in
conjunction ...
(b) After the moves b2; a2, Pass; c2, Pass; b3, Black controls 9 units of territory,
White controls 7, and C = -4. White wins by 2 points. the game. Thus, this
voluntary pass rule would seem not to be in conflict with practice. However, in
conjunction ...
Página 170
V(W) = 1 x V(B) — 1 = V(B) < 0, where the first 1 is from the initial Black pass, V(B)
is the value of a Black active first move to the same vertex, and the -1 arises as
follows: The subtree Sw of the game tree arising from the active White first move ...
V(W) = 1 x V(B) — 1 = V(B) < 0, where the first 1 is from the initial Black pass, V(B)
is the value of a Black active first move to the same vertex, and the -1 arises as
follows: The subtree Sw of the game tree arising from the active White first move ...
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Contenido
CHAPTER | 8 |
by ALAN M STANIER | 12 |
by ALAN M STANIER | 21 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
adjacent algorithm analysis basic Black stone block board position board situation branch called capture chess complete components Computer Go configuration considered data structure defined definition described DEVELOP-GOALS difficult discs dominoes edge evaluation function example field Figure final find first move five fixed game tree games played given Go game Go player Go program Go-Moku goal half-moves Hand heuristic high-card points human players IAGO IIII IIIII IIIIIIII influence joseki learning legal moves lens linkage list of subgoals look-ahead machine matrix game minimax modified NEMESIS node opponent opponent’s Othello parameters pass patterns perception pieces points poker possible moves problem pure strategies reflect routine rules schema score selection sequence signature table significant specific square string sufficient suit tactical tactician techniques territory tournament tricks tsumego update vacant weighting factors White winning
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 | 2 Sep. 2011 |
| ISBN | 0387966099, 9780387966090 |
| Largo | 546 páginas |
| Exportar cita | BiBTeX EndNote RefMan |