A generalization of continuous-valued cellular automata
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
cimg
docs/images
glfw-3.1.1
screenshots
shaders
source
.gitignore
LICENSE
Makefile
README.md

README.md

ConvolvingAutomaton

screenshot

About

This project is a fast GPU implementation of "Generalization of Conway's "Game of Life" to a continuous domain, Rafler 2011".

It is the fastest implementation of SmoothLife to date thanks to the parallel FFT shader inspired by GPU FFT, J.R. Frisvad 2009.

For more info about using or contributing, check the FAQ!

See also: http://sourceforge.net/projects/smoothlife/

Motivation

The end goal of this project is to automate the search for cellular automata with certain properties. (i.e. symmetries, property conservation, gliders, self-replication...)

Project Outline:

  • Provide a fast, GPU-accelerated implementation of the SmoothLife algorithm in 2D.
  • Generalize the algorithm to support any number of dimensions and neighborhood kernels.
  • Support for arbitrary update functions.
  • Output results to a classification framework, for automated searching of the parameter space.

Quickstart

Requirements

  • Mac OSX with developer tools installed

In Terminal:

make
./convolving_automaton

If it doesn't compile, you may have to rebuild glfw for your system.