Heuristic_Problem_Solving

Heuristic Problem Solving Heuristic problem solving – are common-sense rules drawn from experience, used to solve problems. Or simply put the heuristic method of problem solving is a rule of thumb. By contrast, algorithms are straightforward procedures that are guaranteed to work every time. Heuristic programming characterizes programs that are self-learning; they are a part of artificial intelligence, they get better with experience. Heuristic programs do not always reach the very best result but usually produce good results within a reasonable amount of search time. As discussed in the April 1998 Phi Delta Kappa article titled “What is problem solving”, general heuristics are “cognitive rules of thumb that are useful in solving a great variety of problems”. Specific heuristics are used in specialized areas, often-specific subject domains or professions. There are three common methods in heuristic problem solving. First, the most powerful general heuristic is to form a sub-goal to reduce the discrepancy between your present state and your ultimate goal state. Do something to get a little closer to the end goal. Problems defy one-shot solutions; they must be broken down into smaller parts. A second heuristic method seeks to solve problems by "working heuristic, deep, blue, move, moves, computer, problems, method, good, position, time, problem, one, search, rules, methods, system, solve, solutions, searches, killer, game, first, decision, chess, work, three, solving, possible, heuristics, goal, crew, working, value, umpire