Recently, seven piece tablebases were calculated by a supercomputer at Moscow State University and occupy 130,000 gigabytes. Among the nuggets of chess knowledge uncovered was that the longest forced mate with seven or fewer piece on the board is in 549 moves. Want to try to solve it? The position is as follows:
White to Mate in 549
Can't visualize it to the end? Give up? The solution is here.
After seeing this, I can't help but conclude that chess will never be solved. No computer will every play it perfectly, and the royal game will never be exhausted.