... .
[code]
1 CLS : LET b=12: ... ): FOR l=2 TO 11: LET a$(l,2 ... p(6): FOR m=0 TO 1: LET j=SGN ( ... +SGN (RND*(k=3)-SGN (k-1.5)/2): LET ... g=1 TO b: PRINT AT g,0; INVERSE 1;a$( ... (e+6)-1: LET l=1+(p(b)=11)*q: NEXT ... hound and the direction L or R
Example : ...

... 3 positions replacing this:

[CODE]
IF 1-(a>1 ... )*(p(a)=p(1)) THEN
... [CODE]
IF a=1 OR p(a)-p(1) THEN
[/CODE ... />
[CODE]
(1+((w-1)*INT (RND*2)))
[/CODE ... />
[CODE]
(1+(w-1)*(RND

... 2 TO w*(1-d))+o$(a,1 TO 1-d):
... 3 positions replacing this:

[CODE]
IF 1-(a>1 ... )*(p(a)=p(1)) THEN
... [CODE]
IF a=1 OR p(a)-p(1) THEN
[/CODE ... />
[CODE]
(1+((w-1)*INT (RND*2)))
[/CODE ...

... try combining both methods 1 and 2 into the ...
[CODE]
1 BORDER 0:
POKE 23693,1:
DIM p ... CLS :
FOR a=1 TO 10:
LET p ... a-(a=1):
PRINT 'm$(a*w-11 TO a ... *w);:
NEXT a:
LET m$(p(1)+1 ... d=SGN (RND-.5)*(1+11*(RND

... version 1:

[CODE]
1 BORDER 0:
POKE 23693,1:
CLS :
DIM p(10):
FOR l=0 ... a-(a=1):
PRINT AT a,0;m$(a*w-11 TO ... a*w):
NEXT a:
LET m$(p(1)+1 ... =(a=1)*((k=1)-(k=2)+w*((k=16)-(k=0)))+SGN r*(1+11 ...

... version 1:

[CODE]
1 BORDER 0:
POKE 23693,1:
CLS :
DIM p(10):
FOR l=0 ... a-(a=1):
PRINT AT a,0;m$(a*w-11 TO ... a*w):
NEXT a:
LET m$(p(1)+1 ... =(a=1)*((k=1)-(k=2)+w*((k=16)-(k=0)))+SGN r*(1+11 ...

... code:

[CODE]
1 POKE 23693,7:
LET ... /> PRINT "$";c:
FOR r=1 TO 9:
LET p ...

... br /> p current player number (1 or 2)
q
...
[code]
POKE n,11+p:
INPUT b,a ... player entered 0,0).

[code]
LET f=0:
... move

(3) To find if there are ... code]
POKE (t(w)=3-p)*n,22:
[/code ...

... br />
4 / 3 *pi *((r + .05)3 -r^3) * 11.35 (in g ... /> 11.35 * 4 / 3 * pi * (r^3 + 0.15r^2 + 0.0075r + 0.000125 - r^3)
3 * pi:

11.35 * (0.15r^2 + 0.0075r + 0.000125) = 1.01 ... /> r approx = 1685cm.

or about 16.85 metres

... adress of match
;offset == 0 is reserved as EOF
;2 bytes as 11 bits
;3 bytes as 13 bits ... until we found a '1' and count passed '0'
;the passed ... . Dont remember it is exact 1:1 copy or it is somehow changed.

Here are the improvements I mentioned:

[CODE]
1 READ n,a$:
FOR c=0 TO 8:
POKE USR "b"-c,SIN (c/3)-1:
POKE USR "c"-c,129:
LET q=INT (c/2)+1:
CIRCLE 91,92,CODE " $LS "(q):
POKE (c

... positions:

[CODE]
1 RANDOMIZE :
LET a$="":
CLS :
FOR k=1 TO 4:
CIRCLE 131 ... br /> LET e=k=2 OR k=4:
PRINT AT ... 6+10*(k>2),11+10*e;k:
... FOR p=-23 TO 0:
PLOT 232*e-88 ...

... limit:

[CODE]
1 RANDOMIZE :
DIM m(2e3 ... +42)=1:
FOR r=1 TO 19:
FOR s=1 TO ... 19:
READ i,w,m(i+38*(r.3 OR ...

... suggested:

[CODE]
1 DIM m(3e3):
LET ... )*2+1430)=USR 7766^0:
FOR r=1 TO 31:
FOR s=1 TO 23:
READ p, ...

... yours:

[CODE]
1 CLS :
DIM m(3e3 ... 7766^0:
FOR r=1 TO 31:
FOR s=1 TO ... :
LET d=INT (d-.3*o*d):
FOR e ... =-.5 TO 1:
LET w=INT (.35 ... a)*e,w:
DRAW 0,d+d:
DRAW (a ...

... /> 130 border 0:paper 0:cls:let l=0:let j=11
140 ... let k=16:let w=1 ... ,31,10,17,14,31,11
320 data 17,21 ... ,15,14,0
330 data 11,14,7,0,10,14,0,8 ... 6:let l=l+1:let n=11:let m=fn r ... =g+3*p-9
430 if g=0 or g=2*k-1 ...

... let t=0
190 let m=fn r(11)-6:let ... blocks
110 border 0:paper 0:ink 7:cls
... /> 120 cls:let v=0:let h=0:inverse 0
130 for ... /> 220 data 10,7,3,9,1,16,3,23,10,25,17 ... br /> 260 if s=9 or q(9)4 and q ... br /> 410 if s=9 or q(9)p+2 then ...

Dos came on 1 floppy, by the end dos ... remember how many floppies Windows 3.0 came on. It was preinstalled ... Adaptec SCSI cards working under 3.11 and spending hours manually setting ... SCSI only allowing 7 or 11, Network cards preferring 11 and Windows objecting ...

... "
80 for c=1 to 10
90 ... /> 240 if v1>1 and v16)
250 ...
260 if w=3 then goto 320
... let m=m-1
370 if m=1 or v50 then ... "
20 let s=0
30 let m= ... 100 let d=int(rnd*3-1)
110 if l+d20 ...

...
230 print:print "retreat or go on (r/g)"
1 then let rm=0
290 let m=m+int(rnd*3+1 ... /> 420 let ty=int(rnd*3+1)
430 let w$=g ... /> 10 let ts=0:let i$="0":let sp=3
20 let ... "
280 let x=0:let y=0:gosub 560
290 ...

...
900 if (ob=8 or w$="on "+o$(8)+" ") then ... f(11)=0 and l(7)=25 then let f(11)=1:let f(3)=0 ... :let l(3)=0:let m$="a ... return
1250 if ob6 or l(6)25 then return ...
1340 if (ob=19 or ob=17) and r=24 ...

... t1
70 print "elevation (0 to 90) ?"
80 input ... int(rnd*11-5)
40 let s=-int(rnd*3+1)
100 if s=0 then print "level"
110 ... /> 550 let w(e(h)-1,h)=0
560 if v ... let c=1 : gosub 350
190 if f(j)=0 or y ...

... />
[code]1 CLS : DIM r$(32): LET p=11: LET s ... $(p+8)="I": POKE 23692,0: LET f=PEEK 23688: LET ... g=PEEK 23689: FOR a=0 TO 255: POKE 23688,f ... ): READ f,g: PRINT OVER 1;AT 0,s;" W ": READ r ... 23688,PEEK 23689,"","",p-1*(p>1)+RND*3-1*(p>21 ...

... Is the code publicly available, or do we still need to ... LET a=23688: LET p=11: LET s=14: LET r ... 8)="I": POKE a+4,0: POKE a+5,5: LET ... LET g=PEEK (a+1): FOR c=0 TO 255: POKE a ... f,g: PRINT OVER 1; INK 6;AT 0,s;" W ": READ ... >=p)*(s1)+INT (RND*3)-1*(p>21),"I","I ...

... for the last month or so. Although we ... 0: LET c=14: LET x=3
20 FOR f=1 ... f: PRINT AT 20,11;"SCORE:";p
40 ... 3: IF a(y-1)>x-3 THEN LET a(y-1)=x-3 ... doesn't look empty? Or perhaps something else at ... the current level instead. Or you can print both ...

... 2 - £1.00
Uglifruit 11 - £5.50
Gareth.C 1 - £0.50 ... Wareing 3 - £1.50
Graeme.M 1 - £0.50
Ronan 1 - £0.50
If you dont want paying (or you arent bothered as it ... dont want your name shown or want another name eg a ...

... /> 11 DIM W$(2,9): LET LK=0
15 FOR X=1 ... N$(2)="SOUTH": LET N$(3)="EAST": LET
N$(4 ... /> 50 LET RM=1: LET IC=0: LET LZ=0: LET HP=200 ... ": PRINT "TYPE ";
INVERSE 1;"HELP"; INVERSE 0;" FOR CLUES": GO TO ...

... /> 11 DIM W$(2,9): LET LK=0
15 FOR X=1 ... N$(2)="SOUTH": LET N$(3)="EAST": LET N$(4)="WEST ... /> 50 LET RM=1: LET IC=0: LET LZ=0: LET HP=200 ... W$(1)=A$( TO X-1): LET SI=X+1: LET YI=1
1;"HELP"; INVERSE 0;" FOR CLUES": GO TO ...

... /> 11 DIM W$(2,9): LET LK=0
15 FOR X=1 ... N$(2)="SOUTH": LET N$(3)="EAST": LET N$(4)="WEST ... /> 50 LET RM=1: LET IC=0: LET LZ=0: LET HP=200 ... W$(1)=A$( TO X-1): LET SI=X+1: LET YI=1
1;"HELP"; INVERSE 0;" FOR CLUES": GO TO ...

... array:
DIM A(1, 3) => {{0, 1, 2, 3}, {4, 5, 6, ... /> FOR c = 0 to 10 step 0.1
NEXT c< ... place. So if two (or three) contiguous blocks are freed ... "He" to mystr$(10 TO 11) if there are
... />
LET mystr$(10 TO 11) = "Hello world"
[/CODE ...