Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 82
Página 308
... moves available at each turn . If we use a simple legal - move generator , then the test procedure ( which probably uses some combination of search and a heuristic evaluation function ) will have to look at each of them . Because the ...
... moves available at each turn . If we use a simple legal - move generator , then the test procedure ( which probably uses some combination of search and a heuristic evaluation function ) will have to look at each of them . Because the ...
Página 321
... Moves For complicated games taken as wholes , it is , of course , not feasible to select a move by simply looking up the current game configuration in a catalogue and extracting the correct move . The catalogue would be immense and no ...
... Moves For complicated games taken as wholes , it is , of course , not feasible to select a move by simply looking up the current game configuration in a catalogue and extracting the correct move . The catalogue would be immense and no ...
Página 438
... move b and Q makes move d . On the other hand , Q comes out best if P makes move a and Q makes move c . Of course , no one of the agents can force such a dual move . Each must make its own decision independently . In this case , for ...
... move b and Q makes move d . On the other hand , Q comes out best if P makes move a and Q makes move c . Of course , no one of the agents can force such a dual move . Each must make its own decision independently . In this case , for ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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