Skip to content

About

Game AI project implementing MinMax with opponent models for Domino and Tic-Tac-Toe, including dynamic elimination of inconsistent adversary models and statistical performance analysis.

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Latest commit

 

History

5 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Project 1: Part 2 – Algorithms for Games with Opponent Models

Group Members:

  • Eldis YMERAJ
  • Redwan OMARI

Note:* This project is still in development and not yet finished.


Project Structure:

.
├── Adversaire
│   ├── Adversaire.py
│   ├── AdversaireDernierCoup.py
│   ├── AdversaireDominoFort.py
│   ├── AdversairePremierCoup.py
│   ├── AdversaireRandom.py
│   ├── __init__.py
├── Jeu
│   ├── Domino.py
│   ├── Jeu.py
│   ├── JeuInformationComplete.py
│   ├── JeuInformationIncomplete.py
│   ├── Morpion.py
│   ├── __init__.py
├── Joueur
│   ├── Joueur.py
│   ├── JoueurAdversaire.py
│   ├── JoueurMinMax.py
│   ├── JoueurMinMax2.py
│   ├── __init__.py
├── Main.py
├── README.md
├── Rapport.pdf

---

## **How to run the project: :**  

1. **Clone the repository::**  
   
bash
   git clone https://github.com/elymeraj/Algorithms-for-Games-with-Opponent-Models.git
  
2. **Navigate to the project root directory :**  
   
bash
   cd Algorithms-for-Games-with-Opponent-Models
  
3. **Run the main program :**  
   
bash
   python Main.py
  

---

About

Game AI project implementing MinMax with opponent models for Domino and Tic-Tac-Toe, including dynamic elimination of inconsistent adversary models and statistical performance analysis.

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages