Skip to main content

WireWorld - 0.3

Wireworld Cellular Automata Implementation

Zadok Regex
Wireworld is a cellular automata that has been proven to be Turing complete and has been used to make a computer that calculates primes. I have used this automata for a while now and have been thinking about making a puzzle game based around it. The premise is you have to complete parts of a circuit to make it work and advance to the next level. This is the first step toward the game, an implementation of the core rules.


this time run now we have zoom, even more efficient rule execution and custom colours ( edit self.colour1 in to change :D )


Home Page


WireWorld 0.2 — 10 Jun, 2010

WireWorld 0.3 — 14 Jul, 2010

WireWorld 0.1 — 1 Jun, 2010 account Comments