Well, you should volunteer on the Stockfish engine and show everyone how it's done.
I don't believe your comparison between fundamentally different games is sufficient to support your conclusion that an extremely large number of calculations does not pose a challenge for computer programs to solve.
Rather, to the best of my knowledge, to support your conclusion what you would need to do is to prove there exists a method or formula for reducing the number of permutations to a manageable number while still coming to an optimal solution. Apparently if Sudoku is easy to solve, that exists in Sudoku, but it certainly does not yet exist in the realm of human knowledge in chess.
The fact is that Sudoku and many card games are easy to solve, while chess is in fact a much, much more challenging problem for a computer program, and there are a lot of very smart people that have worked on that problem.
I don't disagree that Chess, and Go, and very hard. I don't believe without a major mathematical breakthrough we will see either solved, ever. There just isn't enough possible computing power in the universe.
HOWEVER, arguing that they aren't solvable purely from a point of view of "the number of possible games / states is greater than the number of particles in the universe" type arguments is that there are many problems we routinely solve with massive search spaces.
I don't believe your comparison between fundamentally different games is sufficient to support your conclusion that an extremely large number of calculations does not pose a challenge for computer programs to solve.
Rather, to the best of my knowledge, to support your conclusion what you would need to do is to prove there exists a method or formula for reducing the number of permutations to a manageable number while still coming to an optimal solution. Apparently if Sudoku is easy to solve, that exists in Sudoku, but it certainly does not yet exist in the realm of human knowledge in chess.
The fact is that Sudoku and many card games are easy to solve, while chess is in fact a much, much more challenging problem for a computer program, and there are a lot of very smart people that have worked on that problem.