Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 17
Página 312
... MINIMAX procedure is when to stop the recursion and simply call the static evaluation function . There are a variety of factors that may influence this decision . They include : . Has one side won ? • How many ply have we already ...
... MINIMAX procedure is when to stop the recursion and simply call the static evaluation function . There are a variety of factors that may influence this decision . They include : . Has one side won ? • How many ply have we already ...
Página 321
... minimax . 12.4.3 Using Book 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 ...
... minimax . 12.4.3 Using Book 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 ...
Página 326
... minimax procedure to do this . 6. How would the minimax procedure have to be modified to be used by a program playing a three- or four - person game rather than a two - person one ? 7. In the context of the search procedure described in ...
... minimax procedure to do this . 6. How would the minimax procedure have to be modified to be used by a program playing a three- or four - person game rather than a two - person one ? 7. In the context of the search procedure described in ...
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