Use this thread to suggest new features or improvements, and show support for any current suggestions. To seed discussion, here are some potential features/improvements I've brainstormed, but I don't know if there's enough interest to warrant implementing them: Steam Workshop support (note: I actually don't know much about Steam Workshop, so feel free to make more specific recommendations) Translate into other languages Make the game open source Add a solitaire card gam...

If you tried this game out and didn't like it, please take a moment to let me know what you didn't like. Any and all feedback is appreciated! Was the game different from what you were expecting? Was there not enough introductory information to help you understand what to do? Is subleq just painful? Did you not like the design? Something else? Thanks in advance for your time!...

I've seen that there's no plans for adding Linux support yet. This thread is a collective call for action. If you are a Linux user, comment this thread, so developer consider adding it. My experience: the game shows black screen. (Arch, proton-ge/proton-experimental(beta))...

I am doing first Stack Push Stack Pop assignment, and thinking about erasing the values to 0 when reading, but I can not figure out how to reference the value of Member and minus it from itself. Is it possible at all ? or I just need to relay on memory and always increasing the Stack ? hope I wrote understandable...

It took me a while to understand how memory calculation works, but I get it: just number of memory addresses "touched". The initial solution is indeed 8 cycles (3 read/write pairs + 2 loops) and 12 bytes (3 commands + @in + @out + @tmp). And it's trivial to get the 8c/11b solution. So the fastest solution is indeed 6 cycles: 6 instructions, 3 bytes each, plus touching @IN and @OUT => 6 cycles, 20 bytes. But how exactly the shortest solution with only 9 bytes is possible? It would stil...