That's a cleaver trick!  But wouldn't something like this be simpler?

or a
sbc hl,de
add hl,de
jr nc,$+3
ex de,hl

But I'm trying to convert all of my math commands to signed operations anyway, so I would need to tweak it a bit.

Ah, I didn't think of that. Here's a good way to do signed comparison by the way:
or a
sbc hl,de
ld a,h
rla
jp po,$+4
ccf
It should give the same flag outputs you would expect from an unsigned compare (note that rla does not modify the Z or P/V flags)

Edit:
Now I came up with one that can restore the original value of HL without destroying the C flag in the process:
or a
sbc hl,de
ld a,h
jp po,$+4
cpl
add hl,de
rla

This?

Quote

'CHAR'   The expression becomes the ASCII value of the single character between the apostrophes. It can even be another apostrophe.

Yep, that would be it. Like, if you read a byte, B, from a string you can check to see if it is "A" by doing:
If B='A'instead of the more cryptic
If B=65
This really helped the readability of my BrainF*** compiler

Mhmm ok, because the way it is explained in the doc seems like something totally different. I think it may be best to clarify in the doc that fill does the same thing as the BASIC command, but for pointers instead of lists. Also if I read Builderboy way, I still doN,t get it. To me it seems like he's saying Fill just copy one list element to the next one, not fill the entire list with an element.

About Conj, what if we want to do For(X,9,12:{L1+X}->{L2+X:End?

Also are lists defined the same way as other stuff? Like at the beginning of a program I just do {2,34,5,23,0->L1?

For that example, you would want conj(L1+9,L2+9,4

And remember that L1-L6 are just areas of RAM. So, you will need to initialize data just like for a sprite (you will have to convert the values to hex), and store to a String or Pic or something. Then, you should copy your String/Pic to one of the defined RAM areas. (I suppose technically, you could modify the data while it's in the program, but that only works correctly for no-stub)

Edit: Example code
:[0222051700->Pic1
:conj(Pic1,L1,5
Edit2:
Also, remember that Quigibo is planning for real array support later. So it should get easier.

I tried -1*-1 and I ended up with 1. I dunno, maybe there's something going on with the underscore in the loop label? I've never really used that.

Hmmm it would seem so.  Is it really so much of a hassle to flip the negative bit, multiply/divide, then flip it again?  Seems trivial compared to any other modification, although i'm not an asm guy

You can't just flip a bit. You have to subtract from zero.

I redraw the whole thing every frame with a dedicated routine (along with the scrolling background). In Axe, you could probably draw some sprites after you scroll, since they are clipped to the edge of the screen now

It means that I have a table of routine, one for each tile. When Mario collides with the tile, the routine is called and it can do stuff

And I might try to get the grayscale working properly as well.

Edit:
Also, you may have noticed that the bouncing blocks are smoothly animated now, rather than jumping a few pixels. This is one of the strengths of my sprite routine.