The algorithm for solving the model is composed of the following components: "determine the state space," "recursive between stations" "recursive within the station" and "
backtracking algorithm"
A
backtracking algorithm has been presented to address this problem.
The general
backtracking algorithm is similar, except that we only check subsets if they are feasible; that is, if a subset may lead to a solution.
To solve this problem we use a
backtracking algorithm that fills in all the cells of the rectangle one by one.
This
backtracking algorithm is guaranteed to terminate since there are a finite number of rules and backtracking can occur only once for each new rule.
Also, combing with the
backtracking algorithm, the unreliable atoms can be deleted.
The algorithm can be viewed as a variant of the standard (quadratic-time)
backtracking algorithm [Aho and Ullman 1977; Aho et al.
The boundary
backtracking algorithm, notwithstanding the name, actually combines aspects of backtracking and parallel search.