Abstract
In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes the one used by Robert A. Bosch which was developed for black and white nonograms only, thus providing a universal solution for solving nonograms using ILP. Additionally we apply a known algorithm to find all solutions to a puzzle. This algorithm uses a binary cut to exclude already known solutions. Finally we compare the performance of our approach in solving colored nonograms against other approaches, namely the iterative and the brute-force ones, pointing to a research direction of developing a hybrid method combining the iterative approach with ILP.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bosch, R.A.: Painting by Numbers. Optima 65, 16–17 (2001)
Tsai, J.-F., Lin, M.-H., Hu, Y.-C.: Finding multiple solutions to general integer linear programs. European Journal of Operational Research 184(2), 802–809 (2008)
Balas, E., Jeroslow, R.: Canonical Cuts on the unit hypercube. SIAM Journal of Applied Mathematics 23(1), 61–69 (1972)
Nonogram, http://en.wikipedia.org/wiki/Nonogram
Simpson, S.: Nonogram Solver, http://www.comp.lancs.ac.uk/~ss/nonogram/
Simpson, S.: Nonogram Solver - Solvers on the Web, http://www.comp.lancs.ac.uk/~ss/nonogram/list-solvers
Wolter, J.: Survey of Paint-by-Number Puzzle Solvers, http://webpbn.com/survey/
Wolter, J.: The ’pbnsolve’ Paint-by-Number Puzzle Solver, http://webpbn.com/pbnsolve.html
Hett, W.: P99: Ninety-Nine Prolog Problems, https://prof.ti.bfh.ch/hew1/informatik3/prolog/p-99/
Olšák, M., Olšák, P.: Griddlers solver, nonogram solver, http://www.olsak.net/grid.html#English
Griddlers Net, http://www.griddlers.net/
Corbin, A.: Ali Corbin’s Home Page, http://www.blindchicken.com/~ali/
Grainger, B.: Pencil Puzzles and Sudoku, http://www.icpug.org.uk/national/features/050424fe.htm
The ECLiPSe Constraint Programming System, http://www.eclipse-clp.org/
SCIP: Solving Constraint Integer Programs, http://scip.zib.de/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mingote, L., Azevedo, F. (2009). Colored Nonograms: An Integer Linear Programming Approach. In: Lopes, L.S., Lau, N., Mariano, P., Rocha, L.M. (eds) Progress in Artificial Intelligence. EPIA 2009. Lecture Notes in Computer Science(), vol 5816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04686-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-04686-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04685-8
Online ISBN: 978-3-642-04686-5
eBook Packages: Computer ScienceComputer Science (R0)