From Chessprogramming wiki
Jump to: navigation, search

Home * Games * Nonogram

A Nonogram puzzle [1]

a logic puzzle in which cells in a grid must be painted according to the given row clues and column clues. Players are requested to paint each grid cell into either “white” or “black”, such that the segments constituting of consecutive black cells in each row or column matches the corresponding row clue and column clue. The clues or numbers are a form of discrete tomography that measures how many unbroken lines of filled-in squares there are in any given row or column. Solving nonogram puzzles is a NP-complete problem [2] .


Computer Olympiad, TAAI, and TCGA hold Nonogram competitions since 2010.

Date Event Champion
2010 15th Computer Olympiad Cpuzzler
2011/06 TCGA 2011 Naughty

Since 2011, the competition format changed from tournament to solver speed competition.

Date Event Champion Time to solve 1000
random puzzles (secs)
2011/11 TAAI 2011 LalaFrogKK 645.544
2012/06 TCGA 2012 LalaFrogKK 1433
2013/08 17th Computer Olympiad LalaFrogKK 22.56 (?)
2014/06 TCGA 2014 LalaFrogKK n/a
2014/11 TAAI 2014 LalaFrogKK 664
2015/05 TCGA 2015 LalaFrogKK 908

Selected Publications

External Links


  1. Lung-Pin Chen, Der-Johng Sun, Wen-Jie Tseng (2014). Nonogram Tournament in Olympiad Yokohama 2013. ICGA Journal, Vol 37, No. 1
  2. Nonogram from Wikipedia

Up one Level