More:

:0→F
:0→N
:0→V
can be optimized into

:0→F→N→V
And any reason you're doing

:C*3+C→E
? It's a lot more optimized with

:C*4→E
Saves 7 bytes, in fact.

I don't think I'm using that anywhere, just

Code: [Select]

:C*3+L2->E

It's here:

:      !If rand^5
:P+1→P*3+L4→E
:rand^4→{E-2}
:{A-1}+4→{E-1}
:{A}→{E}
:      End
:C*3+C→E
Also, take advantage of the last calculated value. In other words,

:If {B}-{A}≥≥‾1 and (K≠1)
:1→{B-2}
can be optimized to

:If {B}-{A}≥≥‾1 and (K≠1)
:→{B-2}
because the If  statement results in 1 if it's true, anyway.

(Also, the If  statement can be optimized again by doing {B}-{A}+1≥≥0 instead of {B}-{A}≥≥‾1.)

We observe the mentality of pushing you in the right direction and then letting you gain some experience yourself Of course if you are totally lost or if we can give a few more pointers, we'll be happy

I really need some answers.

Is !If X-56 also an optimisation?

What if I have compound If statements? I know splitting them up saves speed, but what about space?

Which is smaller? ClearDraw^r or StorePic? (my guess is StorePic, but only by up to 5 bytes)

Also: major improvements can be made if I can Copy(xx,Y₁,yy) Is this possible? I'm afraid to test it

Lastly, should I be using DelVar in my save routine? I do have to overwrite the appvar every time I save...

Oh and one more, am I asking too many questions?

Quote from: lookitsan00b on November 11, 2010, 11:30:50 pm

Also: major improvements can be made if I can Copy(xx,Y₁,yy) Is this possible? I'm afraid to test it

You can not store directly to archive, so that's impossible.

Quote from: lookitsan00b on November 11, 2010, 11:30:50 pm

Oh and one more, am I asking too many questions?

Nah, it's cool.  The more questions you ask, the more everyone learns.

Whoops. I meant Copy(Y₁,xx,yy)

I believe doing it that way it possible, but I'm only 80% sure as I've never tried it.

Ok then does Unarchive return a pointer? Don't want to throw in an unnecessary GetCalc routine...

Ok so when score reaches 10000 it increases the second variable? Sounds interesting. I wonder how do you display them? I think I tried such thing before and failed. File size seems pretty nice so far. Keep up the good work and I hope you can solve the issues you are having.

Ok so when score reaches 10000 it increases the second variable? Sounds interesting. I wonder how do you display them? I think I tried such thing before and failed. File size seems pretty nice so far. Keep up the good work and I hope you can solve the issues you are having.

Well thats why it increases the second variable when it hits 10000 instead of 65535 or 60000.
:Output(4,0,S>Dec)
:If Q
:Output(0,0,Q>Dec)
:End

I fixed the minor problems and got major. It crashes or just takes far longer than it should when using block 10.

:.blocks
:{B-3}->U
:For(D,1,C)                                        //for each block
:D*3+L2->A                                         //get pointer to block info
: If Z+1                                           //every other frame...
:  irrelevant code here
: End
: If the ball hit block D
:  do stuff with the ball's velocity and the score
:  0->F->N->V
:  C->{L2}
:Lbl DX
:  If {A-2}=0 or ({A-2}=8) or ({A-2}=9)            //destruction routines for different blocks
:   ...
:  ElseIf {A-2}=10                                 //start of problem code
:   C*3+L2->D                                      //I need to keep track of the block's info
:   Exch(D-2,A-2,3)                                //so I use Exch
:   C-1->C                                         //to destroy the block
:   For(E,1,C)                                     //for each block
:    E*3+L2->A                                     //get block info
:    If the blocks are close enough
:     N+1->N+({L2}*3)+L2->F                        //pointer to open table space
:     E->{F}                                       //store a link
:    End
:   End                                             //the destruction routines can mess up my links
:   SortD({L2}*3+L2+1,N)                           //so I have to go in order.
:   For(D,1,N)                                     //for each table entry,
:    If {{L2}*3+D+L2}*3+L2-A                       //If it doesnt link to the same block as the last one
:     +A->A                                        //store the link in A
:     V+1->V                                       //tell the destruction routine we need to return
:     sub(DX)                                      //I know it all works at least to here
:    End
:   End
:   0->D                                           //no idea as to which blocks it has & hasn't hittested...
:   ->N                                            //list is empty
:  ElseIf {A-2}<=7
:   ...
:  End
:  If V                                            //If we need to return
:   V-1->V                                         //then we return
:   Return
:  End
: End
:End