|
We show in the figure the plan for the selective search
strategy for solving the Tower of Hanoi problem, which tends to be used
initially by naive subjects.
This is actually represented in the associative memory
of the planning module as a set of descriptions (or codes):
(wg(move(Disk,Peg,Peg2)),[get_disk(Disk,Peg),get_target_peg(Peg2),move(Disk,Peg2)])
(get_disk(Disk,Peg),[look_for(Disk,disk),top_disk(Disk,Peg),not_just_moved(Disk)])
(get_target_peg(Peg2),[look_for(Peg2,peg),not_last_on(Disk,Peg2)])
(move(Disk,Peg2),[move(Disk,Peg2])
and so on.
We are thus assuming that the planning module has
(i) descriptions (or codes) representing the information in each plan component,
(ii) a neural circuit mechanism for association, given a key,
to activate the corresponding plan description, and
(iii) a neural circuit mechanism sequencing through a list of
descriptions, activating one, waiting for completion, then
activating the next.
When a description is generated, it may be sent to another module,
such as premotor cortex, frontal eye fields, or the hippocampus.
|