Skip to content

Latest commit

 

History

History
10 lines (6 loc) · 287 Bytes

question.md

File metadata and controls

10 lines (6 loc) · 287 Bytes

Prove the following assertions about planning graphs:

  1. A literal that does not appear in the final level of the graph cannot be achieved.

  2. The level cost of a literal in a serial graph is no greater than the actual cost of an optimal plan for achieving it.