The Algorithm for a Maze solving robot to find the shortest path in an unknown maze from a starting position to a destination probably the center.

The results show that any hypothetical path-finding algorithm that doesn’t blindly guess would have to temporarily lose track of the entrance to have any chance of succeeding.

Imagine you visit a maze with some friends. You emerge from the exit shortly after going in, and wait around for hours before your friends emerge. Naturally, they ask about the path you took — surely ...