We compare several established approaches for propagating wave functions and calculating hopping probabilities within the fewest switches surface hopping (FSSH) algorithm for difficult cases with many electronic states and many trivial crossings. If only a single time step (Δtc) is employed, we find that no published approach can accurately capture the dynamics correctly unless Δtc → 0 (which is not computationally feasible). If multiple time steps are employed, for a fixed classical time step (Δtc), a robust scheme can be found for dynamically choosing quantum time steps (δtq1 and δtq2) and calculating hopping probabilities so that one can systematically reduce all errors and achieve maximally efficient accuracy; scattering calculations confirm that one can choose a fairly large classical time step. The robust scheme presented here uses both the "local diabatic" and adiabatic interpolation and thus borrows elements from both the Granucci/Persico and Meek/Levine algorithms. Our findings should be broadly applicable in the future.