1. [1] http://nikoli.co.jp/en/puzzles/usowan.html
2. [2] A.B. Adcock, E.D. Demaine, M.L. Demaine, M.P. O'Brien, F. Reidl, F.S. Villaamil, and B.D. Sullivan, “Zig-zag numberlink is NP-complete,” J. Inf. Process., vol.23, no.3, pp.239-245, 2015. 10.2197/ipsjjip.23.239
3. [3] D. Andersson, “Hashiwokakero is NP-complete,” Inf. Process. Lett., vol.109, no.19, pp.1145-1146, 2009. 10.1016/j.ipl.2009.07.017
4. [4] E.D. Demaine, Y. Okamoto, R. Uehara, and Y. Uno, “Computational complexity and an integer programming model of shakashaka,” Proc. 25th Canadian Conference on Computational Geometry, 2013, (online) http://cccg.ca/
5. [5] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, NY, 1979.