You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
36 lines
1.2 KiB
Markdown
36 lines
1.2 KiB
Markdown
17 hours ago
|
# Game of Life
|
||
|
|
|
||
|
|
Welcome to Game of Life on Exercism's Haskell Track.
|
||
|
|
If you need help running the tests or submitting your code, check out `HELP.md`.
|
||
|
|
|
||
|
|
## Introduction
|
||
|
|
|
||
|
|
[Conway's Game of Life][game-of-life] is a fascinating cellular automaton created by the British mathematician John Horton Conway in 1970.
|
||
|
|
|
||
|
|
The game consists of a two-dimensional grid of cells that can either be "alive" or "dead."
|
||
|
|
|
||
|
|
After each generation, the cells interact with their eight neighbors via a set of rules, which define the new generation.
|
||
|
|
|
||
|
|
[game-of-life]: https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
|
||
|
|
After each generation, the cells interact with their eight neighbors, which are cells adjacent horizontally, vertically, or diagonally.
|
||
|
|
|
||
|
|
The following rules are applied to each cell:
|
||
|
|
|
||
|
|
- Any live cell with two or three live neighbors lives on.
|
||
|
|
- Any dead cell with exactly three live neighbors becomes a live cell.
|
||
|
|
- All other cells die or stay dead.
|
||
|
|
|
||
|
|
Given a matrix of 1s and 0s (corresponding to live and dead cells), apply the rules to each cell, and return the next generation.
|
||
|
|
|
||
|
|
## Source
|
||
|
|
|
||
|
|
### Created by
|
||
|
|
|
||
|
|
- @tofische
|
||
|
|
|
||
|
|
### Based on
|
||
|
|
|
||
|
|
Wikipedia - https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life
|