Python, Routing, Perlin Noise, Random Walk, Lecture.
i in range(1): step = random.choice(['N', 'S', 'E', 'W']) if step =='N': y=y+1 elif step == 'S': y=y-1 elif step == 'E': x=x+1 else: x=x-1 print (x,y) point (x,y) The wall follower Maze makers and maze solvers like this one can be used to determine efficient routing. More about maze solvers here.