Both fundamental strategies involve performing a state-space search to minimize the overall dough length required. A number of discrete cookie orientations and positions are considered for each cookie, and the best performing overall placement is returned as the solution. Unfortunately, it is rarely feasible to consider every possible legal arrangement for each cookie in a brute force approach. The fundamental strategies solve this problem by reducing the search space to yield good sub-optimal placements.