Conway's Game of Life in 140 bytes Ruby

Off the top of my head, some simple ways to make this shorter:

  * Use 0...s*s instead of 0..s*s-1
  * Use 0..s*s instead of 0...s*s (overrunning g doesn't matter much)
  * Use count{|x|x} instead of compact.count
  * Get rid of ||nil (because count{|x|x} ignores all falsy values)
  * Get rid of the brackets around g[i]&&n==2
  * Use [g[i-s-1,3],g[i-1],g[i+1],g[i+s-1,3]].flatten instead of [[g[i-s-1],g[i-s],g[i-s+1],g[i-1],g[i+1],g[i+s-1],g[i+s],g[i+s+1]]
  * Use -1..s*s instead of 0..s*s and substitute i+1 for i (i.e. g[i+1] instead of g[i], but [g[i-s,3],g[i],g[i+2],g[i+s,3]] instead of [g[i-s-1,3],g[i-1],g[i+1],g[i+s-1,3]])

And in APL:

life←{ ↑1 ⍵∨.^3 4=+/,¯1 0 1∘.⊖¯1 0 1∘.⌽⊂⍵ }

And in 131 characters of Perl: https://gist.github.com/1803656

What do I win?

It's all ASCII... If you're using octets for each character, you can definitely still squeeze a few bytes out of that.

Those interested in this post may like the examples on this page: http://codegolf.stackexchange.com/questions/3434/shortest-ga...

See also: http://willbailey.name/conway/docs/conway.html

None of these examples ran with 1.9.3 :\