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 17
Página 310
... opponent chooses . There are several ways that this can be done . The most commonly used method is the minimax procedure , which is described in the next section . An alternative approach is the B * algorithm [ Berliner , 1979a ] ...
... opponent chooses . There are several ways that this can be done . The most commonly used method is the minimax procedure , which is described in the next section . An alternative approach is the B * algorithm [ Berliner , 1979a ] ...
Página 311
... 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 move B. Then the opponent must choose among moves E , F , and G. The opponent's goal is to ...
... 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 move B. Then the opponent must choose among moves E , F , and G. The opponent's goal is to ...
Página 321
... opponent will make a mistake . Suppose we must choose between two moves , both of which , if the opponent plays perfectly , lead to situations that are very bad for us , but one is slightly less bad than the other . But further suppose ...
... opponent will make a mistake . Suppose we must choose between two moves , both of which , if the opponent plays perfectly , lead to situations that are very bad for us , but one is slightly less bad than the other . But further suppose ...
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