Pick a Path Red by Out Bush

Pick a Path Red

Introduction

Red has to set out on a journey, which will determine if they are successful or not depending on which Path

they take, however Red may also encounter Aggressive Residents which spring out in front of you, if you try

and fight them it will be fatal for Red, however if Red chooses to Dodge around, the Aggressive Resident

only has 50/50 chance of striking out at Red, though Red if struck, Red can only takes a couple of blows.

DSK image files.

Controls

Use the Cursor Keys Left, Right and Up Arrow to move Red forwards.

Making this game

I've written this game for the BASIC 10 Liners Competition for the EXTREM-256 category, the game has

some DATA in it (not Machine Code), which is converted back to construct the Path ways. During the

initialization phase, the Aggressive Residents are randomibly scattered around the Path Ways, which are

represents by the number 2s and at the end numbers 3,4 & 5 are used to determine if Red has travelled the

correct path or is simply been unlucky. I've been describing this game as a Role-Play type game as all the

Luck needs to go Red to be successful.

Problems Encountered

Thanks to the Atariage forum, I could improve on some of my BASIC coding habits and save some

keystrokes, which has allowed me to simplify a number of WHILE..WEND statements to act the same way as

IF..THEN statements.

I also needed a routine to select 1s or -1s, so when an Aggressive Resident pops up, if the player presses

Left or Right has the Aggressive Resident decided to attack where Red decides to move and if so, to take

action. Thanks to the Atariage forum again for finding some code which works on my Amstrad CPC.

Another problem I had relates to the 3,4 & 5 numbers I have to select at the end of the Path. Each number is

Randomibly selected and then placed on 3 places, however numbers can only appear once and after looking

at a similiar routine I'd used on another game I made, worked out a way, so numbers are only selected once,

this is critical in changing the value at the end of each path and where the luck comes in as part of the game.

Example of the game

11111111111111

11111111111111

11111111111111

11111111111111

11111111111111

11111111111111

11111111111111

14111113111511

00001000010200

00001000012000

00210000001000

00010020000100

00100000200100

00100000201000

00010000201000

00012000010000

00010002100000

00100000100002

00100000010020

00012000010000

00010020001000

00201000001000

00000100001200

02000100010000

00021000010000

00001020100000

00010000100200

20010000100000

00210000010000

02010000001000

00001000002000

00021000001000

00010020001000

00000000210000

00010020010000

# Key '0' = Space, '1' = Wall, '2' Aggressive Resident, '3' Safe Exit, '4' Unsafe Exit, '5' Unsafe Exit #2