Game Theory

  • Last Updated : 05 Jun, 2018

  1. Combinatorial Game Theory | Set 1 (Introduction)
  2. Combinatorial Game Theory | Set 2 (Game of Nim)
  3. Combinatorial Game Theory | Set 3 (Grundy Numbers/Nimbers and Mex)
  4. Combinatorial Game Theory | Set 4 (Sprague – Grundy Theorem)
  5. Minimax Algorithm in Game Theory | Set 1 (Introduction)
  6. Minimax Algorithm in Game Theory | Set 2 (Introduction to Evaluation Function)
  7. Minimax Algorithm in Game Theory | Set 3 (Tic-Tac-Toe AI – Finding optimal move)
  8. Minimax Algorithm in Game Theory | Set 4 (Alpha-Beta Pruning)
  9. Minimax Algorithm in Game Theory | Set 5 (Zobrist Hashing)
  10. Variation in Nim Game
  11. Find the winner in nim-game
  12. Game of Nim with removal of one stone allowed
  13. Check if the game is valid or not
  14. Game of replacing array elements
  15. Game of N stones where each player can remove 1, 3 or 4
  16. The prisoner’s dilemma in Game theory
  17. Choice of Area
  18. Implementation of Tic-Tac-Toe game
  19. 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.

My Personal Notes arrow_drop_up


Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.