Key components of backtracking

Now that we have a basic understanding of backtracking, let's explore it in greater detail by examining the key components of a backtracking solution. We will discuss the three conditions a problem must satisfy to be suitable for backtracking and see how these conditions collectively give rise to a state space tree, which forms the backbone of the solution process.

Finite set of outcomes

Backtracking is a brute-force technique that validates each outcome as a potential solution. A problem with a backtracking solution should be deterministic and have a finite set of potential outcomes.