Exercise 8.15 The SNLP algorithm is the same as the partial-order planner presented here but, in the protect procedure, the condition is A = A0 and A = A1 and (A deletes G or A achieves G).

This enforces systematicity, which means that for every linear plan there is a unique partial-ordered plan. Explain why systematicity may or may not be a good thing

(e.g., discuss how it changes the branching factor or reduces the search space). Test the different algorithms on different examples.