McGraw-Hill, 1991 - 621 páginas
The breadth of A. I. is explored and explained in this best selling text. Assuming no prior knowledge,it covers topics like neural networks and robotics. This text explores the range of problems which have been and remain to be solved using A. I. tools and techniques. The second half of this text is an excellent reference.
Resultados 1-3 de 9
Thus it is clear that a program that simply does a straightforward search of the
game tree will not be able to select even its first move during ... (So, for example,
it is extremely important in programs that play the game of go [Benson et al., 1979
... the search, return it. 3. Otherwise, increment THRESHOLD by the minimum
amount it was exceeded during the previous step, and then go to Step 2. ... Every
game, like every AI task, requires a careful combination of search and knowledge
Co 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 search
deeply by ...
Comentarios de la gente - Escribir un comentario
Calificaciones de los usuarios
very poor book for novice.Assumes u already know AI and the language is not at all user friendly.One has to read a sentence repeatedly to get a grasp and some times even then u don't understand.Go for other books much better than this
not soo good to go for novice
What Is Artificial Intelligence?
Problems Problem Spaces and Search
Heuristic Search Techniques
Derechos de autor
Otras 21 secciones no mostradas