Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 16
Página 320
... game tree to an average depth of six ply and , on the basis of that search , choose a particular move . Although it would have been too expensive to have searched the entire tree to a depth of eight , it is not very expensive to search ...
... game tree to an average depth of six ply and , on the basis of that search , choose a particular move . Although it would have been too expensive to have searched the entire tree to a depth of eight , it is not very expensive to search ...
Página 326
... game playing . The papers cover the games listed above as well as bridge , scrabble , dominoes , go - moku , hearts , and poker . 12.7 Exercises 1. Consider the following game tree in which static scores are all from the first player's ...
... game playing . The papers cover the games listed above as well as bridge , scrabble , dominoes , go - moku , hearts , and poker . 12.7 Exercises 1. Consider the following game tree in which static scores are all from the first player's ...
Página 449
Elaine Rich. Game Tree A B C D E F G H I J K Stored Scores A : 10 M N ( a ) L P Q R A S T V W X 10 ( b ) Figure 17.1 : Storing Backed - Up Values in AI programs to produce some surprising performance improvements . Such caching is known ...
Elaine Rich. Game Tree A B C D E F G H I J K Stored Scores A : 10 M N ( a ) L P Q R A S T V W X 10 ( b ) Figure 17.1 : Storing Backed - Up Values in AI programs to produce some surprising performance improvements . Such caching is known ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's