Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 83
Página 18
own, of course) are: North 5 3 + K 10 2 Having received its hand — in this case
from the teletype, but there is also the facility of computer-dealt hands — the
program analyzes its hand for various features. The features routine returns
seven ...
own, of course) are: North 5 3 + K 10 2 Having received its hand — in this case
from the teletype, but there is also the facility of computer-dealt hands — the
program analyzes its hand for various features. The features routine returns
seven ...
Página 359
Game Two: Hand 1 Played by a Human Player (Same hand distribution as of
Game One) Game Three: Hand 4 Played by a Human Player (Same hand
distribution as of Games One and Two) In a typical 10-game series, when the
scores of a ...
Game Two: Hand 1 Played by a Human Player (Same hand distribution as of
Game One) Game Three: Hand 4 Played by a Human Player (Same hand
distribution as of Games One and Two) In a typical 10-game series, when the
scores of a ...
Página 361
9 Hand 4 44 Hand 4 Hand 1 Hand 2 *9 45 Hand 1 Hand 2 Hand 3 ¥8 410 ♢ 10
Trick No. ... 13 Hand 4 48 Hand 1 49 Hand 2 44 Score Hand 1 0 Hand 2 2 Hand
3 2 Hand 3 *I0 Hand 3 *6 Hand 3 *5 Hand 4 9 Game Six: Hands 1, 2, and 4
Played ...
9 Hand 4 44 Hand 4 Hand 1 Hand 2 *9 45 Hand 1 Hand 2 Hand 3 ¥8 410 ♢ 10
Trick No. ... 13 Hand 4 48 Hand 1 49 Hand 2 44 Score Hand 1 0 Hand 2 2 Hand
3 2 Hand 3 *I0 Hand 3 *6 Hand 3 *5 Hand 4 9 Game Six: Hands 1, 2, and 4
Played ...
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 |