mirrors/OpenRCT2
1
0
Fork 0
mirror of https://github.com/OpenRCT2/OpenRCT2 synced 2025-12-10 09:32:29 +01:00
Code Issues Releases Wiki Activity

oops

Margen67
2021-04-21 18:33:35 -10:00
parent 452ec76fcd
commit 97023b9b50
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Peep-AI.md

@@ -70,6 +70,6 @@ In the above example `-` represents an invalid tile. As there is only one direct
If 0x00F1AEDE is none zero such as after a one direction string of path then 0x00F1AEDC is decremented twice. Otherwise it is decremented once. If 0x00F1AEDC is less than zero then score is returned (this route is too long).
0x00F1AEDC represents the number of junction walked, long sections of no choice tiles are ignored (This incidentally is the reason why mechanics can often end up choosing a very long route instead of a direct route with more choices. [#3423](https://github.com/OpenRCT2/OpenRCT2/issues/3423)
0x00F1AEDC represents the number of junction walked, long sections of no choice tiles are ignored (This incidentally is the reason why mechanics can often end up choosing a very long route instead of a direct route with more choices. [#3423](https://github.com/OpenRCT2/OpenRCT2/issues/3423))
The function then iterates each of the valid edges and calls sub_69A997 on each of them. 0x00F1AEDE is reset to zero to prevent no choice routes affecting future tiles. 0x00F1AEDC is saved and then restored at each call as it represents the current routes number of tiles and needs to start the same for each direction. The score is saved after each call so that it can be checked each time to see if it's better.