Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

where On (X, Y) means the object X is on object Y and clear (X) means there is
nothing on top of object X. The operators in the present context are given by the
following if-add-delete rules.
On (A, Table)
On (B, Table)
On(C, Table)
Clear (A)
Clear (B)
Clear (C)
Initial state
On (A,B)
On (B, Table)
On (C, Table)
Clear (A)
Clear (C)
Rule 2 X=A
Y=B
X=B, Z=A
On (B,A)
On (C, Table)
On (A, Table)
Clear ( C)
Clear (B)
X=C , Z=B
State S1
Added: clear (B)
Deleted: on (A,B)
Rule 3
On ( B, A)
On (C, B)
Clear (C)
On (A, Table)
Rule 3
State S2
Added: On (B, A)
Deleted: Clear (A), On (B, Table)
Goal State
Added: On (C, B)
Deleted: Clear (B), On (C, Table)
Fig. 12.4: The breadth first search of the goal state.