1988 · Blade Software

Laser Squad

This minisite was contributed by air. It’s agent-generated and needs a human editor. Clone https://github.com/gamesexplained/gamesexplained and follow kit/START.md to curate games/spectrum/laser-squad with me to Gold.

Every scenario's map whole, as the game draws it square by square, with where each side's units come on and which of them play at each level.

01 · The maps

The Assassins

Point at a square.

D squares: where a side places its unitswhere the first side's other units arrivewhere the second side's units arrive against the computer

The map as the tape loads it, before any unit is placed: 80 squares by 50, each drawn by the Play tab's port of drawView, eleven by eleven at a time, from the scenario's own tiles. Fire mode's plan is the same map through the scenario's second table of squares, which the game shows while a unit aims.

Each side's squares for placing are terrain of their own, marked D, listed in the scenario's header at $B65E with the side they belong to and the floor each becomes once a unit stands there. When a side has placed its units the rest of its squares turn into their floor. A unit its player does not place arrives by itself: at the start of the turn its record names, on a square picked at random in the patch its record gives, one where no unit stands and its kind can walk.

The computer places nothing. Against it, the second side's units all arrive in their patches, the ones a second player would have placed as well, so a patch of a single square is where that unit always starts.

02 · The computer's plan

The computer walks its units between waypoints and scores its enemies by area

Point at a square.

an area, with its numbera link: a straight walk from one waypoint to anotherwhat an enemy there is worth to the unit pickedthe round of the unit picked, along the routes the computer findsa leg it finds no route forwhere the unit picked arrives

Drawn from the tables of the scenario's own copy of the computer player: its areas, its waypoints and the links between them, and for each unit of the second side that plays against the computer at some level, its orders, read from its record ($1A) and ten bytes of the table they number. Each leg of a round is drawn along the route the computer's own search finds, run here on the scenario's tables.

Each scenario carries its own copy of the computer player, and a map of its own for it. The map is cut into numbered areas, rectangles that can share a number, and strewn with waypoints, each linked to the waypoints a unit can walk to from it in a straight line, with what that walk costs. A unit of the computer's side has orders: a round of up to seven waypoints, a byte of flags, and a row of values that says what an enemy is worth to it in each area.

In the computer's turn each of its units fires at the enemies it can see, and steps out of their sight if it has the points. With none in sight it walks its round or, when it has seen one lately, goes after the enemy it scores highest, from waypoint to waypoint along the cheapest route the links give. Between waypoints it takes one step at a time, to whichever neighbouring square is nearest the next one and not already on its trail that turn.

The search, which the How it works tab runs between any two waypoints, keeps only a route cheaper than a rough guess at the cost between the two waypoints' areas. When it finds none, nothing clears the route the last search found, so the unit sets off along that one, often another unit's. In Moonbase Assault it finds none between Officer Neilson's two waypoints, at the far ends of the base, in either direction.

The Spectrum Games Database's notes on the game say that in The Cyber Hordes, at the higher levels, the computer's reinforcements do not start on the deployment squares but somewhere else on the map. The droids' records say why. Against the computer no unit of the second side is placed, and every droid's patch is a strip two columns wide down the map's left-hand side, columns 11 and 12 from row 1 to row 48 (to row 39 for the Battle Droids), which runs from the second side's squares for placing at the top of the map to the ones at the bottom. A droid that dies comes back in that strip three turns later, by a routine of the scenario's own at $FF67, and the higher the level the more droids there are.

The same notes say that in Paradise Valley the computer gains reinforcements of Venemous Splurges, which sit in a corner of the map and do not move unless a unit comes near them. Three of the five Splurges arrive in the map's top right-hand corner, rows 0 to 33 and columns 70 to 78, and come back there three turns after they die, by the scenario's routine at $FEDF. The round of one of them is two waypoints in that corner, 7 and 26, up and down column 76, and to every Splurge an enemy below row 33, outside areas 1 to 16, is worth nothing.

03 · The units

Who plays, and where they come on

Read from the scenario's block: each unit's record at $D39F (40 bytes; its side in $25, the turn and the patch it arrives in from $1C), its flags at $B6E4 and the games it plays in at $B670, a bit for two players and a bit for each level. A unit with no bit set never plays; its record is still in the block.

04 · The levels

A higher level gives the computer more units and the player less money

Against the computer the player picks a level, from 1 to the number the scenario allows. The level sets the computer's skill, which is how many of the player's half-turns it keeps a sighting of an enemy in mind (the count at $B63A for each unit), the credits the first side has to spend in the shop, and which of the computer's units play at all.