|
UPDATE STATUS: READY TO VIEW |
|
|
|
|
|
|
|
|
|
INTRODUCTION |
|
|
AUTHOR: |
/u/Leggerless |
|
|
DOCUMENT: |
Node Network Analysis |
|
|
PUBLISH URL: |
Click here for the publicized URL |
|
|
|
|
|
|
|
|
|
RECENT UPDATES |
|
|
1 |
Node Names and Trade Managers |
|
|
|
|
|
2 |
MEDIAH UPDATE (Node Network) |
|
|
|
|
|
3 |
|
|
|
|
|
|
|
|
|
|
|
|
|
ANALYSIS AND DESCRIPTION |
|
|
|
|
|
|
|
|
|
BEST UP-TO-DATE MAP WEBSITE |
|
|
|
|
|
|
|
|
|
|
|
|
|
Current Project: |
|
|
|
|
|
|
Working on the new Node Network. May add more resources for a compiled guide. |
|
|
|
|
|
|
|
|
|
|
|
|
|
MAP CP COST: |
55 |
CP |
(Pre-Media) |
|
|
|
|
67 |
CP |
(Mediah) |
|
|
|
|
|
|
|
|
|
|
How the optimization node network connections are calculated: |
|
|
|
|
|
|
1. Start from Illya |
|
|
|
|
|
|
2. Find next closest town |
|
|
|
|
|
|
3. Go through all possible paths, find their CP cost, and sum their path cost. |
|
|
|
|
|
|
4. Choose the path with the lowest CP cost. |
|
|
|
|
|
|
5. Repeat with the next closest town. |
|
|
|
|
|
|
6. If needed, remove previous links if another summed link has a lower CP cost. |
|
|
|
|
|
|
|
|
|
|
|
|
|
Rules, constraints, and special notes. |
|
|
|
|
|
|
All cities, towns, and villages (blue/turquoise icons) must be connected! |
|
|
|
|
|
|
CP is not used for farms or resources attached to nodes in the paths. |
|
|
|
|
|
|
CP is not used for item rentals or house purchases as well. |
|
|
|
|
|
|
CP is only used for the paths in the node network. |
|
|
|
|
|
|
|
|
|
|
|
|
|
In the case of paths with the same CP cost, the path with the most nodes is |
|
|
|
|
|
|
chosen instead. Done for possible trading distance bonuses (unverified atm?). |
|
|
|
|
|
|
Excessively long paths are not included in the calculations. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
CREDITS |
|
|
/u/fexxi |
Idea to make GDoc a publication. |
|
|
/u/redev |
Network improving upon the previous system. (Verified) |
|
|
/u/ChiyoBaila |
Node name assistance |
|
|
Darkwaters Lorilie |
SWG Member (Trade Manager Sheet) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|