Quantum algorithms can find their way out of mazes exponentially faster than classical ones, at the cost of forgetting the path they took. A new result suggests that the trade-off may be inevitable.

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network ...

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.

It is such a complex problem that even the best path-finding algorithms struggle to keep up with the breakneck pace of e-commerce or manufacturing.

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.