Low probability transitions and boundary crossing into disallowed states for a more optimal solution

A computer program embodied on a non-transitory computer-readable medium, the program configured to cause at least one processor to:

• map trade space versus time for a plurality of scenarios, whether reachable or not within rules of a system, each pathway in the plurality of scenarios comprising a plurality of nodes;
• while following a pathway from an initial starting point, search for nearby nodes from otherwise unreachable outcomes that provide a better solution;
• when a node is found that is proximate within the predetermined distance and is associated with a pathway that provides a better solution, jump to the proximate node and follow the path to the better solution;
• and
• output the path with the better solution, wherein
• the mapping of trade space versus time comprises determining unique IDs (UIDs) for each node in the map, and
• the UIDs comprise numbers derived from a dimensional reduction technique that provides relational meaning between unique IDs.