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 10
Página 308
... game tree will not be able to select even its first move during the lifetime ... go [ Benson et al . , 1979 ] . ) With a more selective move generator , the ... game playing , as in other problem domains , search is not the only available ...
... game tree will not be able to select even its first move during the lifetime ... go [ Benson et al . , 1979 ] . ) With a more selective move generator , the ... game playing , as in other problem domains , search is not the only available ...
Página 325
... Go is a very difficult game to play by machine since the average branching factor of the game tree is very high . Brute force search , therefore , is not as effective as it is in chess . Human go players make up for their inability to ...
... Go is a very difficult game to play by machine since the average branching factor of the game tree is very high . Brute force search , therefore , is not as effective as it is in chess . Human go players make up for their inability to ...
Página 615
... game playing 3 , 5 , 25 , 29 , 43 , 47 , 183 , 303 , 307 , 321 , 449 , 451 , 452 , 471 , 484 , 562 game tree ... Go 5 , 308 , 325 go - moku 326 goal - directed reasoning 178 , 332 , 420 Government Binding 386 GPS 4 , 24 , 95 , 349 GPSG ...
... game playing 3 , 5 , 25 , 29 , 43 , 47 , 183 , 303 , 307 , 321 , 449 , 451 , 452 , 471 , 484 , 562 game tree ... Go 5 , 308 , 325 go - moku 326 goal - directed reasoning 178 , 332 , 420 Government Binding 386 GPS 4 , 24 , 95 , 349 GPSG ...
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