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 15
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 the lifetime of its
opponent . Some kind of heuristic search procedure is necessary . One way of
9 : The Situation Calms Down Waiting for quiescence helps in avoiding the
horizon effect , in which an inevitable bad event can be delayed by various tactics
until it does not appear in the portion of the game tree that minimax explores .
10 : Iterative Deepening This “ pathological ” behavior of amplifying error - prone
heuristic estimates has not been observed in actual game - playing programs ,
however . It seems that game trees containing won positions and nonrandom ...
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
Heuristic Search Techniques
Knowledge Representation Issues
Derechos de autor
Otras 14 secciones no mostradas