[Haskell-cafe] Project Euler: request for comments

[Daniel Fischer]

On Monday 29 August 2011, 00:56:52, KC wrote:
> I just noticed that the 20x20 grid has some "00" entries; thus, time
> could be saved by not touching any of the grid entries 3 cells away.
> Same for the "01" entries.
> 
> The challenge, of course, is in finding these entries in the first
> place. :)

Multiplication is cheap, looking for zeros (or ones) would take much more 
time than the multiplications one could avoid, so it'd be a net loss (it 
could become a gain if longer sequences were to be considered; depends on 
the proportion of zeros in the grid and the length).