# Possible moves: north, east, south, west # Represented as (delta_x, delta_y, action, facing) moves = [ (0, 1, 'north', 'move_north'), (0, -1, 'south', 'move_south'), (1, 0, 'east', 'move_east'), (-1, 0, 'west', 'move_west') ]
. This level often requires using a combination of loops and conditional "if" statements to navigate the van safely to the destination. Solution Strategy rapid router level 48 solution
W = Warehouse (start) H = House (delivery point) # = Wall / obstacle . = Road # Possible moves: north, east, south, west #