Skip to content

Instantly share code, notes, and snippets.

@JayBazuzi
Created March 9, 2014 21:23
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save JayBazuzi/9454787 to your computer and use it in GitHub Desktop.
Save JayBazuzi/9454787 to your computer and use it in GitHub Desktop.
Feature: Standard rules of Conway's Game of Life
Background:
Given Standard Conway's Game of Life Rules
Scenario Outline: A live cell
Given There are <neighborCount> live neighbors of a living cell
When the timer ticks
Then the cell will be <result>
Examples:
| neighborCount | result |
| 0 | dead |
| 1 | dead |
| 2 | alive |
| 3 | alive |
| 4 | dead |
| 8 | dead |
Scenario Outline: A dead cell
Given There are <neighborCount> live neighbors of a dead cell
When the timer ticks
Then the cell will be <result>
Examples:
| neighborCount | result |
| 0 | dead |
| 1 | dead |
| 2 | dead |
| 3 | alive |
| 4 | dead |
| 8 | dead |
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment