From 205fa71cc74aa7276f6577bca3e65b78891be18e Mon Sep 17 00:00:00 2001 From: NewSoupVi <57900059+NewSoupVi@users.noreply.github.com> Date: Wed, 31 Jul 2024 22:33:50 +0200 Subject: [PATCH] Update docs/apworld_dev_faq.md Co-authored-by: Exempt-Medic <60412657+Exempt-Medic@users.noreply.github.com> --- docs/apworld_dev_faq.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/apworld_dev_faq.md b/docs/apworld_dev_faq.md index 5f0e8c415d..986443a3a0 100644 --- a/docs/apworld_dev_faq.md +++ b/docs/apworld_dev_faq.md @@ -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.