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.
svcg@lemmy.blahaj.zone 6 days ago
en.m.wikipedia.org/wiki/Solving_chess
No, the argument for “chess is not solved” is that unless you can tell me whether or not it is possible for white to force a win, then it is - by definition - not solved.
drmoose@lemmy.world 6 days ago
Again “unsolvable” through sheer amount of positions is a cop out because thats boring as fuck. It’s not an interesting game where computational power is the only challenge.
OhNoMoreLemmy@lemmy.ml 6 days ago
What is a game that wouldn’t be solvable if you removed most of the pieces and positions?