Problem Solving Flashcards

1
Q

Problem Solving

A

Going from a problem to goal state
-A multi-step process that involves 3 stages

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Multi-Step Cognitive Process

A
  1. Recognizing and representing problem
  2. Analyzing and solving it
  3. Assessing the solution’s effectiveness
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

The Monk Problem

A

What do problems tell us about the nature of problem solving?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

The Problem-Solving Cycle

A
  1. Define problem
  2. Analyze problem
  3. Identify solutions (strategies)
  4. Choose solution (best solution)
  5. Plan of action
  6. Implement and evaluate (Was it the best strategy to use?)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q
  1. You lost your keys while out walking the dog
  2. Notice where your keys are not; realize you are locked out
  3. Solutions?
  4. Retrace your steps
  5. Carry out solution
  6. Was the chosen solution effective?
A

Example of problem-solving cycle

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Recursive

A

Repeat this cycle as many times as necessary to find a solution
-Ensures resolution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Applicable and Adaptable

A

The output of the cycle should be a solution to a current problem and a version that can generalize to new scenarios
-Generalization important = learn

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Generalization of Solution in Memory

A

-Important for adaptive behaviour
-Storing specific solutions without detail to apply to new scenarios
-Memory for solutions should include ‘essence’ and not specifics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Well Defined Problems

A

-Requirements are unambiguous
-All information needed to solve the problem is present
-Applying algorithms
-Puzzles

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Ill Defined Problems

A

-How to overcome problem/the goal is ambiguous
-Requires added information
-Situational
-E.g. relaxation.. beach or hike?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Well-Defined Problems

A

-Games like chess, sudoku
-Goal directedness
-Defined goal state
-Task constraints (clear steps)
-Single, expected outcome

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Ill-Defined Problems

A

-Ambiguous situations
-Have few limitations (rules) for how to solve the problem
-Multiple solutions or expected outcomes
-Social or self problem solving (rely on different neuro-cognitive processes)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Episodic Memory

A

Important for providing solutions (# of steps) for problems

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Ill-Defined Problems Carry a Load

A

-Greater actvity in the right lateral prefrontal cortex
-Solving these problems carries a greater ‘cognitive load’
-Do not have schematic solutions to reduce working memory capacity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Cognitive Load

A

The amount of information that your working memory system can hold at one time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

It is because these problems reduce working memory capacity

A

Why do ill-defined problems carry a high cognitive load?

17
Q

Moravec’s Paradox

A

Artificial intelligence (AI) can solve well-defined problems well, but not ill-defined problems and simple skills
-AI algorithms work well with certainty but not with uncertainty

18
Q

A Problem Space (Well-defined problems)

A
  1. Initial and goals state (e.g. drive to mtl)
  2. Intermediate paths and operations (e.g. stops at Tims because hungry; subgoal; helps move to goal state)
  3. Task Constraints (e.g. stay on highway)
19
Q

The Tower of Hanoi Problem Space

A
  1. Start/finish (initial + goal states)
  2. Lines, possible moves you can make (operations)
  3. Can’t put a bigger piece on top of a small one (constraints)
20
Q

well-defined problem; task constraints

A

The Tower of Harnoi Problem is an example of a _______ because it has ______

21
Q

Brute Force

A

-Systematic algorithm that represents all the possible steps from the problem to goal state
-Guaranteed to find a solution, but inefficient

22
Q

Combinatorial Explosion

A

Computing too many alternatives
-System kind of shuts down
-Linked to decision fatigue

23
Q

Heuristics

A

Stategies to select moves in a problem space to avoid combinatorial explosion and decision fatigue
-Trial and error
-Hill climbing strategy
-Means and analysis

24
Q

Concurrent Verbalizations

A

Describe what you are doing as you do it (how you are solving a problem)

25
Q

Retrospective Verbalizations

A

Describe what you did at an earlier time
-Influenced by metacognitive processes
-What you did before

26
Q

Trail and Error

A

-Considered ‘‘lower-level thinking’’
-Try out a number of solutions, rule out what doesn’t work
-Good for limited outcome problems (What colour of my shirt matches these pants?)
-Not good for multi-outcome problems (solving rubik cube)

27
Q

Hill Climbing Strategy

A

-Select the operation that brings you closer to the goal without examining the whole problem space
-This strategy can lead to a false outcome, a ‘local maxima’ (subgoal) is mistaken as the final goal
-Does not always work because some problems require you to move away from the goal in order to solve it

28
Q

The Hobbits and Orcs Problem

A

-Solution requires moving hobbits and orcs back and forth
-Requires moving away from goal first

29
Q

Means-Ends Strategy

A

-More flexible approach than hill-climbing
-What ‘‘means’’ do I have to make the current state look like the goal state?
-Identifying sub-problems to complete the goal
-Includes forward and backward movements
-Constantly evaluating the difference between current and goal states
-Taking into account all possible strategies

30
Q

Hill Climbing Strategy

A

A dog is face to a fence, it decides to plow through the fence. This is an example of…

31
Q

Means End Strategy

A

A dog s face to a fence, it decides to think about other potential moves to get to the other side, like finding a hole. This is an example of…

32
Q

Means End Strategy

A

-Envisioning end or ultimate goal
-Determining the best strategy for attaining the goal given current situation
-Highlights the importance of recursion
-Sub-goals and step by step approach to getting to solution

33
Q

They have more knowledge than novices

A

What makes expert problem solvers better than novices?

34
Q

True

A

Experts use better rules or strategies when solving problems. True or False.

35
Q

Experts spend more time defining a problem

A

Non-experts spent more time trying to develop a solution; Experts to define the problem appropriately

36
Q

Expertise and Viewing a Problem Solving

A

-Experts are more familiar with certain information and so they represent a problem differently than non-experts
-Expert radiologists use ‘global’ visual processes when viewing scans (do not focus on unnecessary details)

37
Q

Experts engage different brain processes to view a problem

A

-Expert radiologists recruit broader visual areas when viewing chest x-rays
-Experts recruit more brain areas that process information related to their expertise
-Experts are better able to use domain-relevant knowledge to perform a task

38
Q

Experts engage in holistic brain processing to solve a problem

A

Novices activate left hemisphere of brain while experts activate right side

39
Q

Limited Transfer Between Domains

A

Just because Snoop Dogg is an expert lyricist (rapper) does not mean he is an expert baker