Abstract
The game of chess appears to be hard. According to authoritative sources, this is due to the extremely large number of possible chess moves. We refute this argumentation by showing that simple games of moderate size — as an example we consider nim — have a larger number of moves than chess, yet possess a very easy winning strategy. So perhaps chess has also an easy strategy which remains elusive? We argue that this is rather unlikely, in view of several high-complexity aspects of chess, notably the proven Exptime-completeness of n × n chess.
Get full access to this article
View all access options for this article.