Principles of Artificial Intelligence
A classic introduction to artificial intelligence intended to bridge the gap between theory and practice, "Principles of Artificial Intelligence" describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval. Rather than focusing on the subject matter of the applications, the book is organized around general computational concepts involving the kinds of data structures used, the types of operations performed on the data structures, and the properties of the control strategies used.
"Principles of Artificial Intelligence"evolved from the author's courses and seminars at Stanford University and University of Massachusetts, Amherst, and is suitable for text use in a senior or graduate AI course, or for individual study.
Results 1-3 of 91
A tree is a special case of a graph in which each node has at most one parent . A
node in the tree having no parent is called a root node . A node in the tree having
no successors is called a tip node . We say that the root node is of depth zero .
The dark arrows along certain arcs in this search graph are the pointers that
define parents of nodes in the search tree . The solid nodes are on CLOSED ,
and the other nodes are on OPEN at the time the algorithm selects node 1 for ...
It is important to observe that failing to generate nodes B , C , and D can in no
way affect what will turn out to be MAX ' s best first move . In this example , the
search savings depended on the fact that node A represented a win for MIN .
What people are saying - Write a review
PRODUCTION SYSTEMS AND AI
SEARCH STRATEGIES FOR
10 other sections not shown