The path

to the goal is a solution

to the problem.

The goal state itself is the

solution.

The state space is a set of "complete"

configurations.

The local search algorithms are good for the N-queens problem.