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 54
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
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