partial solution

An incomplete solution built so far during a search, such as queens placed on the first few rows of the board.

In more detail

Pruning checks each partial solution against the constraints and abandons it the moment it breaks one, rather than waiting for a complete candidate. Backtracking extends a partial solution by one choice at a time and shrinks it again when it undoes a choice.

Related terms

Taught in

References