View Code? Open in Web Editor NEW

Conway's Game of Life in as many languages as I know.

PowerShell 1.76% Python 11.65% C++ 19.89% CMake 2.01% Java 22.40% JavaScript 13.54% Racket 13.86% Shell 0.87% Haskell 14.02%

conways-game-of-langs's Introduction

Conway's Game of Langs

Conway's Game of Life in as many languages as I know.

Structure

Each folder in this repository contains a standardized implementation of Conway's Game of Life in the corresponding langauge. This implementation

takes as input on the command line
- one positive integer for the square's board size,
- one integer for the number of timesteps to simulate,
- and one string filepath for the file containing the game's initial state (the contents of which must match the regex ^(\d+\s\d+(\r\n|\r|\n))+$, where
  - \d is any digit from 0 through 9,
  - \s is a single space,
  - \r is the carraige return character,
  - \n is the newline character,
  - + means "one or more of",
  - | means "either one of",
  - ^ indicates the start of the string,
  - $ indicates the end of the string, and
  - () indicate a capture group)
and outputs
- one PBM P1 (i.e. greyscale, ASCII; see https://en.wikipedia.org/wiki/Netpbm#PBM_example) image for each timestep, representing the state of the board at that timestep.

Each output image is then converted to JPEG and scaled up 200x with ImageMagick, then stiched into a video with ffmpeg.

Note: The algoritm is naive; do not expect to be able to calculate quadrillions of timesteps.

Follow the instructions in the README.md of the language you wish to use.

Follow the instructions in the README.md of the language you wish to use.
Depending on your operating system, run the following command from within the directory the images were generated:
- Windows: make_video.ps1 .

The final video out.mp4 will be generated in this directory. Enjoy!