General Game Playing
Problem op.2 - Subgoal Ordering
For each of the following sets of equivalent rules, say which rule is best in terms of worst case evaluation complexity using our standard algorithm without indexing.
s(X,Y,Z) :- p(X,Y) & q(X,X) & r(X,Y,Z)
s(X,Y,Z) :- p(X,Y) & r(X,Y,Z) & q(X,X)
s(X,Y,Z) :- q(X,X) & p(X,Y) & r(X,Y,Z)
s(X,Y,Z) :- q(X,X) & r(X,Y,Z) & p(X,Y)
s(X,Y,Z) :- r(X,Y,Z) & p(X,Y) & q(X,X)
s(X,Y,Z) :- r(X,Y,Z) & q(X,X) & p(X,Y)
s(X,Y,Z) :- p(X,Y) & q(a,b) & r(X,Y,Z)
s(X,Y,Z) :- p(X,Y) & r(X,Y,Z) & q(a,b)
s(X,Y,Z) :- q(a,b) & p(X,Y) & r(X,Y,Z)
s(X,Y,Z) :- q(a,b) & r(X,Y,Z) & p(X,Y)
s(X,Y,Z) :- r(X,Y,Z) & p(X,Y) & q(a,b)
s(X,Y,Z) :- r(X,Y,Z) & q(a,b) & p(X,Y)
s(X,Y,Z) :- p(X,Y,Z) & q(X) & ~r(X,Y)
s(X,Y,Z) :- p(X,Y,Z) & ~r(X,Y) & q(X)
s(X,Y,Z) :- q(X) & p(X,Y,Z) & ~r(X,Y)
s(X,Y,Z) :- q(X) & ~r(X,Y) & p(X,Y,Z)
s(X,Y,Z) :- ~r(X,Y) & q(X) & p(X,Y,Z)
s(X,Y,Z) :- ~r(X,Y) & p(X,Y,Z) & q(X)