The randomized, greedy state-space search strategy begins by finding the best possible placement for the first cookie using a sequence of random trials. Each trial consists of trying a random rotation angle and moving the cookie flush against the top left edge. In this greedy approach, the placement that minimized the rightmost bound of the cookie would be kept. This process is then repeated for all remaining cookies, holding all previously placed cookies fixed. The benefit of being greedy is that computation time is greatly reduced over a more brute force approach.