1. [1] Creative Crafthouse, King snake.
2. [2] Demaine, E.D., Demaine, M.L., Lindy, J.F. and Souvaine, D.L.: Hinged dissection of polypolyhedra, Proc. 9th Workshop on Algorithms and Data Structures (WADS 2005), Lecture Notes in Computer Science, Vol.3608, pp.205-217, Waterloo, Ontario, Canada (2005).
3. [3] Demaine, E.D. and Eisenstat, S.: Flattening fixed-angle chains is strongly NP-hard, Proc. 12th Algorithms and Data Structures Symposium (WADS 2011), pp.314-325, Brooklyn, New York (2011).
4. [4] Garey, M.R. and Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints, SIAM Journal on Computing, Vol.4, No.4, pp.397-411 (1975).
5. [5] Indiana University Lilly Library, The jerry slocum mechanical puzzle collection, available from <http://webapp1.dlib.indiana.edu/images/splash.htm?scope=lilly/slocum> 024867, 024868, 024869, 024870, and 024871, available from <http://webapp1.dlib.indiana.edu/images/item.htm?id=http://purl.dlib.indiana.edu/iudl/lilly/slocum/LL-SLO-024867>.