Top Banner
Nicholas Burns, Michael Lee & Douglas Vickers Department of Psychology University of Adelaide South Australia PROBLEM SOLVING AND INTELLIGENCE Human Cognition and Applied Decision Making Research Unit
31

PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Mar 15, 2018

Download

Documents

buidan
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Nicholas Burns, Michael Lee & Douglas VickersDepartment of Psychology

University of AdelaideSouth Australia

PROBLEM SOLVING AND INTELLIGENCE

Human Cognition and Applied Decision Making Research Unit

Page 2: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

Perceptual optimisation problems:

• Travelling Salesman Problems (TSP)

• Minimum Spanning Tree Problems (MSTP)

• Generalised Steiner Tree Problems (GSTP)

Page 3: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceTravelling Salesman Problem:

• a series of n cities; devise a route whereby each is visited once and only once, concluding at the city where it began and with the overall distance as short as possible

Page 4: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceMinimum Spanning Tree Problem:

• find the shortest path that directly links all nodes in the array – does not have to be continuous and closed

Page 5: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceGeneralised Steiner Tree Problem:

• Shortest path connecting three points in a plane -create links from Fermat point

Page 6: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceVickers et al. (2004):

• TSP and Minimum Spanning Tree and Generalised Steiner Tree Problems

• notionally differing degree of use of automatic perceptual vs cognitive processes

• Experiment 1• N = 69; 50-node TSP (x5); RAPM

• Experiment 2• N = 48; 50-node TSP, MSTP, 15 node GSTP (all x2); RAPM

Page 7: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceVickers et al. (2004):

Performance quantified as proportion above benchmark

Expt 1: TSP and RAPM: rm = -.37, CI95 = [-.56,-.15]

Expt 2: TSP and RAPM: r = -.46, CI95 = [-.66,-.20]MSTP and RAPM: r = -.44, CI95 = [-.64,-.17]GSTP and RAPM: r = -.46, CI95 = [-.66,-.20]

TSP, MSTP, GSTP: mean r = .67, CI95 = [.47,.80]Mean test-retest reliability r = .7Chronbach’s α = .84 for five instances of TSP

Page 8: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

Page 9: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

Question is whether these correlations with Raven reflect shared perceptual processes, or shared cognitive processes, or both of them

Issue that Raven, while considered a pure measure of g, is a rather narrow measure of cognitive abilities

Perception is even more intelligent than has been generally assumed or cognition is more perceptually based?

Page 10: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

Cognitive optimisation problems:

• Secretary Problems (SecP)

• From a sequence of possible choices, accept or reject each in turn; choose the maximum value

• Distribution of numbers is known; number of values to be presented is known

• All incorrect decisions are equally wrong

Page 11: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

79.69[1/5]

Secretary Problem:• From a sequence of possible choices, accept or reject each in turn; choose the maximum value

Page 12: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceSecretary Problem:

• From a sequence of possible choices, accept or reject each in turn; choose the maximum value

34.40[2/5]

Page 13: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceSecretary Problem:

• From a sequence of possible choices, accept or reject each in turn; choose the maximum value

82.55[3/5]

Page 14: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceSecretary Problem:

• From a sequence of possible choices, accept or reject each in turn; choose the maximum value

95.77[4/5]

Page 15: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceSecretary Problem:

• From a sequence of possible choices, accept or reject each in turn; choose the maximum value

24.26[5/5]

Page 16: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceMethod:

• N = 101; 58 males; mean age 25.3±7.6 yrs• TSP (30-,60-,90-nodes, 1 of each)• MSTP (30-,60-,90-nodes, 1 of each)• GSTP (15-,20-,25-nodes, 1 of each)• SecP (5-point and 10-point, 40 of each)

• RPM, CCFT (Fluid ability, Gf; Visuo-spatial ability, Gv)• Picture Swaps (Gf)• Spatial Relations, Space Relations (Gv)• Digit Symbol, Visual Matching (Speed of processing, Gs)

Page 17: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

Correlations with RPM:

r CI95 Vickers et al

TSP -.35 [-.51,-.17] -.41

-.44

-.46

MSTP -.25 [-.43,-.06]

GSTP -.46 [-.60,-.29]

Page 18: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

Correlations among problem solving tasks:

TSP MSTP

.68

.50

.71

MSTP

GSTP

Page 19: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

Three initial models to generate observed covariance structure:

• Single general factor (cf Spearman)

• Separate problem solving ability correlated with Gf, Gv, Gs

• Perceptual problem solving tasks load Gv and SecProb loads Gf

Page 20: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

BIC = 356.5RMSEA = .16, CI90=[.14,.18]χ2(65) = 236.5, p < .001

g

VISMAT

.44

