AI Tools on Your Desktop

S

Search for paths to goals: The problem is to find a sequence of actions that reaches a goal state. The search algorithm takes a problem as input and returns a solution in the form of an action sequence. Systematic search strategies are used to solve this kind of problem.

Search for solutions: The problem is to find a solution (the goal state itself) in a large space of candidate solutions. The path to the goal state is irrelevant. Local search strategies are used to solve this kind of problem.

Operator that selects individuals in a population to generate new individuals. It is used to direct the search process towards better regions of the search space by giving preference to individuals of higher fitness.

The state space of a problem is the set of all states reachable from the initial state by any sequence of actions. It forms a directed graph in which nodes are states and the links between nodes are actions. If the number of different states is sufficiently small, the graph can be stored explicitly.