Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 83
Página 30
... 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 not have a legal ...
... 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 not have a legal ...
Página 285
... described in the script have occurred . Slots representing objects that are involved in the events described in the script . The presence of these objects can be inferred even if they are not mentioned explicitly . Slots representing ...
... described in the script have occurred . Slots representing objects that are involved in the events described in the script . The presence of these objects can be inferred even if they are not mentioned explicitly . Slots representing ...
Página 314
... described is very simple . But its performance can be improved significantly with a few refinements . Some of these are described in the next few sections . 12.3 Adding Alpha - Beta Cutoffs Recall that the minimax procedure is a depth ...
... described is very simple . But its performance can be improved significantly with a few refinements . Some of these are described in the next few sections . 12.3 Adding Alpha - Beta Cutoffs Recall that the minimax procedure is a depth ...
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