Factorio Prototype DocsVersion 1.1.107

The pathfinder performs a step of the backward search every fwd2bwd_ratio'th step. The minimum allowed value is 2, which means symmetric search.

When comparing nodes in open which one to check next, heuristic value is multiplied by this ratio. The higher the number the more is the search directed directly towards the goal.

When this is exhausted no more requests are allowed, at the moment the first path to exhaust this will be finished (even if it is hundreds of steps).

Number of elements in the cache.

Minimal distance to goal for path to be searched in short path cache.

Minimal number of algorithm steps for path to be inserted into the short path cache.

Minimal distance to goal for path to be searched in long path cache.

When searching for connection to path cache path, search at most for this number of steps times the initial estimate.

When looking for path from cache make sure it doesn't start too far from requested start in relative distance terms.

When looking for path from cache make sure it doesn't end too far from requested end. This is typically higher than accept value for the start because the end target can be moving.

Same as cache_accept_path_start_distance_ratio, but used for negative cache queries.

Same as cache_accept_path_end_distance_ratio, but used for negative cache queries.

When assigning rating to the best path this * start distances is considered.

When assigning rating to the best path this * end distances is considered. This is typically higher than value for the start to achieve better path end quality.

Somewhere along the path is stuck enemy we need to avoid. This is mainly to handle situations when units have arrived and are attacking the target then units further in the back will use this and run around the target.

If there is a moving unit further than this we don't really care.

Enemy is not moving/or is too close and has different destination.

Simplification for now; collision with everything else is this.

Collision penalty for successors of positions that require destroy to reach.

Collision penalty for collisions in the extended bounding box but outside the entity's actual bounding box.

Up until this amount any client will be served by the path finder (no estimate on the path length).

From max_clients_to_accept_any_new_request till this one only those that have a short estimate will be served.

This is the "threshold" to decide what is short and what is not.

If a short request takes more than this many steps, it will be rescheduled as a long request.

How many steps will be allocated to short requests each tick, as a ratio of all available steps per tick.

Absolute minimum of steps that will be performed for every path find request no matter what.

If the current actual cost from start is higher than this times estimate of start to goal then path finding is terminated.