Heuristics: Intelligent Search Strategies for Computer Problem Solving
Problem-solving strartegies and the nature of Heuristic informatio n.Heuristics and problem representations. Basic Heuristic-Search procedures. Formal properties of Heuristic methods. Heuristics viewed as information provided by simplified models. Performance analysis of Heuristic methods. Abstract models for quantitative performace analysis. Complexity versus precision of admissible Heuristics. Searching with nonadmissible Heuristics. Game-playing programs. Strategies and models for game-playing programs. Performace analysis for game-searching strategies. Decision quality in game searching. Bibliography. Index.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Basic HeuristicSearch Procedures
Formal Properties of Heuristic Methods
9 other sections not shown
8-Puzzle a-fi admissible admissible heuristic analysis AND/OR graphs assume asymptotic backtracking best-first best-first search branching factor branching process breadth-first breadth-first search candidate Chapter complexity computation condition cost Counterfeit Coin problem depth-first search distribution error estimate evaluation function example expected number explored exponential finite frontier nodes game tree game-searching given goal node guaranteed heuristic function Judea Pearl labeled leaf nodes Lemma MAX node minimax value moves node on OPEN nodes expanded nonterminal node number of nodes number of terminal obtained OPEN node optimal solution parameters performance player pointers probabilistic probability procedure Proof random variables recursive represent root node satisfied SCOUT search strategies Section solution bases solution graph solution path solution tree solved state-space step subgoals subproblem subset subtree successors terminal nodes terminal values Theorem tion Traveling Salesman problem upper support whereas