Cool deal, I saw it but not too big on pancakes..

It's still free food though.

Where is the problem occurring and what exactly is it?

Using your first code chunk
:identity(4,Str1,0,0,12,8,0,12,0,8,1,0,8,1,0I don't get a problem, it will fill the map completely/correctly, but the second (the one you're not having problems with)
:identity(4,Str1,0,1,12,8,0,12,0,8,1,0,8,1,0Only tiles the bottom row incompletely.

[edit] You could just use det(26 to convert the matrix to a string and then use det(17 to get the binary string.  For all the matrices I tried they both returned the same string.  Nevermind

[another edit] I think I figured out the problem.  You're going 'backwards'.  You're adding your previous string to the end of the new element, so if you're matrix was [[1,2,3]], your program gives "030201?"

New updates!

I overhauled the collision-detection/movement which cut about 200 bytes off the size of the programs and led to a nice little speed boost.  Unfortunately, the upgrade also destroyed any uniformity in the time one frame takes, so there would be no consistent measure of time.  This means that there can't be a full version on a calculator that doesn't have an internal clock, i.e. the 83+.  I'm still considering releasing an 83+ version, but it wouldn't have any time, which means the scores wouldn't be consistent with the original version, and I'll have to create an entirely new formula for "pitty skipping" (if you lose/spend a lot of time on a level you're given the option of skipping it).

I've also implemented the help tiles as well as started the GUI.  When I tried running the main engine from another program there was a large speed drop so I have to rethink how I'll be doing the level-hopping and passwords, but hopefully those will be done in the next couple days.

[edit] You can see the updates in action here

They're great calcs, for both gaming and math.  But there is one thing you should keep in mind when using it for class: don't rely too heavily on its symbolic manipulations/calculations.  I've known a lot of people whose (math) test grades suddenly dropped after they got an 89

The only problem is, is that the case that covers it doesn't slide off easily. Not really a technical issue or anything, but I thought I'd let you know.

I had the same problem.  It loosens up eventually

wait, so how does that work?

rand(N) will create an N-element long list of random numbers, and since the random numbers are 10 (14?) digits long there's virtually no chance of having non-distinct numbers.  SortA(L2,L1) will sort L1 according to the order in L2 and store the result in L1.  For example, if you had L1={1,2,3} and L2={.42,.21,.99}, then SortA(L2,L1) would return L1={2,1,3}.

Yeah large maps would be a pain, but all you're doing is converting the matrix number (0,1,2,...,18,etc) into it's hex form and putting it into a string. Even a large map wouldn't be bad.

I've made an ASM program that goes the other way (takes a string of hex values and converts it to the corresponding matrix), and I don't think it would be too hard to reverse the process so I'll see what I can do...

[edit]Scratch that.  The only reason I used ASM for converting to a matrix was speed, so actually ASM is probably overkill.  A BASIC program for matrix->string shouldn't be too hard though.

It looks great so far

Also, does anybody know if I can randomize a list. I want it to keep the same numbers, just different order.

With an n=N-element list (let's say L1):
:rand(N→L2
:SortA(L2,L1will randomize L1.