The goal of the project is to create an n-dimensional simulation of the well-known Conways Game of life(GoL). With this simulation it will be tested, which rules do apply good for a specific rule combination. Based on the evaluation of the applied rules on different dimensions, we try generalization methods for possible good rules. The simulation should be fast enough to simulate some rules up to 10th dimension.
The simulation should support testing with multiple rulsets. The ruleset is furthermore based on the definition of Carter Bays publication “Candidates for the Game of Life in Three Dimensions”. The GoL describes, if a cell is alive or dead and a ruleset of the cells, if a position on the gameboard is a living cell or dead cell in the next round of calculation. - Cellular Automata -
For finding shapes tha "hard way" by an optimized brute force search across different configurations and state, a Java application was developed.
It supports different Configurations for a rule-set. Natively Conways Configuration.
The following condigufations are supported:
- N-dimentional calculus of the ruleset for Conways
- Simple GUI for displaying the n-dim process
- ShapesDetector for finding stable shapes in n-th dimension using graph isomorphisms to avoid distingulishing rotated states