Projet Etudiant de fondement de l'IA avec un algorithme Min-Max (α-β) appliqué au jeu d'Othello

This Repository Contains the Code of Chess Game with A.I. Bot (using Min Max Algorithm) and also can host 2 player games.

Visual Studio Code extension for Decision Tree

Python package for Visual Studio Code extension dec-tree-vscode for Decision Tree

This project implements various AI techniques for controlling Pac-Man agents, developed as part of UC Berkeley's CS188 Intro to AI course. It explores search algorithms, neural networks, Markov Decision Process (MDP) and reinforcement learning in a simulated environment.

Generic implementation of the Max-n algorithm in Java

chess game using python, and django

TicTacToe with AI [Beginner's Project]

Python-based Tic-Tac-Toe game that implements the minimax algorithm.

Tic Tac Toe Game engine built with Javascript

AI Bot in adjacency-strategy-game using min-max algorithm in java

This project provides game logic for AI and human players using the Minimax algorithm with alpha-beta pruning. It includes functions for managing game states, simulating AI vs AI, AI vs Human, and AI vs Monte Carlo gameplay, and visualizing the board.

This project features a classic game of Tic-Tac-Toe implemented in JavaScript, enhanced with an artificial intelligence powered by the MiniMax algorithm.

Github Repo for Automatic Chess Board for Arduino Nano.

A console chess game in python working on the Artificial Intelligence min-max algorithm

This codebase features AI algorithms for smarter gaming experiences. It includes implementations of strategies like Greedy, Minimax, Alpha-Beta Pruning, and Expectimax. These algorithms empower AI agents to make optimal decisions in games, enhancing strategic gameplay.

🤖📚 Comprehensive AI Learning Repo: Master DFS, BFS, DLS, IDS, UCS, Bidirectional Search, Greedy, A*, Mini-max, Alpha-beta Pruning, and Genetic Algorithm. Your go-to resource for AI course notes, lab codes, and exploration

Principles Of AI Lab Exercises

An Implementation of the Filler game with a min-max based AI written in the elm programming language

This is a modified version of the classic checkers game created for academic purposes as a project for the AI Laboratory. The game introduces unique features, including vertical piece movements , special power pieces such as archers, king, and hero. The AI is implemented using the Min-Max algorithm with a depth level of 3 for strategic gameplay.