and it seemed to me like an interesting puzzle. The article is
interesting, but (IMHO) pretty flawed; don't be put off by how complex
he makes it seem :-).
Problem is simple:
given a rectangular grid of squares, each square has a color and the
task is to find the largest contiguous block of any single colour.
We'll keep the problem size moderate - up to 100x100 squares in the
grid, up to 8 colours. Any 2 squares are adjacent only if they share an
edge - i.e. corner touches don't count.
The input format is a file : each line is a row of the grid, each
character is a square within that row, and the value of the char
represents the colour of that square. (or simply generate the data
internally in the same format).