Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 48
Página 30
... position can be described as an 8 - by - 8 array where each position contains a symbol standing for the appropriate piece in the official chess opening position . We can define as our goal any board position in which the opponent does ...
... position can be described as an 8 - by - 8 array where each position contains a symbol standing for the appropriate piece in the official chess opening position . We can define as our goal any board position in which the opponent does ...
Página 310
... position and use the plausible - move generator to generate the set of possible successor positions . Now we can ... position to represent our evaluation of it . The starting position is exactly as good for us as the position generated ...
... position and use the plausible - move generator to generate the set of possible successor positions . Now we can ... position to represent our evaluation of it . The starting position is exactly as good for us as the position generated ...
Página 312
... ( Position , Player ) -The plausible - move generator , which returns a list of nodes representing the moves that can be made by Player in Position . We call the two players PLAYER - ONE and PLAYER - TWO ; in a chess program , we might ...
... ( Position , Player ) -The plausible - move generator , which returns a list of nodes representing the moves that can be made by Player in Position . We call the two players PLAYER - ONE and PLAYER - TWO ; in a chess program , we might ...
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