Generalized chess is EXPTIME complete. Generalized chess is also PSPACE complete. Therefore $EXPTIME = PSPACE$. This implies that $P \neq PSPACE$
This proof is probably wrong. I want to know what I did wrong. They are probably referring to different problems regarding chess. But here are my sources. I can't say if they are. Reading the first bit of the papers it sounds like they are describing problems that are similar if not the exact same, But they probably are not. Hopefully someone proves me wrong and I learn something.
If i'm not wrong then how did actual scientists miss this?
EDIT 1: The EXP-TIME paper says that it is determining a perfect strategy, the P SPACE paper is determining if a player has wining moves. IF you look at the start position of NXN chess, determining if a player has a series of winning moves is the same as a perfect strategy I think. Forgive any trivial errors here. I'm, very new to this. But want to learn.
Aviezri S. Fraenkel, David Lichtenstein
Computing a perfect strategy for n×n chess requires time exponential in n