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

A computer-implemented method, comprising:

• by a computing system, generating relational sequences in trade space by performing principal component analysis (PCA) on raw data resulting in a UID comprising numbers derived from a dimensional reduction technique that provides relational meaning between the UID and other UIDs, wherein the trade space represents relative relationships in the raw data;
• mapping a solution space based on the generated relational sequences, by the computing system;
• replaying a plurality of scenarios, by the computing system, to determine pinch points where path structures are proximate to one another and more favorable outcomes can be jumped to;
• and
• generating a new solution path, by the computing system, based on one or more jumps to more favorable outcomes.

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

• generate relational sequences in trade space by performing principal component analysis (PCA) on raw data, wherein the trade space represents relative relationships in the raw data;
• map a solution space based on the generated relational sequences;
• replay a plurality of scenarios to determine pinch points where path structures are proximate to one another and more favorable outcomes can be jumped to;
• and
• generate a new solution path, by the computing system, based on one or more jumps to more favorable outcomes, wherein
• the PCA results in a UID comprising six numbers, with three of the six numbers resulting from principal components of a 2D wavelet transform of a respective image and another three of the six numbers resulting from principal components of a discrete cosine transform (DCT) of the respective image, which provides relational meaning between the UID and other UIDs.