Can a chess engine calculate ALL MOVES possible?

Hey since chess is basically a game that has a limited amount of games that can be played and is by no means based on luck, how come there wasn't any computer yet that calculated ALL of the games that are possible and all of the moves that can be played and therefore instantly knowing what is the best reaction to every move and win every time.

is it because there are just too many possibilities for a computer to handle? is there just not enough data to store all the moves? 

I took the following quote from this article:

"Almost nothing looks more orderly than chess pieces before a match starts. The first move, however, begins a spiral into chaos. After both players move, 400 possible board setups exist. After the second pair of turns, there are 197,742 possible games, and after three moves, 121 million. At every turn, players chart a progressively more distinctive path, and each game evolves into one that has probably never been played before."

As you say, chess "has a limited amount of games", but this is still a vast number of potential games.  Consider that most games at high level for humans often go more than 40 moves, and there are over 100 million possibilities before move 4 has even been played.  This exponential growth results into a dataset which is unfathomably enormous.  Currently, the computation time necessary to play "every possible game" is far, far too much.

yea right its the same link

its also a rickroll

...

Hello 

Because there are way too many moves to analyse. The amount is astronomical. We dont have the computing power to do that yet.

a : I think it first creates more powerful computers to increase the performance of position calculations by second and then someone has to want it and find an interest in it because the new generation bots (Komodo, Stockfish) are already stronger in the long term than any human.

b : An old chess program like Chessmaster 9000 is already very strong for a human in rapid time and against Gm Larry Christiansen on 4 games, Chessmaster 9000 won.

I did ranked play in the Chessmaster 11 program for bot Komodo 13 level 2488 from serious game time 15m+1s per move but by activating the play fast function for Komodo. Komodo level 2488 did 60 wins, 4 losses, 6 draws and obtains 2494 elo.

What really speaks is this ability to be very efficient by playing everything extremely fast which means that for a new generation bot like Komodo 13 is already "almost perfect".

There is probably programming work to be done against anti-computer techniques and then it's more than technical adjustments against buggs etc. so there is really no point in looking for a super super calculator that calculates everything from the starting position because already Komodo 13 is "almost perfect".

c : Chess Man vs. Machine: Norowitz vs. Komodo | Game 1

https://youtu.be/lyTFqrcoSmg

In this position in time 45m, Yaacov Norowitz with White failed to win against Komodo.

This is all the more important as information because people who play against bots are rarely Ims or Gms but amateur players.

An amateur player will not have much interest in buying a super super calculator that will have calculated everything from the starting position because already a chess program like Komodo will be at the maximum level certainly too strong for him.