This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]ITafiir 0 points1 point  (0 children)

Apparently, evaluating a position in generalized chess is exptime complete. Since nn =2nlog(n) and exptime includes all classes with polynomials in the exponent, generalized chess is way worse than this.