Eulerian and Hamiltonian Graphs · Superchallenge problem

The $3\times3$ rook graph has $9$ squares as vertices, two joined when they share a row or a column. For how many of its non-adjacent pairs does Ore's condition $\deg u+\deg v\ge9$ FAIL?