Mutext relations, we have seen how Forward Planning Graph Expansion works, and we have seen how backwards search in the planning graph works, which means we now can put all this together and finally come out with the Graphplan Algorithm. 