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 18
Página 30
Elaine Rich, Kevin Knight. Black Black ( 5 4 3 1 a b c d e f g h White 允 선 a b с de f g h White Figure 2.1 : One Legal Chess Move For the problem " Play chess , " it is fairly easy to provide a formal and complete problem description ...
Elaine Rich, Kevin Knight. Black Black ( 5 4 3 1 a b c d e f g h White 允 선 a b с de f g h White Figure 2.1 : One Legal Chess Move For the problem " Play chess , " it is fairly easy to provide a formal and complete problem description ...
Página 183
... White White pawn at a b c d e f g h White Figure 6.4 : One Legal Chess Move Square ( file e , rank 2 ) AND Square ( file e , rank 3 ) is empty AND Square ( file e , rank 4 ) is empty ↑ move pawn from Square ( file e , rank 2 ) to ...
... White White pawn at a b c d e f g h White Figure 6.4 : One Legal Chess Move Square ( file e , rank 2 ) AND Square ( file e , rank 3 ) is empty AND Square ( file e , rank 4 ) is empty ↑ move pawn from Square ( file e , rank 2 ) to ...
Página 338
... white , some pink , and some red . We want to paint a room so that it has light red walls and a white ceiling . We could produce light red paint by adding some white paint to the red . But then we could not paint the ceiling white . So ...
... white , some pink , and some red . We want to paint a room so that it has light red walls and a white ceiling . We could produce light red paint by adding some white paint to the red . But then we could not paint the ceiling white . So ...
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