

I mean, yes. Any game with only a small number of possible moves can be solved with brute force trial and error.
All unsolved games must have a “sufficient amount of positions” that brute force isn’t an option, and enough complexity that there’s not a cute maths trick to solve it despite the number of moves.
Chess is one of these unsolved games.
What is a game that wouldn’t be solvable if you removed most of the pieces and positions?