On the Difficulty of Nonograms
暂无分享,去创建一个
[1] N. Ueda,et al. NP-completeness Results for NONOGRAM via Parsimonious Reductions , 1996 .
[2] Xin Yao,et al. Solving Japanese Puzzles with Heuristics , 2007, 2007 IEEE Symposium on Computational Intelligence and Games.
[3] Zoltán Toroczkai,et al. The Chaos Within Sudoku , 2012, Scientific Reports.
[4] Colin C. Venters,et al. 2+2=5: painting by numbers , 2006, Electronic Imaging.
[5] Sancho Salcedo-Sanz,et al. Automated generation and visualization of picture-logic puzzles , 2007, Comput. Graph..
[6] Xin Yao,et al. Solving Very Difficult Japanese Puzzles with a Hybrid Evolutionary-Logic Algorithm , 2008, SEAL.
[7] Kees Joost Batenburg,et al. Solving Nonograms by combining relaxations , 2009, Pattern Recognit..
[8] I-Chen Wu,et al. Nonogram Tournaments in TAAI 2011 , 2012, J. Int. Comput. Games Assoc..
[9] Xin Yao,et al. Improving the performance of evolutionary algorithms in grid-based puzzles resolution , 2009, Evol. Intell..
[10] Xin Yao,et al. Teaching Advanced Features of Evolutionary Algorithms Using Japanese Puzzles , 2007, IEEE Transactions on Education.
[11] Richard Hamilton,et al. Painting by Numbers , 2007 .
[12] Walter A. Kosters,et al. Constructing Simple Nonograms of Varying Difficulty , 2010 .