9.7.
2 Strategies Technique for Effective Problem-solving
"Strategy" is asystematic plan for generating possible solutions that can be tested
to see if they are correct. The main advantage of cognitive
strategies appears to
be that they permit the problem sofver to exercise sóme degree of control over the
task at hand. They allow individuals to choose the skills and knowledge that they
will bring to bear on any particular problem (Gagne. 1984). Some of the well
established strategies are as follows.
Techniques in problem-solv1ng can probably be as many, as the number of
unique problems that exist. The domain of human knowledge is ever expanding and
so are problem-solving tools and techniques that exist. What is needed is clarity in
thinking and clear sense of purpose. Here is a list of some of the best techniques
of problem-solving. These methods are generic strategies for problem-solving that
could be applied to solving any problem in business, personal life or any kind of
technical problem. The success of a solution also lies in its clinical execution. Even
if you have a solution, you need to have the courage to execute it and stand by its
soundness for it to work.
) Trial and Error: Some problems have such a narrow range of possible
solutions that we decide to solve them through trial and error. Trial and
error involves trying different responses until, perhaps, one works. Trial
and eror is testing possible solutions until the right one Is [Link]
method of tral and error is one of the techniques of problem-solving
which is most commonly used. The idea is to keep trying out solutions
and improving on them, by learning through mistakes. It is akind of brute
force methods, which does work, but can be time consuming
306 A EXPERIMENTAL PsYCHOLOGY
algorithmic (working
problem-solving is
One main type of solution). An
(i)Algorithm: towards the problem
alternative steps will
out all possible problem-solving strategy that guarantees that you
explorihg and evaluating
"algorithm" is a
It will involve systematically sometimes
arrive at a solution.
correct one is found. It is
until the generates hypotheses
aft possible solutions
generate-test strategy because one
referred to as a tests each one in
turn.
solutions and then
about potential solution to a problem
method that always producesa
Analgorithm is a exhaustive searches
time consuming, these
Although method that
sooner or later. Researchers call any
of a problem.
guarantee the solution Analgorithm that is
problem in algorithm.
guarantees asolution to a systematic random search,in in which you try
problems is a
useful for other
out all possible answers. systematic exploration of
every possible
An algorithm involves a originated in the field of
correct one is found. This strategy
solution until produce guaranteed
solutions.
mathematics, where its application can a solution.
procedure that guarantees
Algorithm is a step-by-step they are well-suited to
step-by-step algorithms can be laborious, thousands, and
Because hundreds,
computers. Computers can
rapidly sort through
solutions Without growing
tired or suffering from
even millions of possible
boredom. all_the
solution, _if you are aware of
Algorithms generate a correct simply
possibilities-but
big [Link] algorithms
in real tife, that is a
require too much effort. often
simple, commonly. used and most
We often solve problems with
strategies, called heuristics. But these strategies are inefficient and
studied possibilities,, even the unlikely
unsophisticated because it considers all
ones (Newell and Simon, 1972). procedure that
"Algorithm" is a methodological, logical rule
or
guaráhtees solving a particular problem.
It contrasts with the usually
heuristics.
speedier-but also more error-prove use of
problem-solving is heuristics, which
(ii) Heuristics: Another main type of which are most Ikely
means looking at only those parts of the problem
to produce results. Heuristic methods are applied to problem-solving
facilitate
and decision-making; they are infornal rule of thumb which
problem-solving,but sometimes at the expense of accuracy. Heuristics are
heuristic,
more economical strategies than algorithms. When one uses a
usually
there is no guarantee of success. On the other hand, heuristics are
less time consuming than algorithmstrategies and lead' toward goals in a
logical, sensible manner.
Heuristic is a short-cut strategy. "Heuristics" refer to a variety of rule
of-thumb strategies that may lead to quick solutions but are not guaranteed
to produce resultS. Heuristics are possible when the person has some
knowledge and experience to draw on for the solution. Hçuristic is a
simple thinking strategy that often allows us to make judgements and
solve problems efficiently;u_ually specdier but also more eror-prone than
THINKING AND PROBLEM-SOLVING 307
algorithms. These search techniques do not guarantee solution, as in the
Case of algorithm, but they substantially reduce the search time.
(iv) Insight: Sometimes we are unaware of using any problem-solving
strategy; the answer just comes to us. Such sudden flashes of inspiration
we call"Insight". Insight is a sudden and often novel realisation of the
solution to aproblem; it contrasts with strategy-based solutions. Insight
provides a sense of satisfaction. After solving a difficult problem or
discovering how to resolve aconflict, we feel happy.
Testing hypotheses: Asomewhat more systematic approach to problem
solving is provided by the strategy of testing hypotheses. Hypothesis
testing is assuming a possible explanation to the problem and trying to
prove (or, in some contexts, disprove) the assumption.
(vi Means-ends analysis: Means-ends analysis and the analogy approach
are the two commonest foTms of heuristic problem-solving. Means-ends
amatysis is a method used in problem-solving identified by Newell and
Simon in which an attempt is made to reduce the difference between the
current position on a problem and the desired goal position. In a means
ends analysis, the problem solver divides the problem into a number
of sub-problems, or smaller problems that may have more manageable
solutions. Each of these sub-problems is_solved by figuring out the
difference between your present situation and your goal, and then reducing
that difference, for example, by removing barriers (Mayer, 1991). In other
words, you figure out which "ends" you want and then determine what
"means" you will use to reach those ends. In this strategy, the difference
between thë present state and the desired state (the goal) 0s analysed.
Means-ends analysis means choosing an action at each step to move colser
to the goal.
Sometimes the correct solution to a problem depends upon temporarily
increasing -rather than reducing-the difference between the original
situation and the goal. It is painful to move anybody backward across the
river to where they originally began (Gilhooly, 1982; Thomas, 1974).
(vii) The analogy approach: When we use the analogy approach, we use a
solution to an earlier problem to help solve a new one. Like the means
ends approach, the analogy heuristic usúallybut not always-produces
a correct solution. According to a survey, most college level courses in
critical thinking emphasise the use of analogies (Halpern, 1987). Analogy
is the application of techniques that worked in similar situations in the
past (Genter and Holyoak, 1997; Holyoak and Thagard, 1997). People
frequently solve problems through the use of analogy-although they may
remain unaware that they have done so (Burns, 1996; Schunn and Dunbar,
1996).
(viii) Abstraction: Solving the problem in a model of the system before
applying it to the real system, Method of abstraction is modelling the
problem by taking the core details into consideration, while chiseling
away the unnecessary stuff. Then vou solve the problem in an abstract
way, before handling it in reality.