Falling Diamonds solutions

Falling Diamonds was solved using Haskell by 15 contestants. Solution sizes: average 1990 bytes (shortest: 942; longest: 6109).

The list below is sorted by ranking. You can also sort by solution size.

210. download tos.lunar (S, L) (1067 B)
297. download kappahouse (S, L) (989 B)
309. download Sam.Eisenstat (S, L) (1318 B)
310. download falsifian (S, L) (1330 B)
334. download mjrosenb (S, L)		 442. download yairchu (S, L) (6109 B)
456. download yangjay (S, L) (2516 B)
715. download twanvl (S) (1800 B)
733. download Bulsa (S) (1141 B)
808. download thom.carver (S) (1471 B)		 821. download lemonidas (S) (3315 B)
837. download RaphaelJ (S) (1768 B)
876. download jmazon (S) (942 B)
913. download PositivaPatrik (S) (966 B)
940. download notogawa (S) (1012 B)