artificial intelligence – A very simple allgorithm for a highly efficient? Chess AI

Several years ago I read an PhD thesis about some very complicated versions of chess AI’s, but now I think that it is very simple to implement an highly efficient chess AI as followed:

At each turn the amount of all possible moves is the degree of freedom for this turn, the only thing left to do is to choose a move that will result in a maximum (your degrees of freedome – the opponents degrees of freedome), just some simple combinatorical calculations.

What do you think of the efficiency of this?