Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 90
Página 107
A point was “connected” to Black if it was occupied by a nondead Black stone or
was empty and adjacent to at least one Black stone and not adjacent to any
White stones. ... Half-connected points loosely reflected threatened connections.
A point was “connected” to Black if it was occupied by a nondead Black stone or
was empty and adjacent to at least one Black stone and not adjacent to any
White stones. ... Half-connected points loosely reflected threatened connections.
Página 199
Note that the new stone must always be played at a point corresponding to a
node in the level I strand of the old web. ... in effect, merged in order to come up
with a new web structure whose scope includes all those board points in direct
line of ...
Note that the new stone must always be played at a point corresponding to a
node in the level I strand of the old web. ... in effect, merged in order to come up
with a new web structure whose scope includes all those board points in direct
line of ...
Página 259
In Figure 2, for example, a built-in function PNT(x, y) returns a Point type value
with the given coordinates; a Boolean function EmplArea(P, dx, dy, Q) returns
true if there are no points with stones except the point Q in the rectangle defined
by ...
In Figure 2, for example, a built-in function PNT(x, y) returns a Point type value
with the given coordinates; a Boolean function EmplArea(P, dx, dy, Q) returns
true if there are no points with stones except the point Q in the rectangle defined
by ...
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 |