  Schoening in 1999 presented a simple randomized algorithm for k-SAT with
running time O(a^n * poly(n)) for a = 2(k-1)/k. We give a deterministic version
of this algorithm running in time O((a+epsilon)^n * poly(n)), where epsilon > 0
can be made arbitrarily small.
