I was watching a chess video and Deep Blue, the IBM computer, was able to beat the best Chess player in the world at the time. If we made the computer and it bases its moves off of moves already made in real life shouldn’t we be able to beat computers like any other player? This isn’t chess specific but can be for any multitude of games.
In: 0
One of the basic AI algorithms is called Alpha-Beta Pruning. A simpler version of it is called MiniMax. The point of MiniMax is to simulate every step the AI can take, then every step the opponent can take, then AI again, and repeat this until a set simulation depth is reached. This creates a series of calculations where the number of evaluations needed increases extremely fast with every layer of depth you add. The increased number of calculations means slower, but more accurate predictions. For evaluation, there are different evaluation methods. A simple example giving each figure a value and finding a way to make the opponent lose more than the AI does.
The reason the AI is better isn’t that it’s particularly smart, but because it’s fast and can remember a lot. It can generate millions of board states in a few seconds, use a complex scoring system on it, then remember the values it can reach. Deep Blue used a version of Alpha-Beta Pruning. The chess grandmasters described the AI like a dumb wall that’s coming towards them, using brute force processing power instead of intelligence.
If you’re interested in how the algorithm works, Sebastian Lague has a beginner-friendly explanation on youtube, with simple graphs and code examples that show how simple the idea is, but how effective it can be. The video uses pseudo-code, meaning that it’s written in a way that’s easier to understand but isn’t in a real programming language, and it’s also not necessary for the explanation
Latest Answers