Further thoughts on backtracking and bounding

Abstract

This report contains furthers analysis finding more accurate boundaries (pruning) to get a better performance for a specific backtracking algorithm based on the pattern problem. The problem statement is modest-sized to understand the combining criteria implemented reducing substantially the amount of time invested processing, and grows exponentially to the size of the problem making it expensive without applying any constraint.