game theory Alpha Beta Pruning in Minimax Algorithm Algorithm Complexity Implementations Applications Questions Reading time: minutes | Coding time: minutes Like we discussed in earlier article, a hard coded AI can be used to create an intelligent opponent which you can challenge
game theory Von Neumann's Minimax Theorem/ algorithm Introduction Algorithm Complexity Implementations Applications Questions Reading time: 25 minutes | Coding time: 10 minutes Ever since the idea of artificial intelligence dawned upon the humanity, the basic concept of playing games against an
