Algorithm 1: Get the evacuation path

Input: $grid$, $width$, $height$, $start$  Output: An array with each of the positions (x, y) where the person walks ($path$)  $wall$, $clear$, $goal$ = b’0’, b’*’, b’e’  $queue$ = collections.deque([[$start$]])  $seen$ = set([$start$])  repeat$\phantom{(}$   $path$ = $queue$.popleft()    x, y = $path$[-1]    if $grid$[y][x] == $goal$ then    $\phantom{(}$ return $path$   end $\phantom{(}$   repeat$\phantom{(}$    if 0 <= $x2$ < $width$ and 0 <= $y2$ < $height$ and $grid$[$y2$][$x2$] != $wall$ and ($x2$, $y2$) not in $see$      then     $queue$.append($path$ + [($x2$, $y2$)])     $seen$.add(($x2$, $y2$))   end$\phantom{(}$   until $x2$, $y2$ in ((x+1,y), (x-1,y), (x,y+1), (x,y-1);$\phantom{(}$  until $queue$;