-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
The three rules of Ruby Q.:
-
Please do not post any solutions or spoiler discussion for this
quiz until 48 hours have elapsed from the time this message was
sent. -
Support Ruby Q. by submitting ideas and responses
as often as you can! Visit: http://rubyquiz.strd6.com -
Enjoy!
Suggestion: A [QUIZ] in the subject of emails about the problem
helps everyone on Ruby T. follow the discussion. Please reply to
the original quiz message, if you can.
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
Game of Life (#193)
This weeks quiz is to produce an implementation of Conway’s Game of
Life. The Game of Life is a cellular automaton with simple rules:
- Any live cell with fewer than two live neighbours dies, as if by
needs caused by underpopulation. - Any live cell with more than three live neighbours dies, as if
by overcrowding. - Any live cell with two or three live neighbours lives,
unchanged, to the next generation. - Any dead cell with exactly three live neighbours becomes a live
cell.
It is amazing to see the patterns that can emerge from seemingly
innocuous configurations and a testament to the fact that you don’t
need complex rules to generate complex behavior.
If you are new to Ruby then this is a great problem to practice on. It
also offers a good opportunity to become acquainted with some features
of 1.9.1.
Have Fun!