A second advantage is the responsiveness of the algorithm. Because early iterations use small values for formula_1, they execute extremely quickly. This allows the algorithm to supply early indications of the result almost immediately, followed by refinements as formula_1 increases. When used in an interactive setting, such as in a chess-playing program, this facility allows the program to play at any time with the current best move found in the search it has completed so far. This can be phrased as each depth of the search "co"recursively producing a better approximation of the solution, though the work done at each step is recursive. This is not possible with a traditional depth-first search, which does not produce intermediate results.