Omnimaga
Calculator Community => Other Calc-Related Projects and Ideas => TI Z80 => Topic started by: Xeda112358 on February 04, 2012, 04:17:34 pm
-
Stemming from my attempt in Grammer, I ported my automata generator to assembly. This version takes an input through Ans for the rule set (0 to 255) and modifies the graph screen accordingly. it starts at the top of the screen and makes its way to the bottom. Oh, and the program 114 bytes :)
EDIT: I added a picture of rule 57 because it looks so cool!
-
Yay more cellular automata! Ever thinking about making 2D cellular automata?
-
O.O What is 2D cellular automata?
-
The Game of Life (http://en.wikipedia.org/wiki/Conway's_Game_of_Life)
It follows the ruleset 3/23, but a customizable ruleset would be amazing :)
-
O.O What is 2D cellular automata?
2D automata are exactly like the 1D elementary automata you programmed, except the neighborhood of cells to be tested is 2 dimensional rather than 1 dimensional.
-
O.O Using the ruleset method I came up with, I would need to use a 256 bit input O.O I could definitely give it a try, but user input would be a bit more complicated >:D
-
No, not really. You'd just need the following things from the user:
How many cells have to be around the cell currently being checked to live to the next generation:
1 thru 8
How many cells have to be around the cell currently being checked to become alive:
1 thru 8
How many cells have to be around the cell currently being checked to die:
1 thru 8
-
haha, but if I do the 256-bit method, I can allow for some superior rulesets for mathematical study. However, making a Game of Life is interesting... I may be mistaken, but I believe a very good version of it is on TICalc (I think it was a MirageOS program).
-
Also, rule 165 is awesome. D:
-
That was in my top 6 favorites along with 57,99,105,129,161 :D
EDIT: Here is the Game of Life (http://www.ticalc.org/archives/files/fileinfo/397/39705.html) program on TICalc (by Tr1p1ea, too o.O)