Search Strategies

Search Strategies are an input to the Solver itself. They define a set of areas to search when performing a solve.

The simplest of strategies would be PointSearchStrategy - essentially a strategy that only provides a single search area, and the solver would only try one specific coordinate and give up if no match was found. There's not much practical use for it except when debugging the solver.

Probably the most used strategy would be the Nearby Search Strategy. As the name implies, this strategy is for searching nearby for matches. That's what would be used from an imaging program, when you have already aligned your telescope.

The most expensive strategy would be the Blind Search Strategy. This strategy basically assumes there's no valid coordinate or field of view available, and it's all about guesswork. It is given some min-max thresholds and it then generates a set of search areas that cover the entire sky with different fields of view. This is by far the most expensive strategy, as in the worst case scenario the sky would be scanned multiple times with different fields of view until a match was found.