I am not a mathematician. I am trying to understand if the paper "The complexity of solitaire" that shows this game is NP-complete also has a implicit assumption that a given hand can only be played once (i.e. is a single-shot rule). In other words a given hand cannot be replayed using information gathered from previous failed attempts to find a solution

Here is a link to the paper

https://www.sciencedirect.com/science/article/pii/S0304397509006100

I am not a mathematician. I am trying to understand if the paper "The complexity of solitaire" that shows this game is NP-complete also has a implicit assumption that a given hand can only be played once (i.e. is a single-shot rule). In other words a given hand cannot be replayed using information gathered from previous failed attempts to find a solution.

Here is the full information on the paper:

Luc Longpré and Pierre McKenzie, The complexity of solitaire, Theor. Comput. Sci. 410, No. 50, 5252-5260 (2009), MR2573977, Zbl 1194.68123.