On the Difficulty of Nonograms

Kees Joost Batenburg, Walter A. Kosters · ICGA Journal · 2012

Nonograms are a popular type of logic puzzles, where a pixel grid has to be filled with black and white pixels, based on a description that indicates the lengths of the consecutive black segments for each row and column. While the Nonograms that can

Read the paper · More papers on PaperTik