  We study Snipperclips, a computer puzzle game whose objective is to create a
target shape with two tools. The tools start as constant-complexity shapes, and
each tool can snip (i.e., subtract its current shape from) the other tool. We
study the computational problem of, given a target shape represented by a
polygonal domain of $n$ vertices, is it possible to create it as one of the
tools' shape via a sequence of snip operations? If so, how many snip operations
are required? We consider several variants of the problem (such as allowing the
tools to be disconnected and/or using an undo operation) and bound the number
of operations needed for each of the variants.
