Nice!  Although you don't need all those parenthesis since order of operations is still just left to right:
:B+D->B<D+A+C->A
:A-C-(B-D->B>=-D)->A
Won't make a difference in the compiled code, but saves some memory in the source.

I think I will probably start coding this by using the conventional BASIC operation syntax because I still can't memorize the weird Axe syntax so it's gonna take me a while to get used to when coding

You could always create your code the conventional BASIC way and then post it here and someone can convert it to "Axe friendly syntax" if you want.

I optimized even more now
:'This does AB+CD->AB
:B>(+D->B)+A+C->A

Wow nice!

That's actually 1 byte less optimized. Try it.

That's because the parenthesis require a push and pop (2 bytes), and the "greater than" and "less than or equal to" operators take 2 more bytes than the other comparisons.  So you saved 3 bytes but then added 4.

You could have done this:

Code: [Select]

:B>=(+D->B-1)+A+C->ABut then its the same size as your first attempt.  Not sure if the speed is faster or slower though.

Well, my logic was that it did one less variable access than before.

I'm not familiar with Axe, so I'm just guessing when I make these modifications.

Lbl S
->Ans^16->A
A^4/16->B
A-2(A-8)(T=1 Or T=3
Ans-Ans^3/600-2(T>1->A
Return

Ans is always implied as the last computation every new line so its not really needed.  Storing it to a temporary variable is what "Ans" would do anyway, so just pick a variable and pretend that its "Ans".


I'm a little bit confused why you store to B and never use it and then reference T but don't declare it.  I'll assume thats a typo and are meant to both be the same variable.

Here are some optimizations:
Lbl S
->A^64/16->B
A^16->A
If B^2          ;Says "If B is odd"
16-A->A
End
A-(A*A*A/600)->A
If B/2^2        ;Checks 2nd bit
-A->A
End
A
ReturnThis should now work at ANY value of A, but I guess it is still just one term of the Maclaurin so estimates will be off...

EDIT: oops, fixed.