Not in practice. Computing the absolute minimum solution for every possible position is computationally infeasible for a web-based solver. This uses Kociemba’s two-phase algorithm instead, which produces very efficient solutions, usually close to optimal, without requiring enormous amounts of time and memory.