Compressed Bytes used
1024

Source Code (OPTIONAL)
--jusa
--tiny tides
f={}n=100d=1p=nil g={"✽","●","◆","⧗"}e={2,0,1,1}a={0,0,0,0}l=4u={},{}r={}function k(o,e)for n=-1,1do for d=-1,1do if(d~=0or n~=0)and f[e+n]and f[e+n][o+d]==1then return false end end end return true end function x()for n=1,16do f[n]={}for e=1,32do f[n][e]=0if n<=2or n>=14then f[n][e]=0end if n<=1or n>=16then f[n][e]=3end end end for n=1,8do local e,n repeat e,n=flr(rnd(26))+4,flr(rnd(10))+4until f[n][e]==0and n>2and n<15f[n][e]=2local o={{e,n}}for d=1,7do local d=flr(rnd(4))if d==0and e>3then e-=1end if d==1and e<29then e+=1end if d==2and n>3then n-=1end if d==3and n<13then n+=1end if f[n][e]==0then f[n][e]=2add(o,{e,n})end end add(u,o)end for n=1,#u do local n=u[n]for e=1,min(#n,2)do for e=1,10do local e=flr(rnd(#n))+1local n,e=n[e][1],n[e][2]if k(n,e)then f[e][n]=1add(r,{n,e})break end end end end repeat local n,e,d=r[flr(rnd(#r))+1],flr(rnd(3))-1,flr(rnd(3))-1i,o=n[1]+e,n[2]+d until f[o]and f[o][i]==0and(e~=0or d~=0)end x()h={}for n=1,16do h[n]={}for e=1,32do h[n][e]=true end end function _draw()cls()print("g:"..n.." "..l.."/100",1,72,7)for n=1,4do print(g[n]..":"..e[n],1,80+8*(n-1),c and d==n and 10or 7)if c then print("g:"..a[n],28,80+8*(n-1),7)end end if not c then local n,e=i,o if btnp(0)then n-=1end if btnp(1)then n+=1end if btnp(2)then e-=1end if btnp(3)then e+=1end if n<1then n=32end if n>32then n=1end if f[e][n]==0then i,o=n,e for n=1,16do for e=1,32do if(e-i)^2+(n-o)^2<=4then h[n][e]=false end end end end s=false for n=1,#r do local n=r[n]if abs(i-n[1])<=1and abs(o-n[2])<=1then s=true b=n break end end if s then print("z:buy/sell",76,72,9)end if s and btnp(4)then if b~=p then p=b for n=1,#a do a[n]=flr(rnd(90))+10end end c=true d=1end else print("x:exit ⬅️:buy ➡️:sell",1,112,9)if btnp(2)and d>1then d-=1end if btnp(3)and d<4then d+=1end if btnp(1)and e[d]>0then e[d]-=1l-=1n+=a[d]end if btnp(0)and l<100and n>=a[d]then e[d]+=1l+=1n-=a[d]end if btnp(5)then c=false end end for d=1,16do for o=1,32do local n,e=(o-1)*4,(d-1)*4rectfill(n,e,n+3,e+3,12)if f[d][o]==1then rectfill(n,e,n+3,e+3,9)print("p",n,e,0)end if f[d][o]==2then rectfill(n,e,n+3,e+3,(o+d)%2==0and 3or 4)end if f[d][o]==3then rectfill(n,e,n+3,e+3,7)end if h[d][o]then rectfill(n,e,n+3,e+3,15)end end end local n,e=(i-1)*4,(o-1)*4rectfill(n,e,n+3,e+3,8)end