News for hackers. Stuff that matters.
Re:The dumbest way to solve a maze [video] by danwee on Monday September 12, 2022 @05:16AM (#32807704)
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)

Re:The dumbest way to solve a maze [video] by Someone on Monday September 12, 2022 @06:03AM (#32807946)
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.

Re:The dumbest way to solve a maze [video] by TomGullen on Monday September 12, 2022 @05:47AM (#32807860)
Or make the particles bigger