This isn't anything to spectacular or anything, just thought it might be a cool little thing to make real quick. To see what I could come up with and how small I could make it on a "just go with it" type of thing. I think it turned out pretty well. But like I said, it's nothing special. Just another homescreen tunnel game.

Object of the game is pretty simple: don't hit the walls. As you progress the walls continually get closer together. Shouldn't be any bugs that I know of. Only thing is that don't try to go off screen before you reach the tunnel I have no edge code built in since it really isn't needed (I don't think you can reach the edge anyways). Um, ya. Think that's about it. Score is at the bottom. Have fun and enjoy Tell me what ya think.

Oh ya, it's only 304 bytes. Tried to keep it under 300 but failed to do so. I optimized it the best I could but if anyone sees any, if you go looking through the code, let me know and I'll change it




Note:
Just noticed that in the screenshots you can see the score on the seventh line just barely. On a calculator you can't see it, or very barely can.

score: 1269 ^^
Fun game!

Nice!

What would be the bug?

Ah i see, so it only checks to see if your position is equal to the wall?  Why not just say less and or equal to and it could be fixed easily?

Heh sounds good Sometimes the simplest solutions are the best ^^ Although not always the most obvious

Oh noo whats going wrong?

yeah.. i just scored 500 by placing the cursor at the right side of the screen and then forgetting about it for a bit. anyway; here's a 295 byte version:
:DelVar {L1}16→dim({L1}
:1→B
:6→S
:5→A
:8→X
:10→W
:5W→J
:DelVar H1→L
:For(F,0,6
:Disp "
:End
:Repeat 0
:X+sum(DeltaList(getKey={24,26→X
:"**************
:Disp sub(Ans,1,A)+sub("      ",1,S)+sub(Ans,1,W-A
:min(W-1,max(1,A+randInt({-}1,1→A
:Ans→{L1}(L
:17-W+Ans→{L1}(L+1
:Output(1,X,"V
:Output(8,1,H
:If X={L1}(L+2-16(L=15)) or X={L1}(L+3-16(L=15
:Stop
:L+2
:Ans-16(Ans=17→L
:H+B→H
:If Ans>J
:Then
:max(1,S-1→S
:min(14,W+1→W
:4J→J
:B+1→B
:End
:End

all i did was eliminate the need for Str1 by replacing it with ans, changed a few things to Ans (speed optimization) and added getKey as part of the movement code statement.

by the way.. if you can get collision detection to work without the list, you'll save a ton of memory.

edit: it'd be really cool if you had a snippet of inline ASM to get the byte at which the V is. then it's not pure basic.. but still. otherwise you need a  112 external string variable... and managing that would be slow and memory consuming. it'd be slower, but i suggesting instead of using Disp, using Output. it makes collision detection so much simpler.