Video Module 29: Problem-Solving Flashcards
four components of a problem
- initial state
- goal state
- operators
- constraints
operators of a problem
the set of operations or actions that you can take to reach the goal state
goal state of a problem
the end product; the thing you want to achieve
initial state of a problem
the resources you currently have; your current situation
constraints of a problem
rules that cannot be violated
the problem space
the total set of possible moves within the constraints of the problem
- all of the possible moves you could make at any point while solving the problem
heuristics for problem solving
informal, intuitive strategies that sometimes lead to effective solutions, and sometimes don’t
1) hill-climbing heuristic
2) means-ends heuristic
algorithms
a procedure for inspecting every possible move in the problem space
- A series of operations applied over the problem space that may be represented over and over again, continuing until a final state is reached
- slow, resource consuming
- guaranteed to produce a correct answer
- e.g. Computers play chess while using an algorithm to represent every possible move they could make in response to an opponent, and every possible move they could make after that depending on what their opponent does
heuristics for problem solving
informal, intuitive strategies that sometimes lead to effective solutions
1) hill climbing heuristic
2) means-ends heuristic
hill-climbing heuristic
taking a step in the direction that most reduces the distance between your present state and your end state
- each step in between the initial state and the goal state must take you closer to the goal state
- good when there is a straightforward path to the solution
- can lead people to get stuck when the solution requires briefly moving away from the goal
means-ends heuristic
dividing the problem into smaller problems, then solving the smaller problems in any order to get to the end state
- You do not have to think of the first step first: means-ends only requires that you take all of the steps necessary to reach the end state
—you acknowledge that not all of the steps will necessarily bring you closer to the end goal
- e.g. Tower of Hanoi puzzle
How might working backwards help us solve problems? How is this an example of the means-ends heuristic?
Working backwards can help us solve problems that seem as though they require many steps in between the initial state and the end state
- e.g. Lily pads problem
- This is an example of using the means-ends heuristic, because with backwards thinking, you are only thinking of how to get to the end state—not how to move sequentially from the initial state to the end state
analogical reasoning
using structural similarities between a well-known base and an unfamiliar target domain to make inferences about the target domain
- In other words, comparing a problem to another, structurally similar problem that you’ve already solved, in order to find the solution
What did Gick & Holyoak (1980) discover about people’s ability to use analogical reasoning?
Gick & Holyoak (1980) designed a study in which participants were given stories to read, one of which included a general attacking a fortress using divided forces.
—When given the radiation problem initially, only about 10% of people were able to spontaneously generate the answer.
—After reading the story of the fortress, about 40% of participants could solve the radiation problem without further help
—After being told the story of the fortress was relevant to the radiation problem, an additional 40% of participants could solve the problem
convergence schema
A schema that outlines the initial state goal, resources, operators, constrains, solution, and outcome of two structurally similar problems
- Using a convergence schema allows you to explicitly see the similarities between two problems