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 3
Página 30
... opening position . We can define as our goal any board position in which the opponent does not have a legal move and his or her king is under attack . The legal moves provide the way of getting from the initial state to a goal state ...
... opening position . We can define as our goal any board position in which the opponent does not have a legal move and his or her king is under attack . The legal moves provide the way of getting from the initial state to a goal state ...
Página 308
... openings and endgames are often highly stylized , so they are best played by table lookup into a database of stored patterns . To play an entire game then , we need to combine search - oriented and nonsearch - oriented techniques . The ...
... openings and endgames are often highly stylized , so they are best played by table lookup into a database of stored patterns . To play an entire game then , we need to combine search - oriented and nonsearch - oriented techniques . The ...
Página 321
... opening sequences and endgame sequences are highly stylized . In these situations , the performance of a program can often be considerably enhanced if it is provided with a list of moves ( called book moves ) that should be made . The ...
... opening sequences and endgame sequences are highly stylized . In these situations , the performance of a program can often be considerably enhanced if it is provided with a list of moves ( called book moves ) that should be made . 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