- v50 information can now be added to pages in the main namespace. v0.47 information can still be found in the DF2014 namespace. See here for more details on the new versioning policy.
- Use this page to report any issues related to the migration.
Difference between revisions of "DF2014 Talk:Path"
(Pathing through a split tunnel...) |
|||
| Line 10: | Line 10: | ||
[[File:Pathing_through_2_tunnels_explanation.gif]] | [[File:Pathing_through_2_tunnels_explanation.gif]] | ||
| + | |||
| + | [[User:Kami|Kami]] ([[User talk:Kami|talk]]) | ||
Revision as of 13:32, 6 November 2014
The following diagram shows witch fields the algorithm will have to calculate to connect between two sides through a split tunnel:
The following diagram shows witch fields the algorithm will have to calculate when you add a restricted area on both ends of either split to make units prefer one direction for each way:
The reason is, that as soon as the restricted point at the end of the tunnel is reached - in this case it is on the upper tunnel at the blue circle - the algorithm adds 25 to the manhattan distance to the end. This will make it look at every field outside the tunnel with lower costs (manhattan distance + field value). This way, it will check many additional fields, depending on the position of the target and the structure of the map there.
