Category Archives: Processing

Conway’s Game of Life using Processing 3.0 Video

Wikipedia links to information about Conway’s Game of Life, and Moore neighborhood

greengrassgrowingfuckin aday 3

Conway’s Game of Life demands the following rules:

  • Any live cell with fewer than two live neighbours dies, as if caused by under-population.
  • Any live cell with two or three live neighbours lives on to the next generation.
  • Any live cell with more than three live neighbours dies, as if by over-population.
  • Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.

See if you can find all the fan favorite characters such as; the all seeing eye, the plus sign blinker, and/or the Glider spaceship.
eyeballbc

Continue reading

Black Jellyfish

This video was made using Processing (Programming Language). It’s essentially about 1,000 differently colored lines traveling randomly, 1 pixel at a time. There is a condition that if a line is headed in the direction of a black color, it turns around and heads in the opposite direction. Some of the lines themselves are black, which created the “jellyfish”. The code written is a minor variation of Attack on Grayscale.
Camtasia was used for video editing, and the clips were sped up 700% to 4,000% of the original speed.
black_jellyfish

icy hot gaussian dance

Silly project using processing 3.0. It’s essentially the same as my previous one(snakes maze) but with more colors.

Rules

  • snake/snake interactions overlap, nothing happens.
  • snake/wall interaction = if a snake is headed in the direction of a wall, it turns around and heads in the opposite direction.

thedance
Full screen it! (WARNING: I’ve received a multitude of negative reviews about the music chosen. Also, note that youtube and vimeo compression does not look like the original, especially when smaller snake widths are chosen.) The video is sped up ~400%.

update
Someone asked me how long it would take 1 snake to travel to the other snake color group’s starting point. So I ran the experiment and responded with:

It took my computer approximately ~27 minutes for one snake to reach the other color group’s starting point. Here’s a picture:
redvsvlue

You can see a snake from the red group infiltrated blue’s base. Blue group almost won, got really close, but turned around last minute and lost interest in the objective.

I was thinking, perhaps this could be turned into some sort of high stakes casino game.

Patrons would place bets on either side, and the casino would take a rake from the total pot. Each “red vs. blue” event would be displayed on a huge monitor in a palatial area. The color groups could also be adjusted to match the theme/scheme palette of the casino.

It would be interesting to see a group of people, gathered around, financially invested, yelling angerly at some randomized color generation.

2 hours+
2 hours

All I need is 1 giant flat screen TV, some sort of cheap dell server, a gambling licence, a marble stone coliseum structure, and electricity,to make my vision a reality.

Continue reading