Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 86
Página 310
As values are passed back up , different assumptions must be made at levels
where the program chooses the move and at the alternating ... Now we can apply
the static evaluation function to those positions and simply choose the best one .
As values are passed back up , different assumptions must be made at levels
where the program chooses the move and at the alternating ... Now we can apply
the static evaluation function to those positions and simply choose the best one .
Página 343
How should our program choose now between alternative 1 and alternative 2 ?
We can tell that picking up C ( alternative 1 ) is better than unstacking it because
it is not currently on anything . So to unstack it , we would first have to stack it .
How should our program choose now between alternative 1 and alternative 2 ?
We can tell that picking up C ( alternative 1 ) is better than unstacking it because
it is not currently on anything . So to unstack it , we would first have to stack it .
Página 438
In this case , for example , P should choose move a ( rather than b , even though
the best case for P included move b ) . Why ? The answer is that P should
assume that will behave rationally . In this matrix , the c column dominates the d
column ...
In this case , for example , P should choose move a ( rather than b , even though
the best case for P included move b ) . Why ? The answer is that P should
assume that will behave rationally . In this matrix , the c column dominates the d
column ...
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Contenido
What Is Artificial Intelligence? | 3 |
Problems Problem Spaces and Search | 29 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 21 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 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