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 89
Página 307
... play chess and later of building a machine to play tic - tac - toe [ Bowden , 1953 ] . Two of the pioneers of the science of information and computing contributed to the fledgling computer game - playing literature . Claude Shannon ...
... play chess and later of building a machine to play tic - tac - toe [ Bowden , 1953 ] . Two of the pioneers of the science of information and computing contributed to the fledgling computer game - playing literature . Claude Shannon ...
Página 325
... play . Like its chess - playing cousins , BKG has reached high levels of play , even beating a human world champion in a short match . NEUROGAMMON [ Tesauro and Sejnowski , 1989 ] is another interesting backgam- mon program . It is ...
... play . Like its chess - playing cousins , BKG has reached high levels of play , even beating a human world champion in a short match . NEUROGAMMON [ Tesauro and Sejnowski , 1989 ] is another interesting backgam- mon program . It is ...
Página 452
... play a low card . At last , FOO has translated the rather vague advice " avoid taking points " into a specific , usable heuristic . FOO is able to play a better game of hearts after receiving this advice . A human can watch FOO play ...
... play a low card . At last , FOO has translated the rather vague advice " avoid taking points " into a specific , usable heuristic . FOO is able to play a better game of hearts after receiving this advice . A human can watch FOO play ...
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