From ce8d254912168accc59247340d8fdf3165e07256 Mon Sep 17 00:00:00 2001
From: NewSoupVi <57900059+NewSoupVi@users.noreply.github.com>
Date: Thu, 5 Sep 2024 21:23:33 +0200
Subject: [PATCH] Update apworld_dev_faq.md

---
 docs/apworld_dev_faq.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/docs/apworld_dev_faq.md b/docs/apworld_dev_faq.md
index 672d08e49b..b9e7361ffa 100644
--- a/docs/apworld_dev_faq.md
+++ b/docs/apworld_dev_faq.md
@@ -54,8 +54,9 @@ Region sweep (the algorithm that determines which regions are reachable) is a Br
 
 For performance reasons, AP only checks every entrance once. 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 nontraversable 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 to be traversable 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, but it is not.
 To account for this case, AP would have to recheck all entrances every time a new region is reached, until no new regions are reached.
 
 However, there is a way to **manually** define that a *specific* entrance needs to be rechecked during region sweep if a *specific* region is reached during it. This is what an indirect condition is.