Program listing on 48K Spectrum.
1 PAPER 7: CLS : READ w,d,c$,l$,s$: DIM o$(8,w): FOR x=1 TO 8: READ k: POKE USR "b"-x,k: READ o$(x): NEXT x: FOR t=1 TO 4: LET y=8: FOR a=1 TO 8: LET d=1-d: LET o$(a)=o$(a,w+(1-w)*(a=1) TO w*d)+o$(a,1 TO w*d-d)+o$(a,2 TO w-w*d)+o$(a,1 TO 1-d): POKE 23693,CODE "qzzzqSSq"(a)-81: PRINT AT a,1;o$(a): NEXT a: LET k=113-CODE INKEY$: LET x=x+(k=1)*(x<w)-(k=2)*(x>1): LET y=y+(k=16)*(y<8)-(k=0): PRINT AT y,x; INK 3; PAPER 8;CHR$ 144: BEEP .01,y<5 IF o$(y,x)=" ="(1+(y>1)*(y<5)) THEN POKE (y>1)*23620,12: BEEP .1,t*4: LET o$(1,x)=CHR$ 144: NEXT t: PRINT AT 8,3;"You Won!": DATA 16,0,"OOO","==="," ",129,l$+" "+l$+" "+l$+" "+l$,219,l$+s$+l$,-1,o$(2),189,s$+o$(2),60,"",126,c$+s$+c$+s$+c$,189,o$(6),153,"" |
Keys - q,o,a,p
You have to get a family of four toads safely across the two-lane highway avoiding the traffic, and across the river by hopping on the logs.
There are 4 "gaps" on the far side of the river and only one toad will fit in a single gap.
You only have one life.
To complete the game, guide all four toads to safety, and receive the "You Won!" message.
Einar Saukas applied many optimizations to the above code, finding enough program space to allow for a UDG for the toad and in-game sound amongst other improvements.