v50 Steam/Premium information for editors
- 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.
This notice may be cached—the current version can be found here.
Editing 40d Talk:Traffic
Jump to navigation
Jump to search
Warning: You are not logged in.
Your IP address will be recorded in this page's edit history.
You are editing a page for an older version of Dwarf Fortress ("Main" is the current version, not "40d"). Please make sure you intend to do this. If you are here by mistake, see the current page instead.
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 19: | Line 19: | ||
:I haven't seen much effect on FPS personally, but the algorithm Toady One uses (http://en.wikipedia.org/wiki/A_star) typically has a heuristic which assumes that all tiles are weighted equally. Generally speaking, adding tiles with high movement costs can cause A* to search much larger areas than it would normally. If you are only restricting small, non-chokepoint areas though, it should never be an issue, as A* will find a route adjacent to the restricted tiles, if possible. [[User:Basilisk|Basilisk]] 02:40, 7 April 2008 (EDT) | :I haven't seen much effect on FPS personally, but the algorithm Toady One uses (http://en.wikipedia.org/wiki/A_star) typically has a heuristic which assumes that all tiles are weighted equally. Generally speaking, adding tiles with high movement costs can cause A* to search much larger areas than it would normally. If you are only restricting small, non-chokepoint areas though, it should never be an issue, as A* will find a route adjacent to the restricted tiles, if possible. [[User:Basilisk|Basilisk]] 02:40, 7 April 2008 (EDT) | ||
| − | : I'm conducting some experiments along this line now. If I understand A-star correctly, you can greatly reduce the search space by creating freeways through cavernous rooms. In this case a "freeway" is a high-traffic path between two points, bounded by two low-traffic virtual walls. As long as the freeway closely approximates the shortest distance between those points, the algorithm will take your designations as "good advice" and not search very far outside the path. If you think of high-traffic areas as low-friction valleys, and low-traffic and restricted areas as hills and cliffs respectively, you're essentially channeling the dwarves like water. Some may splash over the edges, but generally it'll stay in the ditch you've dug for it. | + | : I'm conducting some experiments along this line now. If I understand A-star correctly, you can greatly reduce the search space by creating freeways through cavernous rooms. In this case a "freeway" is a high-traffic path between two points, bounded by two low-traffic virtual walls. As long as the freeway closely approximates the shortest distance between those points, the algorithm will take your designations as "good advice" and not search very far outside the path. If you think of high-traffic areas as low-friction valleys, and low-traffic and restricted areas as hills and cliffs respectively, you're essentially channeling the dwarves like water. Some may splash over the edges, but generally it'll stay in the ditch you've dug for it. |
:: Do you, or somebody else understanding that better than me, make a diagram or a visual display of this traffic pattern ? --[[User:Karl|Karl]] 18:22, 9 April 2009 (UTC) | :: Do you, or somebody else understanding that better than me, make a diagram or a visual display of this traffic pattern ? --[[User:Karl|Karl]] 18:22, 9 April 2009 (UTC) | ||