Problem Solving BN

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

Chap 4.

2
1

PROBLEM SOLVING APPROACHES – ALGORITHM;


HEURISTICS: MEANS-END ANALYSIS
COMPUTER SIMULATION, AND ANALOGY

BY
BALAJI NIWLIKAR

https://www.careershodh.com/
Algorithm
2

⚫ Algorithms are sequences of operations (in a problem space) that may be


repeated over and over again and that, guarantee the solution to a problem
(Hunt, 1975; Sternberg, 2000).
⚫ Generally, an algorithm continues until it satisfies a condition determined
by a program.
⚫ Suppose a computer is provided a well-defined problem and an appropriate
hierarchy (program) of operations organized into procedural algorithms.
⚫ The computer can readily calculate all possible operations and
combinations of operations within the problem space.
⚫ It determines the best possible sequence of steps to take to solve the
problem.
⚫ Inefficient and unsophisticated.
⚫ Ex. Anagram –OISMTUELNIU --
⚫ Ans-- SIMULTENIOUS
⚫ Newell and Simon recognized limits of our working memory and observed
that humans must use mental shortcuts (heuristics) for solving problems.

https://www.careershodh.com/
Heuristics
3

⚫ Heuristics (mental shortcuts) =—informal, intuitive, speculative strategies


that sometimes lead to an effective solution and sometimes do not
(Sternberg, 2000).
⚫ To lessen the burden on working memory.
⚫ General rule that usually correct
⚫ A strategy where you ignore some alternatives and explore only those
alternative which are likely to produce solution.
⚫ No guarantee of solution .
⚫ Studies -when problem solvers are confronted with a problem for which
they cannot immediately see an answer, effective problem solvers use the
heuristic of means–ends analysis.
⚫ In this strategy, the problem solver continually compares the current state
and the goal state and takes steps to minimize the differences between the
two states.
⚫ Types problem-solving heuristics- working forward, working backward, and
generate and test.
⚫ We use it in any problem. e,g, move problem (Greeno & Simon, 1988) and
to a more common everyday problem (Hunt, 1994)

⚫https://www.careershodh.com/
4

https://www.careershodh.com/
5

https://www.careershodh.com/
6

⚫ For more free study material visit to


https://www.careershodh.com/
⚫ If you like it, share with others !

⚫Thank you!!

https://www.careershodh.com/

You might also like