Assertion: problem's solution | /r/HasProperty | the shortest path
Facets:
Source sentences:
text: In the worst case of an unbounded search space, the number of nodes expanded is exponential in the depth of the solution (the shortest path) d: O(bd), where b is the branching factor (the average number of successors per state).