Pancakes, Puzzles, and Polynomials: Cracking the Cracker Barrel

The Cracker Barrel peg game is a simple, one-player
game commonly found on tables at pancake restaurants.
In this paper, we consider the computational complexity
of the Cracker Barrel problem. We show that a variation
of a generalization of the problem is NP-complete.

Description

With over 1.5 million sales, the Cracker Barrel peg game is an entertaining
puzzle found on tables at pancake restaurants. We have shown that solving a
variation of the
peg game is an NP-complete problem.