Explanation: Any planning algorithm that can place two actions into a plan without specifying which should come first is called partial-order planner. 9. How many possible plans are available in partial-order solution?
A. 3
B. 4
C. 5
D. 6
Answer:A
Explanation: Any planning algorithm that can place two actions into a plan without specifying which should come first is called partial-order planner. 9. How many possible plans are available in partial-order solution?
A. 3 B. 4 C. 5 D. 6
Explanation: The partial-order solution corresponds to six possible total-order plans. 10. What is the other name of each and every total-order plans?