Rule 30, Improved

• 2 - up
• 8 - down
• 5 - toggle
• 15 - leave pattern entry
• 14 - leave cellular automata
• The speed is based on the height of the cursor when the pattern entry is ended; a higher cursor is a faster speed.
• You may not make any modifications once the automata has started.

On 2019-08-18 I finished and documented an implementation of Rule 30 for CHIP-8, written with my Meta-Machine Code tool.  I didn't want to wait for the Octo Jam VI, but I purposefully left many optimizations and features out.

This program is a rewritten and improved implementation of Rule 30 I've written for the Octo Jam VI.  This is my first entry for this Octo Jam and I intend to submit more.  This program is 154 bytes.

I will have a documentation of this program available here: http://verisimilitudes.net/2019-10-05

If you would care to learn more of my development tool, you may do so here: http://verisimilitudes.net/2017-07-07

I believe I may have discovered some flaws in Octo when testing; I noticed in an earlier version that a column or row of the display would periodically fail to display and I believe this is due to my use of the 00FB instruction; this only occured with higher delays, however.  I've also had issues with the keys available from Octo, making them hard to press adequately; I changed the last byte of this program to fourteen purely so that leaving the cellular automata wouldn't re-enter the code before a new pattern could be entered.

I've left some inefficiencies purely so that the boundaries of the pattern could be modified by changing single bytes of the program.  In sum, this program would be much smaller if that were the only consideration I'd when writing it.