Strategies, Applications, and Models through SEARCH
Complex information structures are found in many disciplines including physics, genetics, biology and all branches of the information sciences. The current increasing, widespread use of information technology in all academic activities' empha...
What is artificial intelligence (AI)? How can AI help a learner, a teacher or a system designer? What are the positive impacts of AI on human learning? AI for Learning examines how artificial intelligence can, and should, positively impact human l...
Search-related techiques in AI: why search; objectives; problem-solving systems; state space search and problem reduction; blind search and heuristic search; graphs and trees; organisation of the book; searching for a solution path in a state space; problem reduction; a very brief comparison of POP-11 and Prolog; further reading. Simple state space search: path-finding; setting up the database; setting up the path-finding function; the generality of search; search spaces and search trees; constructing an explicit representation of the search-tree; search graphs; node terminology; backwards v. forwards searching; OR-tree search in Prolog; reading; exercises. State space search: introduction; the water jugs problem; constructing successor nodes; the problem space; searching for a solution path; problem space exploration strategies; breadth-first search; agendas; implementing depth-first search using an agenda; iterative deepening; water jugs in Prolog; agendas in Prolog; iterative deepening in Prolog; reading; exercises; notes. Heuristic state space search: introduction; the 8-puzzle; constructing 8-puzzle successors; heuristic search; hill-climbing search; heuristic breadth-first search; ordered search and the A* algorithm; heuristic search in Prolog; reading; exercises; notes. Heuristic search of game trees; computing successors in the game of nim; minimax evaluation; worked example; alpha-beta cutoffs; implementing a nim-playing program; minimaxing in Prolog. (Part contents).