Hacker News Reader

If you make the hallways' maze "thinner", I imagine you don't need as many particles in the simulation?

I guess as well that the "thinnest" hallway is of length: 1 pixel. If the particle is also 1 pixel in size, then wouldn't the simulation be the path finding (backtracking?) algorithm? I don't remember the details, maybe I misunderstood something (last time I saw this was at university)

View on HN

No. It would be a random walk on a graph. It could (and likely would) revisit the starting position more often than the number of each of its neighboring cells.

Another way to see why that can’t be like backtracking is that it is memoryless, while backtracking keeps track of what was visited.

Or make the particles bigger

Reply on news.ycombinator.com