Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 31
Página 25
Need the number of tricks required to make the contract Tpointer counter of tricks
planned Cowner the holder of the card being considered Discard the card to be
discarded on a top trick Order a list of contradictions in top trick list Index array of
...
Need the number of tricks required to make the contract Tpointer counter of tricks
planned Cowner the holder of the card being considered Discard the card to be
discarded on a top trick Order a list of contradictions in top trick list Index array of
...
Página 359
As used in this program, learning amounts to the examining of play after every
trick to see 8.1. A Digital Computer Card-Playing Program 359. Trick No. 1 Trick
No. 2 Trick No. 3 Trick No. 4 Trick No. 5 Hand 2 42 Hand 3 #4 Hand 1 45 Hand 2
...
As used in this program, learning amounts to the examining of play after every
trick to see 8.1. A Digital Computer Card-Playing Program 359. Trick No. 1 Trick
No. 2 Trick No. 3 Trick No. 4 Trick No. 5 Hand 2 42 Hand 3 #4 Hand 1 45 Hand 2
...
Página 361
Trick No. 6 Hand 4 43 Hand 1 *Q Hand 2 44 Hand 3 *K Trick No. 7 Hand 2 43
Hand 3 +(,) Hand 4 *A Hand 1 4.1 Trick No. 8 Hand 3 *3 Trick No. 9 Hand 4 44
Hand 4 Hand 1 Hand 2 *9 45 Hand 1 Hand 2 Hand 3 ¥8 410 ♢ 10 Trick No. 10
Hand ...
Trick No. 6 Hand 4 43 Hand 1 *Q Hand 2 44 Hand 3 *K Trick No. 7 Hand 2 43
Hand 3 +(,) Hand 4 *A Hand 1 4.1 Trick No. 8 Hand 3 *3 Trick No. 9 Hand 4 44
Hand 4 Hand 1 Hand 2 *9 45 Hand 1 Hand 2 Hand 3 ¥8 410 ♢ 10 Trick No. 10
Hand ...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
jlnknkn jytkjty jytrjytrj jt yjtrj
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 |