Admissible Heuristics for Automated Planning by

Page 66 The sum of the Manhattan distances of tiles 5 and 6 (and the value of h{T5,T6}) is 3, as tile 6 is only one step out of place, and the lower bound incorporating the linear conflict is thus 5. (The heuristic values for this problem given by the different pattern selections in the example on page 70 are correct.) Page 71 CG−1(V ) is the set of V s immediate successors in the causal graph (thus, the function should have been called CG(V )). The preceeding definition is correct as intended.