Rockingcool
/
Game-of-Life-Exercism
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
My Haskell implementation of the 'Game of Life' problem in Exercism.
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.
1 Commit
1 Branch
0 Tags
31 KiB
Haskell 100%
 
master
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'master'
${ noResults }
Go to file
Aadhavan Srinivasan 2c99555ed7 First commit 9 hours ago
src First commit 9 hours ago
test First commit 9 hours ago
HELP.md First commit 9 hours ago
README.md First commit 9 hours ago
game-of-life.cabal First commit 9 hours ago
package.yaml First commit 9 hours ago
stack.yaml First commit 9 hours ago
stack.yaml.lock First commit 9 hours ago

README.md

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 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.

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