Your quest is to find three bombs, hidden throughout the castle's rooms and corridors. They were placed by an evil wizard who is trying to destroy the castle.

The article for this game can be found on page 52 of Compute's Gazette Issue 12 (June 1984)

The continuation of TASing games from my all-time favorite magazine, Compute's Gazette. This makes my 35th TAS from this series.

This was one of the earlier games that I had experienced. The article's presentation was very interesting to me, and I ventured into typing it in. I enjoyed playing it quite a bit. Even today, I have checked out its code and thought of trying to re-write parts of it to speed up the slow configuration of the layout.

Previous Compute's Gazette submissions include (In order of submission):

This game has no selection of difficulty, but the ending is absolute and clear. The task is simple...find the three bombs and the game is over.

After having gone through a number of B.A.S.I.C. written games, I have discovered a number of strategies to help force the RNG to my liking. Even though this technique helps out tremendously, the placement of the items are still cannot be controlled to produce exact locations of items. So, since this game is very short, I have ran multiple scenarios and ran across a situation that allowed for me to get the bombs without searching for keys, jumping over pits, or having to fight the blind guardians...all within the shortest route that I found. So in essence, this is a "seeded RNG" run that was applied after the loading of the game to minimize the longevity of the "Load" command....where it was buffered to be faster. It does not alter the game code at all.

That command is

The only run that I could find, besides the VIC-20 version.

Darkman425: Claiming for judging.

Darkman425: Usually you don't find grenades in a castle. Anyways, the RNG adjustment for the grenade placement seems good for that fast completion.

Accepting to Standard.

despoa: Processing...