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 19
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 313
Elaine Rich, Kevin Knight. MINIMAX ( CURRENT , 0 , PLAYER - ONE ) if PLAYER - ONE is to move , or MINIMAX ( CURRENT , 0 , PLAYER - TWO ) if PLAYER - TWO is to move . Algorithm : MINIMAX ( Position , Depth , Player ) 1. If DEEP - ENOUGH ...
Elaine Rich, Kevin Knight. MINIMAX ( CURRENT , 0 , PLAYER - ONE ) if PLAYER - ONE is to move , or MINIMAX ( CURRENT , 0 , PLAYER - TWO ) if PLAYER - TWO is to move . Algorithm : MINIMAX ( Position , Depth , Player ) 1. If DEEP - ENOUGH ...
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 ...
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