DIGSYM

.37

PICSWAPS

.61CCF_VAR

.59SPM_VAR

.67SPACEREL

.57SPATREL

.63

CCF_VSP .57

SPM_VSP .63

SECPROB.34

GSTP

.63

MSTP

.50

TSP

.59

Page 21: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

BIC = 239.5RMSEA = .07, CI90=[.04,.10]χ2(59) = 91.8, p = .004VISMAT

DIGSYM

PICSWAPS

CCF_VAR

SPM_VAR

SPACEREL

SPATREL

CCF_VSP

SPM_VSP

SECPROB

GSTP

MSTP

TSPProb

Gv

Gf

Gs.79

.79

.62

.56

.63

.60.68

.63

.64

.13.98

.78

.70

.16

.54

.50

1.05

.37

.69

Page 22: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

BIC = 314.1RMSEA = .14, CI90=[.11,.16]χ2(62) = 180.3, p < .001

VISMAT

DIGSYM

PICSWAPS

CCF_VAR

SPM_VAR

SPACEREL

SPATREL

CCF_VSP

SPM_VSP

SECPROB

GSTP

MSTP

TSP

Gv

Gf

Gs.78

.81

.60

.59

.69

.41.50.40

.48

.69

.26

.65

.75

.74.88

.39

Page 23: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

Comparison of models:

Model BIC RMSEA Chi-sq

.16 236.5

2 239.5 .07 91.8 59 .004

3 314.1 .14 180.3 62 <.001

Saturated 420.0 - 0 0 -

536.6.24

356.5

596.6

df p

65 <.001

<.00178

1

Null

Page 24: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

BIC = 239.5RMSEA = .07, CI90=[.04,.10]χ2(59) = 91.8, p = .004VISMAT

DIGSYM

PICSWAPS

CCF_VAR

SPM_VAR

SPACEREL

SPATREL

CCF_VSP

SPM_VSP

SECPROB

GSTP

MSTP

TSPProb

Gv

Gf

Gs.79

.79

.62

.56

.63

.60.68

.63

.64

.13.98

.78

.70

.16

.54

.50

1.05

.37

.69

Page 25: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

BIC = 314.1RMSEA = .14, CI90=[.11,.16]χ2(62) = 180.3, p < .001

VISMAT

DIGSYM

PICSWAPS

CCF_VAR

SPM_VAR

SPACEREL

SPATREL

CCF_VSP

SPM_VSP

SECPROB

GSTP

MSTP

TSP

Gv

Gf

Gs.78

.81

.60

.59

.69

.41.50.40

.48

.69

.26

.65

.75

.74.88

.39

Page 26: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

BIC = 168.0RMSEA = .05, CI90=[.00,.09]χ2(41) = 52.6, p .11VISMAT

DIGSYM

PICSWAPS

CCF_VAR

SPM_VAR

SPACEREL

SPATREL

CCF_VSP

SPM_VSP

SECPROB

Gv

Gf

Gs.79

.80

.64

.59

.65

.60

.69

.63

.63

1.00.37

.66

.34

OPPROB

.49

Page 27: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

BIC = 167.7RMSEA = .07, CI90=[.02,.10]χ2(43) = 61.6, p = .03VISMAT

DIGSYM

PICSWAPS

CCF_VAR

SPM_VAR

SPACEREL

SPATREL

CCF_VSP

SPM_VSP

SECPROB Gf/Gv

Gs.83

.57

.59

.66

.62

.64

OPPROB .49

.37

.67

.60

.65

.36

.43

Page 28: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and Intelligence

g

VISMAT

.48DIGSYM

.42PICSWAPS

.66CCF_VAR

.61SPM_VAR

.67

SPACEREL .59

SPATREL .64

CCF_VSP.60

SPM_VSP

.64

SECPROB

.37

OPPROB

.48

BIC = 199.6RMSEA = .11, CI90=[.08,.14]χ2(44) = 98.1, p < .001

Page 29: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceDefinitions of intelligence invariably make reference to problem solving

Perceptual optimisation problems can be represented by a single measure

Both perceptual and cognitive optimisation problems load a general ability factor (.5 and .4, respectively)

Potential to use optimisation problems as part of assessment batteries

Inform cognitive models of problem solving

Page 30: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

Problem Solving and IntelligenceIntelligence:

• ability to reason, plan, solve problems, think abstractly, comprehend complex ideas, learn quickly and learn from experience

Difficult optimisation problems:

• can often be stated simply and readily understood

• related to real world problem solving

Page 31: PROBLEM SOLVING AND INTELLIGENCE - · PDF fileProblem Solving and Intelligence Travelling Salesman Problem: osfe•ai sre ncities; devise a route whereby each is visited once and only

The End …