Conway's Game of Life in PuzzleScript

[Scott Hughes]

Here is Conway's Game of Life implemented in PuzzleScript:

http://www.puzzlescript.net/play.html?p=6921815

I had a discussion with a friend tonight about what games (if any) were impossible to make in PuzzleScript, and we concluded that nothing is technically impossible (provided it fits into the tile-based arrow-keys-and-X-button format), although plenty of games would require unreasonable amounts of rules and/or objects. This is really just another way of saying PuzzleScript is Turing complete, as is shown by the fact that it can represent the Game of Life.

And oh yeah, since the Game of Life is Turing complete, it can obviously be implemented within itself:

http://www.youtube.com/watch?v=xP5-iIeKXE8

[Scott Anderson]

This is cool.  I was casually working on an implementation but you beat me to it :). The adder solution is pretty clever.

[ff68...@gmail.com]

I also made a Game of Life. Your implementation has 50 rules, mine has 13364. :)
http://www.puzzlescript.net/editor.html?hack=6903053

An advantage would be that you can draw in my implementation.

[Scott Hughes]

On Sunday, October 13, 2013 1:42:56 AM UTC+11, ff68...@gmail.com wrote:

Your implementation has 50 rules, mine has 13364. :)

Wow, I'm surprised the compiler can even generate that many instructions from so few rules!

I like your use of bitmasks to do the counting, very clever. Yay, gliders. :)

[abrobecker]

Thanks for this one!
I knew Puzzlescript zas turing complete! You proved it! :D