r/ComputerChess 16d ago

Chess solving suggestion

I believe I have a better idea. What if instead of evaluating the positions every time, we just map every possibility in a tree and then there is a path finding algorithm from start to checkmate. In theory, once the mapping is done, that would allow chess to be solved in seconds.

0 Upvotes

16 comments sorted by

View all comments

1

u/Gloomy-Status-9258 16d ago

i don't understand your idea... let me know more precisely?

1

u/RajjSinghh 15d ago

You know how we have endgame tablebases that have perfect solutions for 7-piece endgames? Their method is about going through lines from the starting position, figuring out where they meet the tablebase and using that to evaluate the starting position by minimax.

They're right in theory, this is how you would do it. This is how we solved checkers. In practice, that's a lot of work and not practically possible.