(i think) I made a Conway's Game of Life in GEM/Pd.

The game is rendered on a 16X16 pix_set grid and mapped to a square. The game is 'played' inside of a 256-point array, and "folded" to create a 16X16 buffer.

Please check it out and tell me if you think it obeys Conway's rules?

http://en.wikipedia.org/wiki/Conway's_Game_of_Life

http://www.pdpatchrepo.info/hurleur/conway.pd

Argh. I can't understand.

Surely you know if your algorithm stuck to the rules?

but at a guess it's not correct because the shape's outcome is different from drawn horizontally or vertically

why not use fragment shaders and http://gpgpu.org/ techniques? it's much much much faster in my experience (both coding time and runtime efficiency).

and it's been done already!

/usr/lib/pd/doc/Gem/10.glsl/04.game_of_life.pd

caveat: i haven't tried your patch, but given a similar 256x256 fragment shader iteration generally runs at around 450fps here, it would almost certainly be faster to use pix_snap with pix_data (in raw OpenGL i'd use glCopyTexImage if i remember the name correctly, but I don't know if there's Gem support for that) if you want to extract the data and do other things with it.

Hey Claudmax, thanks for chiming in.

I had noticed that version of the game, as well as the gridflow version. Problem is, I'm doing stuff with iterated polys(thanks for the tutorial). I want to use the game as a "behavior" for a matrix of polygons.