This has bugged me for a bit. If chess engines are meant to always play the best moves, then how come two chess engines playing against each other doesn’t always have the same winner?
In: Other
Chess isn’t solved. Computers go to a certain depth in possible move orders before it all gets too complex. Then they decide which position is best. But it all still relies on the computer looking at a position of pieces and saying “yep this is very slightly better than some other position of pieces”. And then you also have to consider that the computer cant go through every possible combinations of moves, that would be very wasteful, so it carefully selects “promising” paths to look at. Both the pathing and the evaluation depends drastically from engine to engine.
Latest Answers