From a1779c1924b40c7b30df9dddb52d1a1661e3323f Mon Sep 17 00:00:00 2001 From: NewSoupVi <57900059+NewSoupVi@users.noreply.github.com> Date: Thu, 5 Sep 2024 21:20:35 +0200 Subject: [PATCH] Update apworld_dev_faq.md --- 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 94c8fda5b3..4221732548 100644 --- a/docs/apworld_dev_faq.md +++ b/docs/apworld_dev_faq.md @@ -50,7 +50,7 @@ item_pool += [self.create_filler() for _ in range(total_locations - len(item_poo The world API document mentions indirect conditions and **when** you should use them, but not *how* they work and *why* they are necessary. This is because the explanation is quite complicated. -Region sweep (the algorithm that determines which regions are reachable) is a Breadth-First Search of the region graph from the Menu region, checking entrances one by one and adding newly reached nodes (regions) and their entrances to the queue until there is nothing more to check. +Region sweep (the algorithm that determines which regions are reachable) is a Breadth-First Search of the region graph from the origin region, checking entrances one by one and adding newly reached nodes (regions) and their entrances to the queue until there is nothing more to check. 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.