... n,p,s$:
FOR x=1 TO 6:
FOR y=2 TO ... INKEY$-47:
POKE (b8)*n,13:
POKE (t(b+8 ... /> POKE (t(k+8)=0)*(a1):
FOR e=-.5 TO 1 ... POKE (t(m)=p)*n,29:
NEXT e:
FOR f=1 TO ... LET p=8-p:
POKE n,5+5*(t(5)=0 ...

... n,p,s$:
FOR x=1 TO 6:
FOR y=2 TO ... INKEY$-47:
POKE (b8)*n,13:
POKE (t(b+8 ... /> POKE (t(k+8)=0)*(a1):
FOR e=-.5 TO 1 ... POKE (t(m)=p)*n,29:
NEXT e:
FOR f=1 TO ... LET p=8-p:
POKE n,5+5*(t(5)=0 ...

...
[CODE]
FOR e=-.5 TO 1:
...
...
[CODE]
FOR e=0 TO 1:
...
... using the remaining positions to set all attributes ... with different INK colors for instance. Instead of ...
[CODE]
POKE n+73,8:
[/CODE]

... ;"SIMON":
LET n=23620:
FOR f=1 TO 4:
INK ... f:
FOR g=1 TO 32 ... ,0:
NEXT g:
POKE n,11:
STOP :
PRINT ... :
LET f=1:
POKE n,9
[/code]

... , so thanks again to all for your considerations (and for the game tribute ... :

[CODE]
1 POKE 23693,7:
CLS :
FOR b=-1 TO 0:
FOR g=3 TO 8:
n'dirty adaptation of Dr BEEP ...

... n,a$:
POKE n+73,7:
CLS :
FOR k=1 TO 4 ... +10*e;k:
FOR p=-23 TO 0:
PLOT 232 ...

... good to allow some time for any further suggestions before commiting to the ... /> I just found a way to save another 17 positions:
n=23620:
POKE n+73,7:
CLS :
FOR k=1 TO 4 ... +10*e;k:
FOR p=-23 TO 0:
PLOT 232 ...

... we will have to start making sacrifices ... away that are hard to distinguish anyway. However ... could remove this restriction to save several positions.
[CODE]
FOR f=0 TO 9:
LET q ... ...
NEXT f:
POKE n,11:
[/CODE]
...

... to save another 12 positions by using the same PLOT statement for ... . Thus instead of trying to explain how to do it, I will ... have to list here the entire new ... )=1:
FOR r=1 TO 19:
FOR s=1 TO 19:

... )=1:
FOR r=1 TO 19:
FOR s=1 TO 19:

[QUOTE=Dr BEEP;252036]Time to make my contribution:

Replace
[code]
LET k=CODE INKEY$:
POKE (k

... finished the new version according to the description above, which now ... and most generated maps seem to be somewhat more interesting (and ... now. Many thanks to [B]bigjon[/B] for mentioning that the original ... 1:
FOR r=1 TO 31:
FOR s=1 TO 21:

[QUOTE=Dr BEEP;252537]This one works.[/QUOTE]

Agreed! We can save 2 positions replacing this:

[CODE]
POKE n,4+15*(q

... still have a special condition to prevent creating walls in front ... changed the maze generation slightly, to avoid creating locked rooms everywhere ... solve the dead-ends problem for the West border. We may ... 1:
FOR r=1 TO 31:
FOR s=1 TO 21:

Replace
[code]
FOR e=-1 TO 1 STEP 2:
LET w=m(q-e*z*(1765*(z*z=1)-1)/42)*m(q)=0:
PLOT 128+a*e,88-d-f*w:
POKE m(q)*n,8+15*(q

[QUOTE=Dr BEEP;253279]Replace
[code]
FOR e=-1 TO 1 STEP 2:
LET w=m(q-e*z*(1765*(z*z=1)-1)/42)*m(q)=0:
PLOT 128+a*e,88-d-f*w:
POKE m(q)*n,8+15*(q

[QUOTE=Dr BEEP;253279]Replace
[code]
FOR e=-1 TO 1 STEP 2:
LET w=m(q-e*z*(1765*(z*z=1)-1)/42)*m(q)=0:
PLOT 128+a*e,88-d-f*w:
POKE m(q)*n,8+15*(q

This is my last opportunity to post for four days or so, so ... [QUOTE]
FOR r=1 TO 31:
FOR s=1 TO 21:

... /> 3 FOR r=1 TO 9:
4 FOR c=1 TO 9:
5 RESTORE :
6 READ n,p ...

... code]
1 RANDOMIZE :
POKE 23693,7:
DIM m ... (66)=1:
FOR r=1 TO 10:
PRINT ... ;"0% ready":
FOR c=1 TO 15:
RESTORE ... :
READ n,p,z ... ,s,q,e:
POKE n*m(p),23:
...

... br /> FOR f=-149 TO 0:
RESTORE :
READ n,m(608 ... ),p,z:
POKE n ... p),m(p+z):
POKE 22528+p,48-(f=0 ... ):
POKE 22528+p+z,48:
POKE (k

... br /> FOR f=-149 TO 0:
RESTORE :
READ n,m(608 ... ),p,z:
POKE n ... p),m(p+z):
POKE 22528+p,48-(f=0 ... ):
POKE 22528+p+z,48:
POKE (k

... speed you can wait for the maze to complete.

... LET n=23620:
LET m(708)=1:
FOR f= ... 0*USR 7766 TO 149:
... LET y=INT (RND*10+1):
POKE n ... 4+1)-68:
POKE n-n*m(i+d+d),7 ...

... pending issue was to decide if we would use POKE instead of ... PRINT according to bigjon's suggestion ... game, now renamed to [B]"Labyrin3D"[/B] to help distinguish it from ... )=1:
FOR r=1 TO 31:
FOR s=1 TO 23:

This was my attempt to implement "3D Maze" using algorithm ... ):
READ n,d,q,p:
FOR f=1 TO 25:
NEXT f:
FOR z=-1 TO 0:
LET q ... /> LET m(q)=1:
POKE 22464+q,48-(p=q ... m(q+d+d):
POKE (m(q+d+d)=0 ...

... can be easily modified to support this idea. For instance:
... 7766-1:
FOR f=1 TO 25:
LET ...
NEXT f:
FOR g=7 TO 8:
LET p ... LET m(p)=1:
POKE 22462+p,g:
NEXT ... p+d+d):
POKE (m(p+d+d)=0 ...

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

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

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

... a new release candidate for [B]3D Maze[/B], ... m(735):
FOR f=-149 TO 0*USR 7766: < ... br /> RESTORE :
READ n, ... ,j,z:
POKE n,3+3*(m(p)=0 ... p+z):
POKE 22528+p,48-(f=0 ... ):
POKE 22528+p+z,48: < ...