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
2 As with any recursive program , a critical issue in the design of the MINIMAX
procedure is when to stop the recursion and simply call the static evaluation
function . There are a variety of factors that may influence this decision . They
MINIMAX ( CURRENT , 0 , PLAYER - ONE ) if PLAYER - ONE is to move , or
MINIMAX ( CURRENT , 0 , PLAYER - TWO ) if PLAYER - TWO is to move .
Algorithm : MINIMAX ( Position , Depth , Player ) 1 . If DEEP - ENOUGH ( Position
, Depth ) ...
The DEEP THOUGHT chess computer ( Anantharaman et al . , 1990 ) has used
singular extensions to great advantage , finding midgame mating combinations
as long as thirty - seven moves , an impossible feat for fixed - depth minimax . 12 .
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