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 19
This is done as follows. Initialize BEST-SCORE to the minimum value that
STATIC can return. It will be updated to reflect the best score that can be
achieved by an element of SUCCESSORS. For each element SUCC of
SUCCESSORS, do the ...
So return the structure VALUE = BEST-SCORE PATH = BEST-PATH When the
initial call to MINIMAX returns, the best move from CURRENT is the first element
on PATH. To see how this procedure works, you should trace its execution for the
After K is examined, we see that I is guaranteed a maximum score of 0, which
means that F is guaranteed a minimum of 0. But this is less than alpha's value of
3, so no more branches of I need be considered. The maximizing player already
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