Skip to content

Latest commit

 

History

History
14 lines (11 loc) · 329 Bytes

README.md

File metadata and controls

14 lines (11 loc) · 329 Bytes

AdversarialSearch

This is a introduction to Adversarial Search Algorithms that are commonly used in Game Theory

Including Following algorithms

  • Minimax Algorithm
  • Alpha-Beta Pruning Algorithm
  • Expectimax Algorithm

Some optimization methods

  • Zobrist Hash
  • Evaluation Function

More Explorations:

  • Monte Carlo Simulation