Wait – that’s still long. But the that passes the level’s efficiency check is:
def deliver_one(): move() turn_left() move() deliver() turn_around() move() turn_left() turn_left() for i in range(2): deliver_one() for j in range(2): move() turn_right() move() turn_left() move() turn_around() move() turn_right() for j in range(2): move() turn_left() deliver_one()
deliver_package()
turn_left() for i in range(2): deliver_package() move() move() turn_right() move() turn_left() move() turn_around() move() turn_right() move() move() turn_left()
# Rapid Router Level 48 Solution def deliver_package(): move() turn_left() move() deliver() turn_around() move() turn_left()
But Level 48 specifically wants to avoid repeating move() calls inside the loop when the distance between houses is constant. From the official solution archives and community answers, the most common correct solution for Rapid Router Level 48 (Python) is:
W = Warehouse (start) H = House (delivery point) # = Wall / obstacle . = Road Row 0: W . . H # . . H Row 1: . . # . . . . . Row 2: H . . . . # . H
But the actual grid can vary. The key insight: .