The algorithm is entirely deterministic; you don't even need an RNG. If two or more possible moves have the same value, a naive scanning of the evaluated values list will always return the same move.

Besides, how do we often solve combinatonic problems? By asking the opposite question and subtracting the result from the universal set. This is no different.