... at home, or maybe not. ... += 0x03;
bmp *= 2;
}
return ... scroll_mode = 1;
install_next_char(mess);
scroll_count = 0;
... ld hl,20*256
call zx_cyx2saddr_callee + 5; ASMDISP_ZX_CYX2SADDR_CALLEE

... m not bothered about resubmitting or anything, rather I'm ... ,b,c,d,e: DATA 1,2,3,4,5

is ...
LET a=1: LET b=2: LET c=3: LET d=4 ... Finally

BORDER 0: PAPER 0: INK 7: CLS
< ... like

PRINT #1;AT 0,0;s;

Anyway ...

...
static uint amp0[] = { 0, 0, 0, 0, 32768, 32768, 32768, 32768, 32768 ... /> for (i=-4; i!=5; ++i)
printf("%d ... 0 times = 0%
-3 : 9 times = 0.9%
-2 : 14 times = 1.4%
-1 ... other ranges than 0 or 1 will be uniformly ...

... similar way to coin flipping or drawing straws to randomly select ... c=INT (RND*3)+1:
FOR j=1 TO 3:
PRINT j ... 5*(1-t)):
LET m=r*(y=1)+p*(y=2)+s*(y=3 ... *n):
PRINT #1; FLASH 1;"Key!":
PAUSE 0:
NEXT l ...

... f r. j u l. 2 0. 2 0 0 7.
* version zero. ... otherwise, get page from upper 5 bits of PC.
... ori.w #$FF80,d3
or.w d3,d2
DIRECTION ... the command.
asr #$1,d0 we have everything we ... /> beq ISZOP
cmpi #$3,d0
beq DCAOP

... (this is just "g_land" or "&g_land[0]") and this will return ... ,4,5,4,4,4,4,
4,3,2,2,3,2,2,3,4,
4,3,2,1,0,1,2,3 ... it is owned by someone or draws a cursor around the ... the function waits a second or two for button presses from ...

... c=(m>0)*((c
$=" ")*(2*(k$="r")+3*(k$="c")+4 ... *
(k$="i")+5*(k ... (c)+1/(7-c): LE
T s=0: FOR i=2 TO 5 ... $: NEXT e: DATA 9,9,20,0,1,0[/CODE]

The code ...

... c=(m>0)*((c
$=" ")*(2*(k$="r")+3*(k$="c")+4 ... *
(k$="i")+5*(k ... (c)+1/(7-c): LE
T s=0: FOR i=2 TO 5 ... $: NEXT e: DATA 9,9,20,0,1,0[/CODE]

The code ...

... code] 1 LOAD "" SCREEN$
2 LOAD "" CODE : RANDOMIZE USR 0[/code] ... that dare to edit or even try to start ... />
[code]
1 LOAD "" SCREEN$
(in ... the Speccy fiddles with 5-byte numbers is depicted ... 232 003 000[/B] ([B]3[/B] * 256 + [B ...

... p=p+s*(a(5)>0)*(.5-d-(a(5)=0))

... LET p=p+s*(a(5)>0)*(.5-d)
[/QUOTE]
1 DEF FN v(o$)=2*(o$="r")+3*(
o ... c)+1
/(7-c): LET s=0: FOR i=2 TO 5: ... +s*(a
(5)>0)*(.5-d): LET p=(p ... 0)*p: LE
T m=m-c+((p>20…

... sounds interesting!

Or you could try to improve ... CODE]
IF x+3-p+g/20 THEN
[/CODE]
0;s,,AT b+1,a;" ";AT b,a;"| "(1+h+(b=0));AT 20 ... ,p-1;" ^ ":
IF x+3-p+g/20 ... "(1+h+(b=0));AT 20,p-1;" ^
": IF x+3-p+g/20 ...

... 3 positions replacing this:

[CODE]
IF 1-(a>1 ... )*(p(a)=p(1)) THEN
[/CODE ... /> [CODE]
IF a=1 OR p(a)-p(1) THEN
[/CODE ... 5 positions replacing this:

[CODE]
(1+((w-1)*INT (RND*2 ...

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

[CODE]
IF 1-(a>1 ... /> [CODE]
IF a=1 OR p(a)-p(1) THEN
[/CODE ... 5 positions replacing this:

[CODE]
(1+((w-1)*INT (RND*2 ...

[CODE]
1 DIM i$(3,7):
FOR g=1 TO 3:
LET ... " ":
LET q=(b=1)*(m>0)*2>ABS (a-m ... /> PRINT AT 0,m;"" AND m,,AT g-1,x+3;" ";AT g ... *h;AT 20,p-1;" W ":
IF x+3-p+g/20 THEN ... LET i$(k,l)="":
LET s=s+h+5 ...

... 's really between method (1) and method (2).

... maze, I tried bias=0.3, and it plays quite ... following advantages:-

1) The ghosts move around the ... 13 again.

5) If we can get the ... t know if you agree or not? But my choice ...

... try combining both methods 1 and 2 into the same program ...
[CODE]
1 BORDER 0:
POKE 23693,1:
DIM p ... q(6):
FOR l=0 TO 4:
RESTORE :< ... a:
LET m$(p(1)+1)="":
LET k=CODE ... 2:
LET g=p(a):
LET d=SGN (RND-.5)*(1 ...

... version 1:

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

... version 1:

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

... 03":

[CODE]
1 DEF FN z$(x)=CHR ... $ 22+CHR$ (x/7+.5)+CHR$ (x-7*INT ( ... x)+CHR$ (FN m(x)/2+144):
DIM m$( ... ),g:
FOR z=-5 TO 18:
READ n ... /> POKE USR "a"+z+5,n:
NEXT z:
2)+(b>2))=0)+(a>2):
LET m$(z+d+d)="($"(1 ...

... a type-in book about 20 years ago. (It wasn't ... the BASIC listing or the game itself for 20 years. So this ...

... code:

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

... }

// bit 1 = grey mountains
// bit 2 = black mountains
3);
memopi(buff + 41, gfx_potentialPixel[g_uchar0], 6, 1); // OR production into ... // +0 bit 7 = 1 for invalidated, bit 6 = 1 for removed, bits 5:0 = ...

... sp1_CreateSpr(SP1_DRAW_OR1LB, SP1_TYPE_1BYTE, 3, gfx_playerSprite[type], 128);< ... BTU*7, 0L, 1000L, 0, 4, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
[/ ... creates

1. an "OR" sprite (SP1_DRAW_OR1LB - a ... />
5. sprite exists on ...

... COMMODITY_FOOD 0
#define COMMODITY_ENERGY 1
#define COMMODITY_SMITHORE 2
#define COMMODITY_CRYSTITE 3 ... /> return 4;

return 5;
}

uint ... of a "struct player", or in C a "struct player ...

... /> 'r' is the player number 1 or 2:-

[code]
FOR ... this.

[quote]
3. Instead of this:

1;AT y(1,i),x(1,i);"o"; INK 2;AT y(2 ... /> [CODE]
DATA .5+RND*30-p,.5+RND*20-q,...,p+e ...

... a replacement to DIM a(2). However, it only makes ... if you need indexing it, or if you can use it ... variable 'n' alternates between 0 and 1 on each iteration is used ... DIM c(53)
...
20 LET b=53
30 ... ;AT y*3,x*3;CHR$ c(a);AT w*3,v*3;CHR ...

... a replacement to DIM a(2). However, it only makes ... you need indexing it, or if you can use it ... c(53)
...
20 LET b=53
30 ... :
40 IF (a52 OR a=b) THEN GO TO ... y*3,x*3;CHR$ c(a);AT w*3,v*3;CHR ... AT w*3,v*3;" " AND s;AT 21,0;"Lives:";l ...

... positions:

1. Change the assignment order replacing ... [CODE]
POKE (t0)*p,20:
[/CODE]


3. However, we still have ... , and the last 2 PRINT statements can be ... room to reintroduce the INK 5 again.

... :

1. Change the assignment order ... [/CODE]

2. Then replace this
... [CODE]
POKE (t0)*p,20:
[/CODE]

[QUOTE]
3. However, we still have to ... [CODE]
LET m=.5-t*RND:
[/CODE]< ... condition [code]0

... br /> p current player number (1 or 2)
q
r< ... player entered 0,0).

[code]
LET f=0:
... =3-p:
[/code]
Alternate player number in sequence 1,2,1,2 ... ....

[code]
POKE n,5:
...