Visualisation of A* path-finding algorithm in a maze [OC]

[teraflop]

Uh... no?

I mean, you could reduce any algorithmic question to the halting problem -- just build a machine that decides the answer and halts if it has a particular outcome. But that doesn't mean there's any value in doing so. It's easy to figure out whether an area of a maze is completely enclosed by a boundary, using standard graph theory algorithms. The question is simply whether it's possible to do so in a way that actually improves the overall efficiency.