Liminal burning generalizes both the burning and cooling processes in graphs. In $k$-liminal burning, a Saboteur reveals $k$-sets of vertices in each round, with the goal of extending the length of the game, and the Arsonist must choose sources only within these sets, with the goal of ending the game as soon as possible. The result is a two-player game with the corresponding optimization parameter called the $k$-liminal burning number. For $k = |V(G)|$, liminal burning is identical to burning, and for $k = 1$, liminal burning is identical to cooling. Using a variant of Sperner sets, $k$-liminal burning numbers of hypercubes are studied along with bounds and exact values for various values of $k$. In particular, we determine the exact cooling number of the $n$-dimensional hypercube to be $n.$ We analyze liminal burning for several graph families, such as Cartesian grids and products, paths, and graphs whose vertex sets can be decomposed into many components of small diameter. We consider the complexity of liminal burning and show that liminal burning a graph is PSPACE-complete for $k\geq 2,$ using a reduction from $3$-QBF. We also prove, through a reduction from burning, that even in some cases when liminal burning is likely not PSPACE-complete, it is co-NP-hard. We finish with several open problems.