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 17
Returns ( 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 operates by ...
This algorithm will look ahead at various sequences of moves in order to find a
sequence that leads to a win . It attempts to maximize the likelihood of winning ,
while assuming that the opponent will try to minimize that likelihood . This
individual board positions by estimating how likely they are to lead eventually to
a win . Its function is similar to that of the heuristic function h ' in the A * algorithm :
in the absence of complete information , choose the most promising position .
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