mirror/Archipelago
1
0
Fork 1
mirror of https://github.com/ArchipelagoMW/Archipelago.git synced 2026-03-21 06:45:49 -07:00
Code Issues Packages Projects Releases Wiki Activity

Update docs/apworld_dev_faq.md

Browse Source 
Co-authored-by: qwint <qwint.42@gmail.com>
This commit is contained in:
NewSoupVi
2024-09-05 21:30:30 +02:00
committed by GitHub
parent ce8d254912
commit a2ba2f3dbf
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/apworld_dev_faq.md
View File

@@ -57,7 +57,7 @@ For performance reasons, AP only checks every entrance once. However, if entranc
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.
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.
This keeps almost all of the performance upsides. Even a game making heavy use of indirect conditions (See: The Witness) is still significantly faster than if it just blanket "rechecked all entrances until nothing new is found".