Will computers ever solve chess?

Again...that is why i said "people" havent solved checkers.  Computers have, people havent.   

People have used computers to solve checkers. We are tool users.

  Quite right.

People using computers solved checkers. Not really possible that people using computers will solve chesss.

Technology isn't limitless though, and some things that are potentially possible face extreme practical limitations, such as storage space, time, and e.g. only having one planet worth of resources.

It is possible to solve a mathematical equation without solving for every single possible value. 

It is also possible to solve chess without solving for every singly possible move. 

If it's so easy to solve for any given position, why do people bother putting together EGTBs?

Or do you mean theoretically?

I guess it also depends on what you mean by solve chess.

Roughly speaking, you need to deal with the square root of the number of possible games, because while you don't have to deal with every one of your possible moves, you do have to deal with every possible move by the opponent.

It has been solved in the sense that a perfect strategy for white and a perfect strategy for black have been determined. A computer can always draw and will win if its opponent makes one mistake.

But it was proved, long ago, that pi has no end, meaning that its decimal expansion never terminates. On the other hand, the number of possible chess games is finite, although very large.

Of else they're looking in the wrong place.

  Checkers were solved by building a computer with high calculation abilities--once that faster processor was built, it was all the work of computers. Humans just watched them solve it.

  The same is not possible with chess, where number of possibilities is atronomical.

2kB? Core blimey!

 Naa, that story usually goes something like they asked Bill Gates about putting 1 Mb of memory in a computer and he said "Who would ever need that much?"

International checkers (played at a 10*10 board) has not been solved- yet, and a computer lost a match to the international checkers World Champion some four years ago.

Some people think computers will get faster forever. To them chess is just a "big number" and computers "can do big numbers eventually."

But if "eventually" isn't 100 years, but instead 1 million years, it might as well be impossible. In any case, computers can't continue to double in speed forever.

I guess it is one of the facts of the universe that this question will be repeated every so often.  Chess is finite.  A rather large amount of PhD level math has been devoted to studying it's size.  It is too big for computers to solve in the lifetime of the universe, and in fact the number of legal positions exceeds the number of atoms in the universe.  Therefore, even if computers get a billion, billion times faster (a billion billions), they can not solve chess.  And that won't happen using anything like we have now, because the path we've been on for the past fifty years, Moore's law and whatnot, is reaching an end, since transistors can't be made smaller than atoms, and we are only a few development generations from that point now.

However, if quantum computers ever turn out to be a real thing, it is possible one of those could solve chess.  Moreover, if it can be done at all, it can be done instantly, since that is the nature of quantum computers (it uses quantum uncertainty to examine all states at once).  At that point, there's still the problem of storing the result, since there are still more possibilities than there are atoms in the universe.

At some point you would to make them bigger instead of better