Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 48
Página 30
The starting position can be described as an 8 - by - 8 array where each position
contains a symbol standing for the appropriate piece in the official chess opening
position . We can define as our goal any board position in which the opponent ...
The starting position can be described as an 8 - by - 8 array where each position
contains a symbol standing for the appropriate piece in the official chess opening
position . We can define as our goal any board position in which the opponent ...
Página 310
The idea is to start at the current position and use the plausible - move generator
to generate the set of possible successor positions . Now we can apply the static
evaluation function to those positions and simply choose the best one .
The idea is to start at the current position and use the plausible - move generator
to generate the set of possible successor positions . Now we can apply the static
evaluation function to those positions and simply choose the best one .
Página 312
MOVEGEN ( Position , Player ) — The plausible - move generator , which returns
a list of nodes representing the moves that can be made by Player in Position .
We call the two players PLAYER - ONE and PLAYER - TWO ; in a chess program
...
MOVEGEN ( Position , Player ) — The plausible - move generator , which returns
a list of nodes representing the moves that can be made by Player in Position .
We call the two players PLAYER - ONE and PLAYER - TWO ; in a chess program
...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
very good
Contenido
Problems Problem Spaces and Search | 29 |
7 | 61 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 11 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
active addition agents algorithm allow answer apply approach assertions becomes belief build called Chapter choose clauses combined complete concept consider consistent constraints contains corresponding define dependency described discussed domain elements example fact Figure function given goal heuristic important initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible predicate present problem procedure produce properties question reasoning relation represent representation result robot rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific statements step stored structure Suppose task techniques things tree true understanding units usually variables weights