Most algorithms will test many possibilities for each partition until finding a good compromise and might also keep backtracking information in memory so that if a branch of the tree is found to be unsatisfactory other alternative partitions may be tried.
Most algorithms will test many possibilities for each partition until. Most algorithms are finding a good compromise. Most algorithms might also keep backtracking information in memory. Alternative partitions may be tried. A branch of the tree is found to be unsatisfactory other.