Nonogram

Home * Games * Nonogram



Nonogram, a logic puzzle in which cells in a grid must be painted according to the given row clues and column clues. Players are requested to paint each grid cell into either “white” or “black”, such that the segments constituting of consecutive black cells in each row or column matches the corresponding row clue and column clue. The clues or numbers are a form of discrete tomography that measures how many unbroken lines of filled-in squares there are in any given row or column. Solving nonogram puzzles is a NP-complete problem.

=Competitions= Computer Olympiad, TAAI, and TCGA hold Nonogram competitions since 2010.

Since 2011, the competition format changed from tournament to solver speed competition.

=Selected Publications=
 * Nobuhisa Ueda, Tadaaki Nagao (1996). NP-completeness results for NONOGRAM via Parsimonious Reductions
 * Joost Batenburg, Walter Kosters (2009). Solving Nonograms by combining relaxations. Pattern Recognition, Vol. 42, No. 8
 * Shi-Jim Yen, Shi-Yuan Chiu, Cheng-Wei Chou, Jr-Chang Chen (2011). Cpuzzler wins Nonogram Tournament. ICGA Journal, Vol. 34, No. 1 » 15th Computer Olympiad
 * Der-Johng Sun, Kuang-che Wu, I-Chen Wu, Shi-Jim Yen, Kuo-Yuan Kao (2012). Nonogram Tournaments in TAAI 2011. ICGA Journal, Vol. 35, No. 2 » TAAI 2011
 * Jan van Rijn (2012). Playing Games: The complexity of Klondike, Mahjong, Nonograms and Animal Chess. Master's thesis, Leiden Institute of Advanced Computer Science, pdf
 * Joost Batenburg, Walter Kosters (2012). Nonograms. LIACS - Leiden Institute of Advanced Computer Science, pdf
 * Joost Batenburg, Walter Kosters (2012). On the Difficulty of Nonograms. ICGA Journal, Vol. 35, No. 4
 * I-Chen Wu, Der-Johng Sun, Lung-Ping Chen, Kan-Yueh Chen, Ching-Hua Kuo, Hao-Hua Kang, Hung-Hsuan Lin (2013). An Efficient Approach to Solving Nonograms. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 5, No. 3
 * Lung-Pin Chen, Der-Johng Sun, Wen-Jie Tseng (2014). Nonogram Tournament in Olympiad Yokohama 2013. ICGA Journal, Vol 37, No. 1 » 17th Computer Olympiad
 * Lung-Pin Chen, Kuo-Chan Huang (2018). Solving Nonogram puzzles by using grouped based fully probing. CG 2018, ICGA Journal, Vol. 40, No. 4
 * Yan-Rong Guo, Kuo-Chan Huang, Jia-Jun Yeh, Wei-Chiao Huang (2018). Exploring effects of fully probing sequence on solving nonogram puzzles. CG 2018, ICGA Journal, Vol. 40, No. 4

=External Links=
 * Nonogram from Wikipedia
 * Survey of Paint-by-Number Puzzle Solvers
 * Nonogram — Turn your picture into a puzzle by Walter Kosters

=References=

Up one Level