SPRING Problem Solving

Question 1

describe the problem space (duncker 1945) / newell and simon 1972/ ratman 1965

Answer 1

problem arises when an organism has a goal but doesnt know how to achieve it
made up of many elements of a problem - analyse via search strategies
some easier than others to solve
n tile - limited state space - depends on o spaces available to move

Question 2

what are the 3 elements of a problem

Answer 2

starting state of problem
goal - where want to be
set of processes- to reach the goal and transform from start to end state

Question 3

well defined goal

Answer 3

structured
not necessarily easier
know start and end and steps must complete

Question 4

ill defined goal

Answer 4

unstructured
more abstract
dont know how to get from a to b

Question 5

adversary bd non adversary in problem space

Answer 5

wheterh or not someone is actively trying to stop you from reaching your end goal ie chess = adversary

Question 6

knowledge rich vs knowledge learn in problem space

Answer 6

problems whose solution depends on specialized knowledge

Question 7

Insight vs. non-insight in problem space

Answer 7

those solved “all of a sudden” vs. those solved more incrementally–in a step by step fashion.

Question 8

what are the different types of search strategies in a problem space

Answer 8

depth first
breadth first
best first
AI researchers have suggested several forms, some (e.g., best-first search) not all of which are compatible with human cognition (e.g., they require too much memory or too-fast computation).

Question 9

define depth first search strategy

Answer 9

with each move you plan the path to the goal

look ahead for the outcome of each move

Question 10

define breadth first search strategy

Answer 10

interpret how alternative moves may influence

Question 11

define best first search strategy

Answer 11

which moves allows you to be where you want to be the fastest

Question 12

what are search strategies directed by

Answer 12

cost analysis
difference reduction
means end analysis

Question 13

describe difference reduction

Answer 13

want to get from a to b as fast as possible
do so by reducing the space between the two
linear fashion
ie chicken not go around wire to get to food but stop

Question 14

describe hill cimbing

Answer 14

difference reduction can be used in simple hill - climb to top
but require further insight to know that if want to go up a higher hill, you must first increase the distance before you can continue to resde (problem of local maxima)

Question 15

describe the nine dot problem

Answer 15

people find difficult as make up own untold rules - cant go beyond pace of the dots
BUT requires further insight to recognise that can connect the dots by extrapolating from the dots - requires maximising what you get out of each move

Question 16

describe the means end analysis (newell and simone 1972)

Answer 16

spects of both forward and backward reasoning in that both the condition and action portions of rules are considered when we decide which rules to apply -takes into account the gap between the current situation and the desired goal
ie IF (wm) goal to drive a car THEN(production memory) set subgoals to reach  - recognises may need to deviate

Question 17

describe newell and simon 1972 general problem solver computer simulation (GPS)

Answer 17

1. set goal/subgoal
2. diff between now and goal
3. operator - eliminate distance (ie may set another subgoal)
4. apply operator
   5- 2-4 until main goal is achieved
   - means in a process temporarily become an end goal

Question 18

describe how the tower of hanoi might be completed in means end

Answer 18

goal to move bar 3 to from peg a to peg c
set subgoal to move bar 2 FROM bar 3
set subgoal to move bar 1 FROM bar 2 etc
- the more subgoals that must be considered the longer it takes to make an initial move
FRONTAL LOBE PROB

Question 19

frontal lobe damage and means end

Answer 19

need memory resources to hold current goals - frontal love patients disproportionate difficulty with completing problems which requite multiple sub goals - problems in employing subgoals and holding in memory

Question 20

describe the water jug problem luchins 1942

Answer 20

given 3 jugs and target to fill one up a certain amount - unlimited water
most are solved with one formula Y = B - A - 2C
BUT some have easier formula
1 - pps given one formula to solve and control given variety
- both then given solution y = a - c
pps with prev 1 fail and try to use prev while control readily apply new

Question 21

what does the water jug problem (luchins 1942)

Answer 21

people have a tendency towards functional fixedness/einstellung
tendency to use their most well known method of problem solving even though it may not be the fastest or most efficient way

Question 22

define einstellung

Answer 22

development of a mechanised stat/problem solving set

predisposition to solve problems in a speciifc manner even if there are more appropriate means