maze

gistfile1.txt

visited = set([(0,0)])

# point = (3, 4)
# x, y = point
# x == 3 
# y == 4
def visit(point):
    #print('at ', point)
    x, y = point

    for d, next_point, back_d in [
        ("left", (x-1, y), "right"), 
        ("right", (x+1, y), "left"), 
        ("up", (x, y-1), "down"),
        ("down", (x, y+1), "up")]:
        
        #print(visited)
        if next_point in visited:
            continue
        print(d)
        i = input()
        if i == "solved":
            return True
        if i == "wall":
            continue
        
        visited.add(next_point)
      
        res = visit(next_point)
        if res != False:
            return True
        print(back_d)
        _ = input()
        
    return False    

        

def main():
    result = visit((0, 0))
    if result == False:
        print("not solvable")