Can I read Adversarial Search in Game Playing on EtoBox?
Adversarial Search in Game Playing by Sulabh Bista is a document available to read on EtoBox.
What is Adversarial Search in Game Playing about?
Game Playing – Adversarial Search involves planning moves ahead in games where other players are also planning moves. It discusses adversarial games that are deterministic, turn-taking, two-player, and zero-sum. It introduces the MinMax algorithm for finding the optimal strategy in such games by recursively considering all possible moves. However, MinMax has high time complexity due to considering all possible game states. Alpha-Beta pruning is introduced to reduce this complexity by pruning parts of the ga
- Author
- Sulabh Bista
- Language
- EN