Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 84
Página 311
3 : Backing Up the Values of a Two - Ply Search But now we must take into
account that the opponent gets to choose which successor moves to make and
thus which terminal value should be backed up to the next level . Suppose we
made ...
3 : Backing Up the Values of a Two - Ply Search But now we must take into
account that the opponent gets to choose which successor moves to make and
thus which terminal value should be backed up to the next level . Suppose we
made ...
Página 321
It employs a purely syntactic criterion , choosing interesting lines of play without
recourse to any additional domain knowledge . ... For instance , it relies heavily
on the assumption that the opponent will always choose the optimal move .
It employs a purely syntactic criterion , choosing interesting lines of play without
recourse to any additional domain knowledge . ... For instance , it relies heavily
on the assumption that the opponent will always choose the optimal move .
Página 438
Each must make its own decision independently . 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 Q will behave
rationally .
Each must make its own decision independently . 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 Q will behave
rationally .
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