In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes tire 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.
|Title of host publication||Lecture Notes in Computer Science|
|Editors||LS Lopes, N Lau, P Mariano, L Rocha|
|Publication status||Published - 1 Jan 2009|
|Event||14th Portuguese Conference on Artificial Intelligence (EPIA 2009) - |
Duration: 1 Jan 2009 → …
|Conference||14th Portuguese Conference on Artificial Intelligence (EPIA 2009)|
|Period||1/01/09 → …|