Game Theory
- Combinatorial Game Theory | Set 1 (Introduction)
- Combinatorial Game Theory | Set 2 (Game of Nim)
- Combinatorial Game Theory | Set 3 (Grundy Numbers/Nimbers and Mex)
- Combinatorial Game Theory | Set 4 (Sprague – Grundy Theorem)
- Minimax Algorithm in Game Theory | Set 1 (Introduction)
- Minimax Algorithm in Game Theory | Set 2 (Introduction to Evaluation Function)
- Minimax Algorithm in Game Theory | Set 3 (Tic-Tac-Toe AI – Finding optimal move)
- Minimax Algorithm in Game Theory | Set 4 (Alpha-Beta Pruning)
- Minimax Algorithm in Game Theory | Set 5 (Zobrist Hashing)
- Variation in Nim Game
- Find the winner in nim-game
- Game of Nim with removal of one stone allowed
- Check if the game is valid or not
- Game of replacing array elements
- Game of N stones where each player can remove 1, 3 or 4
- The prisoner’s dilemma in Game theory
- Choice of Area
- Implementation of Tic-Tac-Toe game
- Dynamic Programming | Set 31 (Optimal Strategy for a Game)
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
