Q:

A game of Chess - Ideal Solution

I am a student of physics. I have learnt some basic group theory, and I am wondering if there is any ideal solution for a given Chess game (like solving Rubik's cube). I know the no. of permutations are enormous that computation becomes almost impossible to do such a thing. But I am interested in knowing if there is any Group theory based solution being researched and developed.

A:

For games like checkers, yes this has been solved using computers - you can guarantee at least a tie; however, for chess, there are far too many moves to be solved at this point in time because the number of strategies that must be calculated go up exponentially. It IS possible to solve it using game theory, but it is far too complicated to be done with current technology levels. 

