1 DIM m$(1640):
 READ p,f,b$,n,s,m:
 POKE n,12:
 LET s=s+9:
 LET f=f+1:
 LET p=328*INT (RND*3)+2*INT (RND*3)+325+2*s/3:
 POKE (m$(p)=b$)*n,6:
 LET d=163*(RND<.3)+1:
 LET d=2*d*(m$(p+d+d)=b$)-d:
 POKE (m$(p+d+d)<b$)*n,6:
 LET m$(p+d)=b$:
 LET m$(p)=b$:
 PRINT AT 0,0;INT (f/1.62);"%":
 POKE (f<163)*n,4+(f<s):
 LET b=657:
 LET x=1:
 INPUT "Speed? (1-slow 9-fast)";h:
 CLS :
 LET x=x+h/10:
 LET k=CODE INKEY$-48:
 LET d=(k=8)-(k=5)+m*((k=6)-(k=7)):
 LET b=b+d*(m$(b+d)=b$):
 LET c=INT (b/m):
 LET e=b-c*m:
 FOR g=1 TO 6:
 PRINT AT g,5;m$(g*m+e-6 TO g*m+e+6):
 NEXT g:
 LET q=ABS (x-e)<6:
 PRINT AT 3,11+(x-e)*q;">" AND q;AT c,11; PAPER 2;"*":
 POKE (e<111)*n,19-4*(x>112):
 PRINT "You won":
 DATA 657,USR 7766*0,CHR$ 143,23620,9,164

You were captured but you managed to escape. You jumped in the first car to escape the town. Unfortunately for you your enemies released a pigeon with a message that will fly to the other side of the town to signal your escape. The car drives faster than the pigeon flies, however there is only one way out of town and the pigeon flies the shortest route whereas you must follow the road to reach the other end of town.
Can you beat the pigeon???