Skip to content

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

License

Notifications You must be signed in to change notification settings

bryan-hz/AdversarialSearch

Repository files navigation

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

About

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

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published