Jeremy Rayner on java and other stuff.

All | AudioDrama | Chatter | Fun | Groovy | Java | Life

Posted on 14 Sep 2005
The object of the puzzle is to figure out which of the squares should be coloured in to make up a picture, which is the solution to the puzzle.
print out and solve this puzzle
  here is a more difficult one
  • Numbers by each row or column form a 'clue'
  • Each clue tells you how many solid blocks there are on that column or row, how big they are, and in what order they appear
  • There must be at least one gap between two blocks
For example: A clue of "3,1" tells you there is a block of 3 consecutive solid squares on this row, and to the right of it is a single block of 1 solid square.
[more info]
Nonograms (a.k.a. Griddlers) in their current form, have a history going back about 20 years.

The theory behind these puzzles can get quite involved, and provides an interesting exercise in programming. Steven Simpson has provided some interesting nonogram solvers

There are also some interesting variants on this puzzle too.

More nonograms to play with are here, here and here.

update: Here is a nice tutorial on how to solve these puzzles.

14 Sep 2005 |


September 2005
        1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30
Prev | Today | Next

rss:subscribe (All)

What I'm reading
my feed aggregator ->box

My websites
London Java Meetups
Programming Projects
Elite in Java
Jez's Photos
Fantasy Stock Market
Cool Saxophonist
Doctor Who Audios
Pisces Audios

Other Blogs
Mike Cannon-Brookes
James Strachan
Joe Walnes
Sam Dalton
Simon Brown
Cameron Purdy
Mike Roberts
Erik C. Thauvin
John Martin
Manfred Riem

B5 d++ t++ k s+ u- f
i+ o+ x-- e+ l- c--

powered by blogmento