This repository contains a set of solutions for Adversarial Search Solution. It contains implementations for 1 player and 2 player search algorithms. For the 1 player search algorithms, The Uniform Cost Search (UCS) is used . Heuristic based algorithms like A* Search are also used. For multi-player games, min-max algorithm is used.
-
Notifications
You must be signed in to change notification settings - Fork 0
This repository contains an implementation of Adversarial Search Algorithms
License
Nahom32/Adversarial-Search
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This repository contains an implementation of Adversarial Search Algorithms
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published