AI Tools on Your Desktop

U

A uninformed search strategy that expands the the node with the lowest path cost first. The frontier is implemented as a priority queue ordered by path cost and the goal test is applied to a node when it is selected for expansion. It is complete and optimal.

A systematic search strategy that applies operators to nodes without using any special knowledge about the problem domain (other than the problem formulation). Exponential-complexity search problems cannot be solved by uninformed strategies for any but the smallest instances.