The tiny flood that finds a path #shorts

本站添加: 2026-05-15

[00:00:00]Here is a maze and a tiny digital flood is looking for the exit. It does not guess the whole route. It only asks one boring question, what cells can I reach next?

[00:00:12]Each wave remembers where it came from.

[00:00:15]Dead ends stop expanding. Open corridors keep glowing. When the wave touches the goal, the path is already hidden inside those memories. Trace them backward and the shortest route appears. That is breadth-first search. Not magic, just patient bookkeeping one layer at a time.