Hmmm, well then i don't know I guess you could always store the border into a pic and recall it...  

Well you might want to try rowswapping to get better speed, i think it would be faster than storing to lists each time, but i will have to run some tests...

Alright, instead of

[A]T->[A]
Matr->Lst([A],L1,L2,L3)
Lst->Matr(L2,L3,L1,[A])
[A]T->[A]
I think

[A]
For(F,1,2
rowSwap(Ans,F,F+1
End
Ans->[A]
Is a lot faster, and even faster the greater your matrix is.  Is 3x3 going to be the final size of your matrix?

Oh, i see.  Well then you might need to be a bit tricky.  Instead of using the tilemaper, you could do this.  When you first load up the screen, you use the tilemapper normally to fill the screen region.  Then when you shift the matrix using my matrix shifter, you use the xLib screen shift routine, and then use the tilemapper to add onto the end of the shifted screen tilemap.

Would that work?  As you can see I'm trying very hard to make this work without actually shifting the tiles

EDIT: Oh and zTrumpet,  it would be much faster, but i was coding for readability

Oh, ok, i see what you're saying. This would be amazing and exactly what i need... except that i cant have it wrap

Hmmm, I'm not quite sure what you mean.  Here, take a look at this slightly modified code

{1,2,3,4,5,6,7,8,9,0->L1
0->S                               
"1+10fPart((X+S)/10->Y1          //yay magic formula
                             
While 1

For(F,1,10                  //Display the entire linked list so you can see whats going on
Output(1,F,L1(Y1(F           //Displays elements from 1 to 10
End
rand(20

S+1->S                        //Increase shift
randInt(0,9->L1(Y1(10        //Add random number onto the 'end' of the list, which is element 10

End
I believe that does exactly what you are looking for.  Do you see how it works?  The numbers do wrap every time i change the shift, but then i overwrite them with the new random number that is being added onto the end of the list (End of the list is element 10)

Sure.  I used this technique on a snake game i made.  It s prime example of how you want to move a whole bunch of elements down a list without losing much speed.

So here we have a list of 10 numbers (I'll use lists, but it still applies to matrixes)

{1,2,3,4,5,6,7,8,9,0->L1
20->S                                //We set the shift to 20.  If it goes negative, bad things happen :P
"1+10fPart((X+S)/10->Y1         //This is our magic formula, using modulus arithmetic, it gives us
                               //the element we want but accounts for the shift
                               //It is stored to Y1 for easy use :P
While 1

For(F,1,10                 //Just some simple code to display the list from 'start' to 'finish'
Output(1,F,L1(Y1(F           //But using the formula, so in perspective of the shift
End

Repeat Ans
getKey -> K
End

S + (K=24) - (k=26)    //You can change the shift with your arrow keys

End


Hmmm, I'm tempted to do some sort of fancy list manipulations and such, but I have another idea that may or may not work.

I assume these values will be accessed at some time in the program, so what I'm thinking is instead of changing the matrix, you could have a 'shift' variable that you can change.  Instead of saying [A](A,B) you would have [A](A+S,B) where S is the shift variable.  To simulate shifting the matrix over by one, you could instead just increase S by 1.

Its nice to see that this is progressing so fast!  I might want to have another look at assembly at some point

Welcome to the team!  And let me put in yet another 'Can't wait to see your project'

Yay assembly programing!  Its cool that your getting into this, and neat that you got sprites working so fast Good job!