Chess doesn't even need processing power in theory, only a very large database with state lookup in the big book of chess.
There is a nice proof in game theory that any turn based game with 2 players, limited number of board positions, and finite max length is subject to the creation of the perfect game book - basically a simple table of board positions and the ultimate correct decision for every board position. using it you are guaranteed to win/draw optimally (depends on first mover advantage) against any player.
You just can't create a "big book of poker" it doesn't meet the requirements.
PS: Go is also subject to this treatment despite being several orders of magnitude more complex than chess, it is still a finite 2 player turn based game.
There is a nice proof in game theory that any turn based game with 2 players, limited number of board positions, and finite max length is subject to the creation of the perfect game book - basically a simple table of board positions and the ultimate correct decision for every board position. using it you are guaranteed to win/draw optimally (depends on first mover advantage) against any player.
You just can't create a "big book of poker" it doesn't meet the requirements.
PS: Go is also subject to this treatment despite being several orders of magnitude more complex than chess, it is still a finite 2 player turn based game.