1. [1] Buchin, K., Buchin, M., Demaine, E.D., Demaine, M.L., El-Khechen, D., Fekete, S.P., Knauer, C., Schulz, A. and Taslakian, P.: On Rolling Cube Puzzles, Proc. 19th Canadian Conference on Computational Geometry (CCCG), pp.141-144 (2007).
2. [2] Demaine, E.D. and Hearn, R.A.: Constraint Logic: A Uniform Framework for Modeling Computation as Games, IEEE Conference on Computational Complexity, pp.149-162 (2008).
3. [3] Demaine, E.D. and Hearn, R.A.: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory, Games of No Chance 3, Albert, M.H. and Nowakowski, R.J. (Eds.), Mathematical Sciences Research Institute Publications, Vol.56, pp.3-56, Cambridge University Press (2009).
4. [4] Flake, G.W. and Baum, E.B.: Rush Hour is PSPACE-complete, or “Why you should generously tip parking lot attendants, ” Theoretical Computer Science, Vol.270, No.1-2, pp.895-911 (2002).
5. [5] Hearn, R.A.: TipOver is NP-complete, The Mathematical Intelligencer, Vol.28, pp.10-14 (2006).