Does he reach the door at all? The important point is that you cant walk into the door you have to action command (4) it when facing it. You want to have a subroutine to jump to when you need to check for viewing a door, its difficult to arrange the code to have a single in line door check section, I needed to check in 2 different places. I had the issue of not checking for a door after all previous actions that could necessitate that and got stuck looping the maze walking past the door every time.

Heres my actual code if this helps with any clues

he does not. in fact he gets stuck at the start strip of the first maze. and remember, i'm on the savebreaker version. (i got past it by editing levels.txt) also, starting at the level "symphony counter", the campaign is buggy as heck

the maze should be fine to solve, just fallow the game instruction to the letter to build the machine you need to solve the maze.

Then doing the code strategy of using jumps and labels to be able to create a primitive function i would call them.

So encapsulate with example, function 1, like : label f1
and inside this at the end, close the function with jump to somewhere, usually the place you are going to jump should be right after you call the jump to enter this function.

that way you make your code jump to where it needs and come back to the line after the line it called for the function jump.

anyway, don`t remember now if the maze was using the leg or the overture, it matters not the strategy stays the same.

I could code a way to count the coins and only get out of the maze when have collected all the coins.

So it kind needs to get to the door a second time and in the first time it should look up for how many coins it has and only enter the door if the right amount is correct.
Because the amount of coins are all the same it can easily be done.

Also make use of constants, that will help you to code what you need.

Then what you have to do basically is to focus on functions and create function to each thing you need to get it done. The routine for the walking, you check if there is wall , look to the right or left and walk if you can, essentially the strategy is to fallow one of either sides of the wall, so you make a routine as such the robot will fallow that wall always.
Now inside that you need to make a call to test what you see, if it is a wall you call the next function which will be the nest step of walking, if it see a coin it needs to walk toward it, count that coin in saving it in a register, adding 1 to that specific register designed to be the counter of coins, then jump back to the walking process again.
if it is a door, you need to make a call for a function to verify if you have all the coins, if so you enter the door, if not go back to walking. and that is that.