This repository contains all the code made during the optative course of Complex systems at IPN - ESCOM, these programs were made entirely on Java and JavaFX. These are Netbeans proyects with JavaFX elements, if you have any problems opening them check the JavaFX documentation for Netbeans, in the Non-modular with Maven section.
This program generates all 255 rules of the elementary cellular automaton, the initial array can be generated randomly, by typing it into the console or by reading a plain text archive.
This is program is capable of displaying all the "life-like" rules for a 2D cellular automaton, including Conway's Game of Life. Other characteristics include:
- Pause or continue the evolution using keyboard and mouse.
- Increase or decrease the speed of the evolutions, with a maximum of 60 frames per second, using keyboard or mouse.
- Edit the evolutions space in execution time by using the mouse.
- It supports a space of evolutions of up to 1000x1000.
- Three initial configuration modes: Empty, random, random space with probability up to 0.001.
- Accepts various scale factors for the visualization of very large or very small spaces.
- P: Pauses the evolution
- C: Continues the evolution
- +/-: Increases/Decreases the speed pf the evolution
- Click : Toggles a square in the evolutionary space (it is recommended to pause the game before editing)
This is variaton of the BML traffic model, adding one degree of freedom to the model. In this implementation cars can turn right (if they move from left to right) or to the left (if they move from top to bottom) under a given probability, which in this case was 10%. It includes the same features and controls from the Game of Life implementation.
This program generates the attractors for both 1D and 2D automatons, it creates a Wolfram Mathematica file with all the vertices and edges of the graph according to the rule and the space size, it also calculates if the attractor has any equivalences.
