I made a program that renders all the rules of cellular automata (Rules 0 - 255) and it's extremely slow but it works. Perhaps people with ideas for optimization can post below but here's the code:


Code:




Rule 126:


Rule 110 (My favorite )


There are no spritesheets for this program so if you want to test it then you can use that code. Any optimizations are welcomed and Thanks in advance for those who reply! [/img]

Does this code display one pixel per cell? If so, could you use Pxl-On() instead of real(? (Which is faster?)

I don't have a CSE, so about how long does this code take to render an entire screen?

EDIT: Here's my completed code (coordinates are for monochrome calcs). It works now.

Code:

Nothing really massive but just noticed you used the rectangle command in xlibc to set the background to white, but there is already a command for that:

Code:

Which is shorter so you might wanna use that instead, besides that, you could use the newline char to display the text (You used it once for the word "RENDERER", but you could use it again for the Enter like this

Code:

You usually don't need to put the update LCD if its 0
Maybe a little Delvar where you're storing 0 to A
And you don't need the multiplication symbols, or the parenthesis because of the order of operations (the multiplications will come before the additions without the use of the parenthesis) so these

Code:

could be

Code:

I forgot to submit this post when I wrote it two days ago, but I figure it's still useful. Maybe.


Code:

The While loop here will terminate only if R is less than 0 or greater than 255, which I assume isn't what you want. Also, if the user previously set R to a value outside that range, the interpreter will skip right past the loop.
And what's up with writing 0-1 instead of ~1?

Code:

The colon in the Input string is just there because I think it looks weird without a separator of some sort. It doesn't actually contribute to the program :p


Code:

Piecewise expressions are your friend:
Code:
but R/2!=int(R/2 is equivalent to 0 or fPart(R/2 [0 or converts it to a boolean] remainder(R,2, so
Code:



Code:

I don't think the Output( calls are necessary... anyway, isn't this just converting the rule to binary? If so, you can use int(2fPart(R2^seq(X,X,~8,~1 (adapted from something by Weregoose).


Code:

The InvertPixel command does the same thing -
Code:


Lastly, it looks like you're storing the pixel values to |LLINE and |LLINE2? It would be easier to test the values of the pixels with real(7,1,X,Y.

Here's my attempt at writing one (obsolete now that lirtosiast's posted his, I guess) -

Code:

Thanks for all the optimizations everybody. I don't quite understand ALL of them but I'll look into them when I have time. It seems that you have reduced my program to almost half its size which I find both impressive and kind of sad that I am such an inefficient programmer... well, still learning. I'll probably be uploading an update to the archives if my program ever got accepted in the first place.

Please ask about the ones you don't understand. If we provide optimizations that you don't understand, it won't help you make those same optimizations in your future programs. Yep! It has taken years for most of us to get to our respective levels of proficiency. Please be patient; your program was uploaded only 28 hours ago, and we claim programs can take 1 minute to 1 week to be moderated. In the future, you're more than welcome to upload an update for a program before the first version is accepted; we'll simply reject the older version(s).