Strange , cuz it says "Updated", not "Added". Maybe ticalc thought you meant this as an update and merged both Axe versions and it resetted the count

Oh well, hopefully if it remains updated regulary, it may eventually convince them to feature it. I think if people here starts releasing their Axe game on ticalc.org too it might help. In my case I am waiting until Monday to see if I re-add Illusiat, ROL and Reuben series, Zelda DLQ, XXR and Metroid II Expansion at ticalc. Since a recent event, I was not sure yet about re-adding my files, but if this event never involves more than one or two person, I'll re-add them (they were initially removed after a major peak of such event involving a dozen of people).

I finally finished rewriting the entire math engine.  The code was getting way too messy and especially with the addition of signed and unsigned versions of math operations.  It was making it way too complicated to optimize the code.  The parser code is now a lot more organized, smaller, faster, and uses fewer variables.  In addition, nearly all of my example programs became a few bytes smaller from my increased auto-opt list.  In my game of life example, it actually shrunk by 9 bytes (1.3% reduction) without changing any code, simply by compiling with the newer version!  Everyone will most likely see small drops in the executable sizes.  These aren't the big optimizations though.  Those will eventually come when I get to look-ahead parsing.

I'm going to focus on some new commands now.  I might have it ready by late tonight, but I'm not sure.  Don't expect too many new things, I spent most of my time swatting bugs and cleaning the code so that future versions will be easier to write.

I finally finished rewriting the entire math engine.  The code was getting way too messy and especially with the addition of signed and unsigned versions of math operations.  It was making it way too complicated to optimize the code.  The parser code is now a lot more organized, smaller, faster, and uses fewer variables.  In addition, nearly all of my example programs became a few bytes smaller from my increased auto-opt list.  In my game of life example, it actually shrunk by 9 bytes (1.3% reduction) without changing any code, simply by compiling with the newer version!  Everyone will most likely see small drops in the executable sizes.  These aren't the big optimizations though.  Those will eventually come when I get to look-ahead parsing.

I'm going to focus on some new commands now.  I might have it ready by late tonight, but I'm not sure.  Don't expect too many new things, I spent most of my time swatting bugs and cleaning the code so that future versions will be easier to write.

cool! Glad to hear!

Do you think tile exporting (from pics) will be ready soon?

@Raylin: yeah same here. I asked Quigibo in the Axe Pages topic and he replied the following:

http://ourl.ca/4573/88037

Quote from: Quigibo on May 02, 2010, 07:24:32 pm

I'm going to focus on some new commands now.

Bit getting/setting?

I,m confused at what you mean, could you clarify

True, and sometimes in some games, the score or numbers won't need to be exactly how you desire. For example, if you want max damage to be rand/1024+LV*30 (just an example), why not use *32 instead? In some cases it's not possible, though.

Also for scores, if your game is set so you get 100 points multiples, why not have it so you get one point instead then add the two additional zeros manually? (doing that might actually increase file size, though, in some cases, but it will be easier to work around the 65536 range.

Can't wait for next version of Axe ^^

Also could you awnser my question regarding tile exporting from pics?

YAY! Finally, the wait was worth it IMHO

Glad to see all that stuff in now

Good job

I will probably update my calc later after I finished compiling the screenshots for the video later

Thanks a lot for this btw

The "Fix CODE" commands are Asm flags.  I only have 3 controllable flags right now, but I can always add more.  bcalls are way too low level since they often require registers for input, so you will have to do those with Asm(EFxxxx) where xxxx is the hex code (little endian).

EDIT:
MAJOR MINOR REVISION COMING SOON

I'm announcing this before the next version becasue there is going to be a very big change to how a lot of the commands work and I want to let everyone know if they need to modify their code to accommodate the change.  Let me first explain my reasoning:

Lets say you wrote "If A=5" (assume that A is 5 at this point).  What happens, is first, A is compared to 5.  If they are equal, it returns 1.  Then, it checks to see if the expressions is true, that is to say, that it is not zero.  So it checks if 1 = 0 which it is not, so it will execute the If block.  Now you might see a redundancy here.  A has to be compared to 5 and then the result has to be compared to 0.

EDIT:
I found out that I can not do this, its already pretty efficient here.  However, I do realize that 99% of the time, the logical "and" "or" and "xor" commands are used as Boolean "xor" "or" and "and".  Therefore, I will change them to this (3 bytes less).

Commands this will affect:
If
ReturnIf
While
Repeat
or
and
xor

What you have to change:

EDIT:
Nothing.  The only time you would ever have to modify your code is if you were using the "and" "or" or "xor" commands as low level byte operations instead of logical operations.  If you still need to do bit logic, I will be adding new commands for that.