Chess is a deterministic game. Hence in principle we can have a perfect strategy for chess, a strategy that prevents a player losing a single game (given that no mistake has been made). All chess heuristics thus results from the single fact that the search space of possible moves of a chess game is incredibly large, finite but unimaginably large. Beyond any scope of human brain’s computational ability to follow through to the end. Even machines don’t possess such humungous processing abilities as of now. How do you proceed from this point? How do we get around our limited computational abilities? What aims do we start with? It seems looking ahead in the search space even to a little extent is something we can’t do away with. Every chess strategy ever is basically a smart way to replace a brute force search with something else. My question is how do you replace searching without actually searching? Do we have to rely a lot on previously tried and tested variations and their results? Then becoming a good chess player becomes a problem of gathering plus memorizing data and doing near perfect five-six moves long calculation, am I right?
I guess what I’m asking here is that can we algorithmize the problem of becoming a good human chess player to some extent? What are an aspiring chess player’s challenges? What fundamental actions do those challenges finally boil down to?