There is a nonogram puzzle game for the kindle fire that I like to play.  While I was reading about #P complete on wikipedia I somehow got to 2SAT problems and saw that nonogram’s can be formed as 2SAT problem so as to solve in polynomial time (at least when the heuristics work).  Otherwise the problem is in NP.