A C++ implementation for solving the nonogram constraint satisfication problem. Among a few naive ones, the dynamic programming algorithm discussed in K. J. Batenburg , W. A. Kosters Solving Nonograms by combining relaxations - is implemented.
Switch branches/tags
Nothing to show
Clone or download
Latest commit 689fdc0 Apr 12, 2017

README.md

File format

Build Status

The input is a text file. The first line contains the number of columns (C) and rows (R), separated with space. The next C lines contain the description of the columns of the puzzle: the length of block separated with a space. Finally, the last R lines contain the description of the rows in a format similar to the columns.

Output

Text output on stdout.

PNG files of C x R pixels.