Create a gist now

Instantly share code, notes, and snippets.

What would you like to do?
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