The Cookie Cutter Problem

Group 1

Mark Ayzenshtat, David Vespe, Vladislav Shchogolev
Columbia University
{ma810,djv,vs299}@columbia.edu

Date: October 14, 2003

Abstract:

In this report we discuss our solution to the Cookie Placement problem using a combination of placement strategies that includes randomized greedy and informed state-space searching, edge-matching, and pixellated fitting. We first motivate our approach and then describe these strategies, as well as specifics of our implementation. We end by analyzing and drawing conclusions from our player's performance in the tournament.