x
Chess - Play & Learn

Chess.com

FREE - In Google Play

FREE - in Win Phone Store

VIEW
The Computational puzzle of Chess (why Humans will not ever be able to build a computer that can pla
Abid994’s Blog

The Computational puzzle of Chess (why Humans will not ever be able to build a computer that can pla

Abid994
Sep 30, 2017, 12:38 AM 0

Many people around the world have a grown interest in Chess these says, you can just see notice that, easily by logging into one of the many Chess websites, where 24/7 there are tournaments and challenges with players from all around the world.  Many of Chess lovers started playing the game at young age, which created as hoppy for them. However, for me, I was just a student at College year and half ago, when I really started getting interested in Chess, and the reason was very simple and shocking at the same time. It was when I came across the most unsolved complicated problem in Computer Science and maybe all of Math, A problem called (P vs NP), since the Seventies until now no one could come with any kind of solution for it. The reason is that even theoretically we can never build a computer that can play perfect Chess, our computers these days were build and developed to do something called (brute force) which means a computer can check huge number of options until it finds the best, you can for example see how computers these days are great at calculating even huge numbers, because of the stronger processors these days that can brute force very fast until finding the correct answer. However, Chess is different, because brute force of computer works great with polynomial time growth problems such as multiplying numbers or sorting a list of names. However, Computers completely fail when then facing a problem with exponential time complexity grow, such as Chess. As with every move, the number of the next legal moves increase exponentially, after the 40th move, its estimated that the number of legal moves in Chess is 10120 (which is more than the number of atoms in the observable universe). When you try to dive into the problem you realize how much of a great problem it is. An interesting thought too, even if (P vs NP) was solved and someone could prove that both equal each other, it would be a revelation for all humanists, we will find answers over night with technology for even the hardest problems, we would be able to cure cancer easily, furthermore many economics problems that we have been struggling with will be easy to solve with technology. But It would still not even come close to play perfect Chess.
(For more info)


Why the world’s toughest maths problems are much harder than a chess puzzle, and well worth US$1m

Online Now