... we need a FOR..NEXT loop anyway to count the number of ... :

[code]
FOR f=1 TO 25: LET m(32 ... with a new FOR F loop
FOR F=1 TO xxx
(cost 8 )

and the POKE ...

... m(735):
FOR f=-149 TO 0*USR 7766:
RESTORE :
READ n,m ... ),p,j,z:
POKE n,3+3*(m(p)=0 ... ),m(p+z):
POKE 22528+p,48-(f=0 ... ):
POKE 22528+p+z,48:
POKE (k

... also remove the initial CLS to save another 6 positions if ... ^0:
FOR r=1 TO 31:
FOR s=1 TO 23:

... also remove the initial CLS to save another 6 positions if ... ^0:
FOR r=1 TO 31:
FOR s=1 TO 23:

[code]
1 CLS :
DIM m(3e3):
LET m(INT (RND*5)*2+1430)=USR 7766^0:
FOR r=1 TO 31:
FOR s=1 TO 23:
READ p,z,j,i,w,m(i+i-z*(1r/16)),m(i+i+(s

... on the double FOR ... NEXT that can be reduced to 1 saving ... /> READ p,d,n,z,q:
FOR f=1 TO 25:
NEXT f:
FOR g=7 TO 8:
LET p ... /> LET m(p)=1:
POKE 22462+p,g+8*(p ... *m(p+d+d):
POKE (m(p+d+d)=0 ...

... the routine to draw a frontwall with the drawingroutine for the ... 0:
FOR r=1 TO 31:
FOR s=1 TO 23:
FOR e=-.5 TO 1:
LET w ... -t,w*o:
POKE n-o*n,8:
NEXT e:
LET q=q+z:
POKE ...

... remaining number of squares left to fill, call it the ... )+1
15 for x=22528 to 23294
20 ... go to 35
30 next x
35 poke x, ... all attributes not equal to 0, then attr squares ... / RAND_MAX)+1;

for (x=22528; x!=23295; ++x ...

... the routine to draw a frontwall with the drawingroutine for the ... was not worth it trying to "unify" the DRAW statements, ... 0:
FOR r=1 TO 31:
FOR s=1 TO 23:
FOR e=-.5 TO 1:
LET w ... /> LET q=q+z:
POKE (p

... finally made it possible to reimplemented [B]3D Maze ... p,z,n,g:
FOR g=g-1 TO g:
POKE 22463+p,48-(g=429 ... NEXT g:
POKE (g=430)*n,16:
LET ... -z/16:
POKE (m(p-z-z ... RND*15)+66:
POKE n,9:
LET k= ...

... DEF FN a(r,n)=r-INT (r/n)*n:
READ c ... $,m,n,v,p:
LET ... x=RND*36+10:
POKE n*(c$(x)>"O"),3 ... ):
CLS : LET x=x+n^(c$(p)

[code]
1 DEF FN a(r,n)=r-INT (r/n)*n:
READ c$,m,n,v,p:
LET x=RND*36+10:
POKE n*(c$(x)>"O"),3:
LET c$(x)=CHR$ (CODE c$(x)-40):
LET c=FN a(3+PEEK 23673,256):
CLS :
LET x=x+n*(c$(p)

... DEF FN a(r,n)=r-INT (r/n)*n:
READ c ... /> LET x$=c$(x):
POKE n*(x$>"O"),3:
FOR g=1 TO 4:
LET h ... -v:
LET n$=c$:
FOR g=0 TO 5:
LET ... c$(h+g*v)=n$(h ...

...
INKEY$ : E : N
INPUT : K : I ... A
NEXT : K : N
NOT : KLC : SYM ... E : SYM + 8
POKE : K : O
PRINT ... /> Many thanks to Dunny for providing the source ...

... feature we could add to [B]Labyrin3D[/B] to take advantage of ... ^0:
FOR r=1 TO 31:
FOR s=1 TO 23:

... let r$="good luck"
30 let rm=0
40 ... br /> 20 let n=int(rnd*30)+10
30 cls:print
140 let a$="~":for i=1 to 5
150 ... br /> 640 for i=1 to 4
650 let n=int(rnd ... gt;====>===="
750 for i=1 to 5:let g$(6 ...

... restore:for i=1 to r:read d$:next i
30 ... cat"
70 for i=1 to g
80 ... go ";
110 for i=1 to len(r$(r))
190 for i=1 to li-1
... $(r))
650 for i=1 to rl
660 ... )
670 if (u$="n" and d=1 and f ...

... feature we could add to [B]Labyrin3D[/B] to take advantage of ... ^0:
FOR r=1 TO 31:
FOR s=1 TO 23:

... now or not?
Seems to me nothing more than 1 ... test to see if d has reached ... ^0:
FOR r=1 TO 31:
FOR s=1 TO 23:

... can eliminate the constant [b]n[/b].

Can we ... ^0:
FOR r=1 TO 31:
FOR s=1 TO 23:

... /> READ p,d,n,z,q:
FOR f=1 TO 25:
NEXT f:
FOR g=7 TO 8:
LET p ... /> LET m(p)=1:
POKE 22462+p,g:
NEXT ... *m(p+d+d):
POKE (m(p+d+d)=0 ... /> LET l=q=672:
POKE n*l,29:
LET l ...

... n,p,d,z,j,q:
FOR f=USR 7766^0 TO ... :
NEXT f:
FOR g=7 TO 8:
LET p ... /> LET m(p)=1:
POKE 22462+p,g:
NEXT ... *m(p+d+d):
POKE (m(p+d+d)=0 ...

... this:

[CODE]
POKE 22462+p,g:
...

[CODE]
POKE 22462+p,g+8*(p ... $=INKEY$:
POKE (k$="")*n,18:
FOR i=1 TO 4:
LET ... /> LET k=CODE INKEY$:
POKE (k

... so there's no need to initialize it again every time ... , there's no need to distinguish rooms and corridors during ... 's a shorter way to code the map display loop ... n,p,z,q,v,g:
FOR g=g-1 TO ... /32-z/16:
POKE (m(p-z-z)1 ... (RND*15)+66:
POKE (g

... /> READ p,z,n,g:
FOR g=g-1 TO g:
LET m(p)=1:
POKE 22463+p,48-(g=429 ... ):
NEXT g:
POKE (g=430)*n,16: [B]

Here is the generator for "TRACE MAZE".
I already ... took some steps for the display by changing m ... far

POKE n,12:
Go to setting first field

FOR g=0 TO 5:
PRINT AT ...

... . I haven't tried to convert them, but you ... load process to see where it jumps to on return ... this won't convert to ROM. If you replace ... but this appears to be more for hi-score and instruction ... found the POKE for "n lives" years ago, only to be disappointed ...

...
5 FOR Y=1 TO 2
10 LET N$="Spectrum"
20 LET x=2
30 GO ... /> 90 STOP
100 FOR C=1 TO x
110 PRINT ... "Happy Birthday to you"
120 NEXT C ... Birthday dear";
160 PRINT N$
170 RETURN

... were captured but you managed to escape.
You jumped ... first car to escape the town.
Unfortunately for you your ... br /> that will fly to the other side of the ... town to signal your escape.
POKE n,12:
LET s= ...

... WHEELIE when you must try to get back before the ghostrider ... does. I altered the plot to a road and pigeon.[/QUOTE ... I have been too busy to even think about one-liners ...