The hardness of Witness puzzles
暂无分享,去创建一个
[1] Maarten Löffler,et al. Discretized Approaches to Schematization , 2017, CCCG.
[2] Wouter Meulemans,et al. Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance , 2016, ESA.
[3] Takayuki Yato,et al. On the NP-completeness of the Slither Link Puzzle , 2003 .
[4] Daniel Thalmann,et al. New Trends in Computer Graphics , 1988, Springer Berlin Heidelberg.
[5] Erik D. Demaine,et al. Playing Games with Algorithms: Algorithmic Combinatorial Game Theory , 2001, MFCS.
[6] Graham Kendall,et al. A Survey of NP-Complete Puzzles , 2008, J. Int. Comput. Games Assoc..
[7] Donald E. Knuth,et al. The Problem of Compatible Representatives , 1992, SIAM J. Discret. Math..