Kan-Yueh Chen

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A nonogram puzzle is played on a rectangular grid of pixels with clues given in the form of row and column constraints. The aim of solving a nonogram puzzle, an NP-complete problem, is to paint all the pixels of the grid in black and white while satisfying these constraints. This paper proposes an efficient approach to solving nonogram puzzles. We propose a(More)
  • 1