Answer: Debug the Robot #340

Here’s the bug

Step 3 is an extra Forward that shouldn’t be there. Beep walks one square too far.

Did you find a different fix that also gets Beep to the battery? That counts too! There is often more than one way to fix a bug. The important thing is that you tested it step by step.

The fixed program, with Beep's route to the battery drawn as an orange line.
With the bug fixed, Beep reaches the battery.

The fixed program

  1. Turn right
  2. Forward
  3. Forward
  4. Forward
  5. Turn right
  6. Forward
  7. Forward
  8. Forward
  9. Forward
  10. Turn left
  11. Forward
  12. Forward
  13. Forward
  14. Turn left
  15. Forward
  16. Forward

What the buggy program did

Here is what happens if Beep follows the program with the bug, step by step. Beep bumps into a wall.

StepCommandBeep is now atFacingNote
1Turn rightcolumn 1, row 7up
2Forwardcolumn 1, row 6up
3Forwardcolumn 1, row 5up
4Forwardcolumn 1, row 4up
5Forwardcolumn 1, row 4upBump! A wall or the edge is in the way.

Check it with Python

This Python program pretends to be Beep. It follows the fixed program and checks for walls on the way. In Python, squares are counted from 0, so column 1, row 1 is (0, 0).

program = "RFFFRFFFFLFFFLFF"
walls = [(0, 2), (1, 1), (1, 5), (2, 1), (2, 6), (3, 1), (5, 2)]
width, height = 8, 7
x, y, facing = 0, 6, "left"

moves = {"up": (0, -1), "right": (1, 0), "down": (0, 1), "left": (-1, 0)}
turn_left = {"up": "left", "left": "down", "down": "right", "right": "up"}
turn_right = {"up": "right", "right": "down", "down": "left", "left": "up"}

for step in program:
    if step == "F":
        dx, dy = moves[facing]
        if (x + dx, y + dy) in walls or not (0 <= x + dx < width and 0 <= y + dy < height):
            print("Bump! Beep hit a wall at", (x, y))
            break
        x, y = x + dx, y + dy
    elif step == "L":
        facing = turn_left[facing]
    elif step == "R":
        facing = turn_right[facing]

print("Beep finished at", (x, y), "facing", facing)

When you run it, it prints:

Beep finished at (2, 0) facing left

The battery is at (2, 0) in Python’s counting, so Beep made it! Try putting the buggy program, "RFFFFRFFFFLFFFLFF", back in and see what Python says.