Update docs/apworld_dev_faq.md

Co-authored-by: Exempt-Medic <60412657+Exempt-Medic@users.noreply.github.com>
This commit is contained in:
NewSoupVi
2024-07-31 22:33:50 +02:00
committed by GitHub
parent 8420c72ec4
commit 205fa71cc7

View File

@@ -54,7 +54,7 @@ Region sweep (the algorithm that determines which regions are reachable) is a Br
However, if entrance access conditions depend on regions, then it is possible for this to happen:
1. An entrance that depends on a region is checked and determined to be untraversable because the region hasn't been reached yet during the graph search.
2. After that, the region is reached by the graph search. The entrance *would* now be determined as traversible if it were rechecked.
2. After that, the region is reached by the graph search. The entrance *would* now be determined to be traversable if it were rechecked.
To account for this case, we would have to recheck all entrances every time a new region is reached, until no new regions are reached.