programming – Wolfram 1

Posted on Updated on

CA ca; // An instance object to describe the Wolfram basic Cellular Automata

void setup() {
size(640, 360);
int[] ruleset = {0,1,0,1,1,0,1,0}; // An initial rule system
ca = new CA(ruleset); // Initialize CA
background(0);
}

void draw() {
ca.render(); // Draw the CA
ca.generate(); // Generate the next level

if (ca.finished()) { // If we’re done, clear the screen, pick a new ruleset and restart
background(0);
ca.randomize();
ca.restart();
}
}

void mousePressed() {
background(0);
ca.randomize();
ca.restart();
}

class CA {

int[] cells; // An array of 0s and 1s
int generation; // How many generations?
int scl; // How many pixels wide/high is each cell?

int[] rules; // An array to store the ruleset, for example {0,1,1,0,1,1,0,1}

CA(int[] r) {
rules = r;
scl = 1;
cells = new int[width/scl];
restart();
}

// Set the rules of the CA
void setRules(int[] r) {
rules = r;
}

// Make a random ruleset
void randomize() {
for (int i = 0; i < 8; i++) {
rules[i] = int(random(2));
}
}

// Reset to generation 0
void restart() {
for (int i = 0; i < cells.length; i++) {
cells[i] = 0;
}
cells[cells.length/2] = 1; // We arbitrarily start with just the middle cell having a state of "1"
generation = 0;
}

// The process of creating the new generation
void generate() {
// First we create an empty array for the new values
int[] nextgen = new int[cells.length];
// For every spot, determine new state by examing current state, and neighbor states
// Ignore edges that only have one neighor
for (int i = 1; i < cells.length-1; i++) {
int left = cells[i-1]; // Left neighbor state
int me = cells[i]; // Current state
int right = cells[i+1]; // Right neighbor state
nextgen[i] = executeRules(left,me,right); // Compute next generation state based on ruleset
}
// Copy the array into current value
for (int i = 1; i < cells.length-1; i++) {
cells[i] = nextgen[i];
}
//cells = (int[]) nextgen.clone();
generation++;
}

// This is the easy part, just draw the cells, fill 255 for '1', fill 0 for '0'
void render() {
for (int i = 0; i height/scl) {
return true;
} else {
return false;
}
}
}

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s