Den 2. feb. 2010 kl. 19.26 skrev Jon Harrop <j...@ffconsultancy.com>:
On Tuesday 02 February 2010 16:10:05 Serguey Zefirov wrote:
Actually, your solution with arrays is the most often occured
solution
an imperative programmer will come with. It is simple but not
scalable
and not particularly fast.
What gave you that impression?
If I may butt in here: to get a scalable, fast Game of Life, you
should look into Hashlife (by Gosper?) as exemplified in the open
source application Golly. It gives an astonishing speedup, and it
would be interesting to see it expressed in Haskell.
Regards,
Arne D Halvorsen
--
Dr Jon Harrop, Flying Frog Consultancy Ltd.
http://www.ffconsultancy.com/?e
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
