Install Steam
login
|
language
简体中文 (Simplified Chinese)
繁體中文 (Traditional Chinese)
日本語 (Japanese)
한국어 (Korean)
ไทย (Thai)
Български (Bulgarian)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Español - España (Spanish - Spain)
Español - Latinoamérica (Spanish - Latin America)
Ελληνικά (Greek)
Français (French)
Italiano (Italian)
Bahasa Indonesia (Indonesian)
Magyar (Hungarian)
Nederlands (Dutch)
Norsk (Norwegian)
Polski (Polish)
Português (Portuguese - Portugal)
Português - Brasil (Portuguese - Brazil)
Română (Romanian)
Русский (Russian)
Suomi (Finnish)
Svenska (Swedish)
Türkçe (Turkish)
Tiếng Việt (Vietnamese)
Українська (Ukrainian)
Report a translation problem
As this is generally beyond my scope of ability, I pushed one last update to remove the 1.6 tag. There will be no further updates to this mod from my side.
In short, while the update might potentially be possible, this would require a mod rework, which I'm not capable of doing.
Almost no testing was done, so let me know if there are any issues with the mod later on.
GitHub repo will be updated soon.
As for 1.6 update - I will wait until the update officially arrives, then if necessary, I'll recompile for 1.6 if there are no major changes.
(the old mod is not compatible for some reason...)
From Clean Pathfinding 2 description:
Q. How does this mod compare to Perfect Pathfinding, and can they be used together?
A. Perfect Pathfinding focuses primarily on the heuristic tuning side of pathfinding. You can use them together if you wish to overwrite this mod's tuning, though you can also just emulate the same effect by maxing out the heuristic tuning slider in the mod options.
From Perfect Pathfinding description:
So how is this different to Clean Pathfinding?
Perfect Pathfinding removes optimizations and adds complexity to the algorithm calculations with the goal of finding optimal, perfect paths.
Clean Pathfinding adds optimizations and uses lightweight methods to find paths that keep your pawns clean.
Perfect Pathfinding is a bit heavier as it always tries to find the fastest route to any destination to destination and reduces the number of odd "sidesteps".
That's the best explanation I could give, but maybe someone else can say it in easier to understand words.