  Solving feasibility problems is a central task in mathematics and the applied
sciences. One particularly successful method is the Douglas-Rachford algorithm.
In this paper, we provide many new conditions sufficient for finite
convergence. Numerous examples illustrate our results.
