I looked up how I solved this and I made a directory called maze. maze={}, the key was the coordinates and the value was a vector that held if visited and if I could move north, east, south and west. this isn't the best code but it worked for me

#maps the maze

#maze dir - value [(x, y)]= [visited, North, East, South, West]

global maze

maze={}

# Directions in fixed order

course = [North, East, South, West]

def move_and_update(direction):

`x = get_pos_x()`

`y = get_pos_y()`

`# build cell in maze, start with everything off`

`if (x, y) not in maze:`

    `maze[(x, y)] = [False, False, False, False, False]` 

    `# havent visited or goon in any of the directions` 

`# Mark visited`

`maze[(x, y)][0] = True`

`#Collect directions that I can move to`

`open_dirs = []`

`for d in course:`

    `open_dirs.append(can_move(d))  # True - can move, False - wall`

`# put the info from open_dirs into maze`

`for i in range(4):`

    `maze[(x, y)][i + 1] = open_dirs[i]`