### G.P.S. (continued)

#### The specification for GPS of the monkey task

From Slagle, James R. (1971), Artificial Intelligence: The Heuristic Programming Approach (New York: McGraw-Hill), Ch. 8.

A.  Miscellaneous information:  The set of places (on the floor) = [place1, place2, under the bananas]
B.  Operators
1.  CLIMB =
a.  Pretest:  The monkey's place is (the same as) the box's place.
b.  Move:  The monkey's place becomes on the box.
2.  WALK =
a.  Variable:  x is in the set of places.
b.  Move:  The monkey's place becomes x.
3.  MOVE BOX =
a.  Variable:  x is in the set of places.
b.  Pretests:
1.  The monkey's place is in the set of places
2.  The monkey's place is the box's place.
c.  Moves
1.  The monkey's place becomes x.
2.  The box's place becomes x.
4.  GET BANANAS =
a.  Pretests
1.  The box's place is under the bananas.
2.  The monkey's place is on the box.
b.  The contents of the monkey's hand become the bananas.
C.  Differences
D1 is the monkey's place.
D2 is the box's place.
D3 is the content's of the monkey's hand.
D.  Difference Ordering:  D3 is more difficult to reduce than is D2 which is more difficult to reduce than is D1.
E.  TABLE OF CONNECTIONS = All operators are desirable for reducing all differences.