MaxCoderz

@burr: If he wants speed, then he shouldn't use "and", even if it saves a byte. Also, I think I read somewhere that "/10" is faster than ".1" I don't know where you read that, but your assumptions are wrong -- and is faster than implicit multiplication, and multiplicat...

I have a few minutes of free time, so I figured I'd point out some more optimizations: :ZStandard :84→Xmin :52→Ymin :ZInteger :C-(Ans=25)+(Ans=34 :Ans-102(Ans=102)-13int(Ans/13(2>abs(5-abs(5-abs(Ans-83 :rowSwap([J],1+int(3rand)+3B,3B+1+int(3rand→[J] :1+int(9rand→B :1+int(9rand→C :Ans-13int(Ans/13(2>...

16→dim(L1:Fill(6,L1 DelVarB6→E:5→A Repeat A>L1(1 or K=45 ClrHome Output(A,1,"> Output(8,1,"SCORE: Output(8,9,B For(F,1,16 Output(L1(F),F,"- End 1+int(3rand→D max(2,min(8,E+(Ans=1)-(Ans=2→E Ans→L(17 For(F,2,17 L1(F→L1(F-1 End getkey→K A-(Ans=25 and A>1)+(Ans=34→A B+iPart(.1(2^A→B End

Yes, I can see some optimizations. I would tell you where they are, but you didn't ask for that information. :P On a serious note, if you really want your program to be as optimized as possible, I would head on over to the #Optimize IRC channel hosted by UTI, and talk to Weregoose. He is quite good ...