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 9
Página 3
... game playing and theorem proving . Samuel wrote a checkers - playing program that not only played games with opponents but also used its experience at those games to improve its later performance . Chess also received a good deal of ...
... game playing and theorem proving . Samuel wrote a checkers - playing program that not only played games with opponents but also used its experience at those games to improve its later performance . Chess also received a good deal of ...
Página 307
Elaine Rich, Kevin Knight. Chapter 12 Game Playing 12.1 Overview Games hold an inexplicable fascination for many people , and the notion that computers might play games has existed at least as long as computers . Charles Babbage , the ...
Elaine Rich, Kevin Knight. Chapter 12 Game Playing 12.1 Overview Games hold an inexplicable fascination for many people , and the notion that computers might play games has existed at least as long as computers . Charles Babbage , the ...
Página 325
... game - playing programs that relies heavily on automatic learning . Othello Othello is a popular board game that is played on an 8x8 grid with bi - colored pieces . Although computer programs have already achieved world - championship level ...
... game - playing programs that relies heavily on automatic learning . Othello Othello is a popular board game that is played on an 8x8 grid with bi - colored pieces . Although computer programs have already achieved world - championship level ...
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