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 8
Posswin(p) Returns 0 if player p cannot win on his next move; otherwise, it
returns the number of the square that constitutes a winning move. This function
will enable the program both to win and to block the opponent's win. Posswin
It attempts to maximize the likelihood of winning, while assuming that the
opponent will try to minimize that likelihood. This algorithm is called the minimax
procedure, and it is discussed in detail in Chapter 12. Comments This program
So he employed a simple learning mechanism in which components that had
suggested moves .that turned out to lead to wins were given an increased weight,
while the weights of those that had led to losses were decreased. Unfortunately ...
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