In the first chapter of their classic book Concrete Mathematics, Graham, Knuth, and Patashnik consider the maximum number of pieces that can be obtained from a pancake by making cuts with a knife blade that is straight, or bent into a V, or bent twice into a . We extend their work by considering knives, or “cookie-cutters”, of even more exotic shapes, including a -armed V, a chain of connected line segments, long-legged versions of the letters , , , , , , , or , a convex polygon, a circle, a , a figure 8, a pentagram, a hexagram, or a lollipop (or qoppa). We also consider “constrained” versions of the long-legged letters , , , , and . In most cases we are able to determine the maximum number of pieces, although for the constrained and the lollipop we can only give bounds.