Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 10
Página 12
... look at several parts of the board at once , whereas the conventional ... seem so great that different strategies seem best . As we learn more about problem ... ahead at the board positions that result from each possible move . Decide ...
... look at several parts of the board at once , whereas the conventional ... seem so great that different strategies seem best . As we learn more about problem ... ahead at the board positions that result from each possible move . Decide ...
Página 13
... look ahead at various sequences of moves in order to find a sequence that leads to a win . It attempts to maximize the likelihood of winning , while assuming that the opponent will try to minimize that likelihood . This algorithm is ...
... look ahead at various sequences of moves in order to find a sequence that leads to a win . It attempts to maximize the likelihood of winning , while assuming that the opponent will try to minimize that likelihood . This algorithm is ...
Página 310
... ahead than one ply . This could be very important , for example , in a chess game in which we are in the middle of a piece exchange . After our move , the situation would appear to be very good , but , if we look one move ahead , we ...
... ahead than one ply . This could be very important , for example , in a chess game in which we are in the middle of a piece exchange . After our move , the situation would appear to be very good , but , if we look one move ahead , we ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space