Does anyone know of an algorithm to navigate a maze when you don't know what walls are around you? I have to write a program to do this in assembly, but I can't even figure out the algorithm. I have a function to try to move in one of four directions (up, down, left, right), and get back a value that tells me if I moved, got blocked by a wall, or exited the maze. My problem is that anything I try looks like it will end up in infinite recursion with me either traveling in circles or just going directly back and forth. The professor said the easiest answer was using recursion, and I would pass in the last direction moved each time I called the function. Please let me know if you have any ideas, and any code posted in another programming language would help. Thanks in advance.