... />
[CODE]
POKE (i=(z>1))*n,15:
[/CODE ...

... />
[CODE]
POKE (i=(z>1))*n,15:
[/CODE ...

... 'c(2),c(3),:
POKE n,12+p+20*(0=c ... /> POKE (wz)*n,24:
NEXT j:
POKE (t(z)=p)*n,31 ... :
POKE ... /> LET p=3-p:
POKE n,3:
DATA 23620,2 ...

... IF THEN into the first POKE. The program jumps to statement ... though it would've generated "N: Statement Lost". I suppose it ...

... this
[code]
1 POKE 23620,2
[/code]
Works!
[code]
1 POKE 23620,3
[/code]
POKE is this:

POKE n,13+20*(0 ...

... did was remove the conditional POKE (to skip INPUT) and put ... change the conditional POKE to something like POKE (x=p)*n,16. But ...

[code]
POKE (t(w)3-p)*n,28:
LET w=w ... +d:
POKE (t(w)p)*n,23+5*(t(w ... />
[code]
POKE (t(w)3-p)*n,28:
LET ... w=w+d:
POKE (t(w)p)*n,22:
[/code ...

... did was remove the conditional POKE (to skip INPUT) and put ... change the conditional POKE to something like POKE (x=p)*n,16. But ... messing around with those fun POKE statements with a renewed enthusiasm ...

... ;222079][code]
POKE (t(w)3-p)*n,28:
LET ... =w+d:
POKE (t(w)p)*n,23+5*(t(w ... />
[code]
POKE (t(w)3-p)*n,28:
LET ... w=w+d:
POKE (t(w)p)*n,22:
[/code ...

... t(92):
READ n,t(42),t(43), ... LET q=i:
POKE n,14+p:
INPUT a ... +d:
POKE (t(w)3-p)*n,28:
... w+d:
POKE (t(w)p)*n,22:
... br /> POKE (wz)*n,25:
NEXT j:
POKE n,30+(t ... LET p=3-p:
POKE n,3:
DATA 23620, ...

... ;222079][code]
POKE (t(w)3-p)*n,28:
LET ... =w+d:
POKE (t(w)p)*n,23+5*(t(w ... />
[code]
POKE (t(w)3-p)*n,28:
LET ... w=w+d:
POKE (t(w)p)*n,22:
[/code ...

...

[code]
[...]
POKE n,30+(t(z)=p)-(i ... this:

[CODE]
POKE n,31-(t(z)p)*(1 ... />
b) There's another POKE statement that is supposed to ... no way to fix this POKE without using too many extra ...

... /> POKE (wz)*n,27:
NEXT j:
POKE (t(z)=p)*n,34 ... :
POKE ... /> LET p=3-p:
POKE n,4:
DATA 23620,2 ...

... *b>0)*(b0)*(b1))*n,15:
[/CODE]

[CODE]
POKE (i=7)*(z>1)*n,15:
[/CODE ... /> [CODE]
POKE (i=7)*(z>10)*n,15:
[/CODE ...

... /> [CODE]
POKE (i=7)*(z>10)*n,15:
[/CODE ... :

[CODE]
POKE v*n,15:
[/CODE]

... *b>0)*(b0)*(b1))*n,15:
[/CODE]

[CODE]
POKE (i=7)*(z>1)*n,15:
[/CODE ... /> [CODE]
POKE (i=7)*(z>10)*n,15:
[/CODE ...

[QUOTE=Einar Saukas;222618]Even better, use this instead:

[CODE]
POKE v*n,15:
[/CODE]

And add this statement right after the INPUT (before the loop):

[CODE]
LET v=(a*b>0)*(b

... />
[CODE]
POKE (i>7)*n,15:
[/CODE]

[CODE]
POKE n-v*n,15:
[/CODE]

... />
[CODE]
POKE (i>7)*n,15:
[/CODE]

[CODE]
POKE n-v*n,15:
[/CODE]
[/quote ... .

I also suggest POKE n+73,32: CLS at the ...

... /> POKE n-v*n,17:
LET t(w)=p:
POKE (wz)*n,28 ... :

[CODE]
POKE n-v*n,17:
LET w=w ... /> LET t(w)=p:
POKE (wz)*n,29:
[/CODE]

... /> POKE n-v*n,17:
LET t(w)=p:
POKE (wz)*n,28 ... :

[CODE]
POKE n-v*n,17:
LET w=w ... /> LET t(w)=p:
POKE (wz)*n,29:
[/CODE]

... /> POKE (wz)*n,25:
NEXT j:
POKE (t(z)=p)*n,32 ... :
POKE ... )=p:
POKE (wz)*n,24:
NEXT j:
POKE n,29+(t ...

... =z+d:
POKE (t(w)3-p)*n,27:
LET ... w=w+d:
POKE (t(w)p)*n,21:
LET ... )=p:
POKE (wz)*n,24:
NEXT j:
POKE n,29+(t ...

... =z+d:
POKE (t(w)3-p)*n,27:
LET ... w=w+d:
POKE (t(w)p)*n,21:
LET ... t(w)=p:
POKE (wz)*n,24:
NEXT j:
POKE 29+t(z)=j*p ... /> I do think that the POKE can be optimalized

... =z+d:
POKE (t(w)3-p)*n,27:
LET ... w=w+d:
POKE (t(w)p)*n,21:
LET ... t(w)=p:
POKE (wz)*n,24:
NEXT j:
POKE 30-(1+(i=(z> ...

... taste, but I think this POKE looks easier to read (or ... this:

[CODE]
POKE n,32-(1+14*(z> ...

... it like this

POKE n,34-(1+16*(i=7 ...

... it like this

POKE n,34-(1+16*(i=7 ... about this:
[code]
POKE n,34-(1+16*(z> ... =0)
instead of
POKE n,34-(1+16*(i=7 ...

... about this:
[code]
POKE n,34-(1+16*(z> ... =0)
instead of
POKE n,34-(1+16*(i=7 ...

... about this:
[code]
POKE n,34-(1+16*(z> ... =0)
instead of
POKE n,34-(1+16*(i=7 ... be:

[CODE]
POKE n,34-(1+16*v)*(t ...