diff options
| author | elioat <{ID}+{username}@users.noreply.github.com> | 2024-06-20 14:10:40 -0400 |
|---|---|---|
| committer | elioat <{ID}+{username}@users.noreply.github.com> | 2024-06-20 14:10:40 -0400 |
| commit | f59bcfbea9ae93d945c0ef3dcbf2bb5b184fc0a3 (patch) | |
| tree | 71edac756cd098d9671fe684c7895fefbcf486b2 | |
| parent | 3ddca8731f61d224784f5a64bfc639d10a29944e (diff) | |
| download | tour-f59bcfbea9ae93d945c0ef3dcbf2bb5b184fc0a3.tar.gz | |
*
| -rw-r--r-- | life.txt | 8 |
1 files changed, 8 insertions, 0 deletions
diff --git a/life.txt b/life.txt index 0428310..f0791e4 100644 --- a/life.txt +++ b/life.txt @@ -14,4 +14,12 @@ I like to implement Conway's Game of Life. Here are some notes on my general app - Any cell with more than 3 live neighbor dies - Any dead cell with 3 neighbors becomes a living cell +## Implementation + +- Define the world as a 2d grid, typically an array +- Function to dislay the grid +- Function to count living neighbors +- Function to apply the rules of life to each cell +- Function to bundle everything together, this takes in the initial state as well as the number of generations to run + |