Discussing the article: "Graph Theory: Heuristic Search Algorithm (A-Star) Applied in Trading"
You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
Check out the new article: Graph Theory: Heuristic Search Algorithm (A-Star) Applied in Trading.
The article applies the A* heuristic to market structure by modeling validated swing highs and lows as graph nodes and weighting edges with ATR‑normalized distance, spread, and noise penalties. The engine searches the most efficient route to infer trade direction and targets, then filters signals by directional ratio, total path cost, and opposing swings. It anchors TP to the final node and SL to prior structure, with on‑chart visualization and configurable inputs.
On live markets, price prints dozens of local highs and lows, and it quickly becomes unclear which of these are meaningful structure and which are noise. Traders often sense a "direction" but cannot convert it into repeatable rules: which swings matter, where the path of least resistance runs, what is an achievable target, and which level to use for a structural stop so it isn’t arbitrary. For an algorithmic approach to the challenge is stricter: without a graph model and numeric path scoring, it is impossible to consistently filter setups and make reproducible on‑bar decisions. This article addresses that problem directly—we turn validated swings into graph nodes, construct a weighted map (ATR‑normalized distance, spread, and noise penalties), and use the A* algorithm to find the optimal route for price. The result is a formal, testable framework for identifying high‑probability entries, structural stops, and logical profit targets.
The Heuristic A* EA works as a discrete decision-making engine, not a continuous indicator. On each new bar, it scans historical price action to identify key swing highs and lows, which act as nodes in a graph. These nodes are validated to ensure the price has not already moved through them. The EA then connects the nodes with edges, where each edge has a cost based on normalized price distance, spread, and market noise. This converts the price chart into a structured, weighted map that the A* algorithm can navigate.
The EA builds a weighted map of unbreached swing points. Each connection has a cost based on distance and market friction.
Author: Hlomohang John Borotho