game theory Game Playing: Adversarial Search The goal of adversarial search is to create an intelligent agent that can make decisions to maximize its chances of winning the game. The agent needs to consider the possible moves of both players and anticipate the outcomes of these moves to make informed decisions.

game theory Game Tree In this article, we have covered the concept of how Backtracking help us to solve Game Tree. We will solve the Game Tree Problem by making use of the Minimax Algorithm. We have presented the Time and Space Complexity for various cases.

Algorithms Algorithm to check win in tic-tac-toe In this article, we have presented an algorithm to check win and loss for a given Tic Tac Toe configuration.

game theory Pure and Mixed Strategy Nash equilibrium In this article, we will discuss about the pure and mixed strategy nash equilibrium which are important concepts in Game Theory.

game theory Traveler's dilemma In game theory, the traveler's dilemma (abbreviated TD) is a type of non-zero-sum game in which two players attempt to maximize their own payoff, without any concern for the other player's payoff. We have presented the code and applications for Traveler's dilemma in O(1) time complexity.

nash equilibrium Nash Equilibrium Algorithm Complexity Implementations Applications: Tinder questions Reading time: 25 minutes | Coding time: 10 minutes In game theory, the Nash equilibrium, named after American mathematician John Forbes Nash Jr., is a solution concept of

game theory Zobrist Hashing Algorithm Complexity Implementations Applications Questions Reading time: 15 minutes | Coding time: 5 minutes Zobrist hashing (additionally alluded to as Zobrist keys or Zobrist marks ) is a hash function development utilized as a part

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

game theory Sprague-Grundy Theorem and Game of Kayle Sprague Grundy function returns smallest non negative integer which is not in the given set. Explore the application of Sprague Grundy Theorem using a famous game of Kayle. Find the complexity and implementation of Sprague Grundy theorem and game of kayle.

game theory Nimber Arithmetic : A deeper dive in Nim Explore Nimber Arithmetic in Game theory and always win a game. Nimbers have two particular operations. nim-addition and nim-multiplication. the nimbers are know as Grundy Numbers. Explore applications in the Game of Nim and odd Knight of the round table problem.

game theory Exploring The Game of Nim Nim is a mathematical game of strategy in which two players take turns removing objects from distinct heaps. The key to the theory of the game is the binary digital sum of the heap sizes "exclusive or" (xor). It is called the nim-sum. Find implementations of winning strategy and applications