The Crackling Fire benchmark brute-forces all the valid states of a 27-segment wooden folding puzzle (finding the two solutions in the process). At the time of this writing, a sequential C implementation is provided along with two ports: concurrent Java with Fork/Join, and concurrent Erlang. An illustration of the unfolded puzzle: