We study the deterministic and randomized query complexity of finding
approximate equilibria in bimatrix games. We show that the deterministic query
complexity of finding an $\epsilon$-Nash equilibrium when $\epsilon <
\frac{1}{2}$ is $\Omega(k^2)$, even in zero-one constant-sum games.