Please explain for other games too if possible.
In: Technology
Ok, to put this in ELI5 terms:
A chess program basically works out the best possible move each turn by working out possibilities.
When you make a move, it will look at all the possible moves it can make in return. Then it will ‘simulate’ all those moves, and then simulate all the ways you could respond to all *those* moves… then simulate all the ways it could respond to *that…*repeat.
Basically, each move the game will simulate every way the game *could* go for so many moves ahead, then pick the option that gives it the best chance of winning.
The thing is, there are an almost infinite number of ways a chess game can go, so chess programs will only look so many moves ahead and only plan ahead for the most likely moves you’ll make (the ones that will give you the best chance of winning)… so the most common way to adjust the difficult of a chess game is to limit the number of moves it can work out ahead of time.
So, if a chess game has already worked out every possible move you could make for the next ten turns, it will be really difficult to beat. It knows everything you could possible do in the next ten turns and has worked out the best way to block you… but a chess game that is only looking two or three moves ahead, and not for every possible move will be much easier.
Latest Answers