Computer games, Volumen2 |
Dentro del libro
Resultados 1-3 de 55
Página 421
calls for draw cards; carries out the showdown. It also posts certain public
information, such as the state of the game (opening, betting before draw, draw,
opening after draw, betting after draw, evaluation); the general betting sequence
(the ...
calls for draw cards; carries out the showdown. It also posts certain public
information, such as the state of the game (opening, betting before draw, draw,
opening after draw, betting after draw, evaluation); the general betting sequence
(the ...
Página 422
1.0 0.9 0.8 0.7 •3 0.6 | 0.5 0.4- 0.3 0.2 0.1..., Probability of high hand 5 Players -
30.000 game! i •: i- » □ • □• • .v □i * • Before draw • After draw (with ret. to hand
before draw ) » After draw (with ref. to hand after draw) 0.0' ...•:*□ • □ • "in I
4iiiiinii ...
1.0 0.9 0.8 0.7 •3 0.6 | 0.5 0.4- 0.3 0.2 0.1..., Probability of high hand 5 Players -
30.000 game! i •: i- » □ • □• • .v □i * • Before draw • After draw (with ret. to hand
before draw ) » After draw (with ref. to hand after draw) 0.0' ...•:*□ • □ • "in I
4iiiiinii ...
Página 435
A game situation is determined by the history of past and current betting and
drawing behavior of all players. The consequences of a game situation, of course
, vary from player function to player function. The partitioning of the game
situation ...
A game situation is determined by the history of past and current betting and
drawing behavior of all players. The consequences of a game situation, of course
, vary from player function to player function. The partitioning of the game
situation ...
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 |