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 8
Página 29
... situation ( s ) will be as well as what final situations constitute acceptable solutions to the problem . 2. Analyze ... board , the rules that define the legal moves , and the board positions that represent a win for one side or the ...
... situation ( s ) will be as well as what final situations constitute acceptable solutions to the problem . 2. Analyze ... board , the rules that define the legal moves , and the board positions that represent a win for one side or the ...
Página 310
... board position . An example of this operation is shown in Figure 12.1 . It assumes a static evaluation function that ... situation would appear to be very good , but , if we look one move ahead , we will see that one of our pieces also gets ...
... board position . An example of this operation is shown in Figure 12.1 . It assumes a static evaluation function that ... situation would appear to be very good , but , if we look one move ahead , we will see that one of our pieces also gets ...
Página 330
... board position should be transformed into another . But if we are considering the problem of guiding a robot around an ordinary house , the situation is much more complex . The description of a single state is very large since it must ...
... board position should be transformed into another . But if we are considering the problem of guiding a robot around an ordinary house , the situation is much more complex . The description of a single state is very large since it must ...
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