The path-cost from the present state to target state is computed, to choose the least pathcost for the further state. Additional information can be added as assumption to solve the problem. E.g. a. Greedy search b. Best first search c. A*search

Keywords: Informed Search and Exploration, Informed (Heuristic) Search Strategies, Heuristic Function, Local Search Algorithms and Optimistic Problems, Local Search in Continuous Spaces, Online Search Agents and Unknown Environments, Constraint Satisfaction Problems (CPS), Backtracking Search and Local Search for CSP, Structure of Problems, Adversarial Search, Games – Optimal Decisions in Games, Alpha-Beta Pruning, Imperfect Real Time Decision, Games that Include an Element of Chance