Quick question: for zStart, what does Solver++ do?

Quote from: willrandship on January 14, 2011, 11:24:58 pm

Don't forget that a bomb hitting another bomb sets both off.

Looks great so far!

That's important and tricky to code, it seems.

I actually didn't know that the bombs did that until willrandship told me

Yup.  If the size of your program goes over about 8000 bytes, then you should really consider either optimizing or turning it into an app.  There's an executable file limit on all assembly programs, although I can never remember the precise numbers.

Shells tweak the numbers a bit, plus I think that some shells do away with the size limit altogether.

@ Scoutdavid: Just to let you know, I think you misspelled 'Load'.

Looks very well! What language?

Oh!  Right.  Axe.

Collision checking?  Do you mean making sure enemies never intersect?

If we keep the amount of enemies fairly low (under a hundred, probably), then you could just take a brute force method - randomly generate two numbers for X and Y coordinates, check those numbers against every other enemy's coordinates, then if the absolute difference is 7 or less, then either attempt select another random slot, or add/subtract the appropriate amount of numbers to get the enemies not to intersect.

Edit: You probably meant bullets - in that case, just use the same checks you did with variables, only because all of your data is in what is effectively a list, do the checks in a for loop.

No problem!  Pointers are your friends - with them, you can do so many magical things. 
btw, here's more info on what pointers actually are:
1] In all computing devices, there is only a set amount of memory.  In order to use the memory, they're all treated as if they're arranged in a line.

2] The very first byte is called byte number 0, the second byte is called byte number 1, etc.

3] This byte number is the address - the address tells you exactly which byte you're talking about.

4] Each byte can hold a number.  Think of houses - they have addresses, and they hold stuff inside.

5] So, by doing 10->X, you're telling Axe to store 10 to a certain byte in memory (Because a lot of these bytes hold vital information, variables are given so you don't have to remember a bunch of numbers whenever you want to store something).  If I do something like 11->{1337}, I am storing the number 11 to byte number 1337 (you should never do this, though.  Storing numbers to random places in RAM is the quickest way to a RAM clear).

6] If we examine {L1+5}, the L1 part is a numerical address to a place in RAM you can freely muck about in without any danger.  Think of it like pi - it's a number which is hardish to remember, so the compile just substitutes it for you when compiling. 

7] The stuff inside the braces tell you which byte you're thinking of, and adding the braces tell you to store to that particular byte.

8] Don't add braces around variables, though.

Yeah I was planning that. The problem with more enemies is variables, or in Axe is there a way to have more than the what... 29 or so variables? Like A-Z and Theta?
And maybe after a certain amount of time the enemies shoot faster? Like as in more often?
And finally the screen... I'm not quite sure what the problem with that is. I'm thinking of removing it after I add a counter.

*psst*  Want to know a secret?
I can tell you how to get about 710 more variables - for free!

If you want to do this:
10->A
10->B
Where A and B are the coordinates of an enemy, you could do this instead:
10->{L1}
10->{L1+1}
(The L1 is the list number one, and don't forget the curly braces).

You can safely store numbers up to about 714 (so doing 42->{L1+710} is perfectly safe).

Also, if all the enemies act exactly the same, you could do this:
.Storing enemy location
For(A,0,15)               //I want 16 enemies
    rand^95->{A*2+L1}     //X-coordinate
    rand^30->{A*2+1+L1}   //Y-coordinate
End

.Displaying enemies
For(Z,0,15)
    Pt-On({A*2+L1},{A*2+1+L1},Pic1)
End

These are called pointers.  If you search the Axe forum, you could probably get a better explanation of them, but this is the quick implementation guide