A cloud simulation library based on cloudsim, it aims to provide all known cloud scheduling algorithms with the help from community developers, as well as automate various simulation scenarios.

This is a Java-based implementation of the Chinese Checkers game with a graphical user interface (GUI). The game allows you to play against an AI opponent using the Alpha-Beta Pruning algorithm. The objective of the game is to move all your marbles to the opposite point of the star-shaped game board. The first player to achieve this wins the game.

Github Repo for Automatic Chess Board for Arduino Nano.

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

Principles Of AI Lab Exercises

Invincible TicTacToe AI agent

🤖📚 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

Tic-tac-toe game in python, using pygame. (with AI adversary)

Reversi game with Min-Max algorithm with alpha-beta pruning

This repository contains all the lab assignments done in the CSE422 course of BracU.

An implementation of a chess engine developed using JavaScript and the Minimax algorithm for decision-making.

Tic-Tac-Toe game logic in JavaScript packaged with Minimax algorithm; built as a learning project.

This project is an unbeatable Tic-Tac-Toe game built with HTML, CSS, and JavaScript. It features a player vs. AI mode where the AI uses the Minimax algorithm to make optimal moves, ensuring it never loses.

Generic implementation of the Max-n algorithm in Java

a tic tac toe project I made in my first semester of University

Homework-2-KR-AI

This homework is about Implementing a smart agent to play Quoridor, using Min-max, a heuristic function, Transposition Table and forward pruning. This homework is a part of many projects in a Fundamentals to AI course @ FUM.

chess game using python, and django

A simple tic-tac-toe game (commonly known as x's and o's) with an AI player and 3 modes(easy, medium, and hard). The hard mode is implemented using the min-max game-playing algorithm.

No description provided.

Development of an Artificial Intelligence (AI) in Python capable of playing ChessQuito using a min-max (alpha-beta) algorithm.

No description provided.

Visual Studio Code extension for Decision Tree

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

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

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

Python projects for Introduction to Artificial Intelligence course at Warsaw University of Technology.

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.

tic-tac-toe is fun 2 player board game played on 3X3 board when getting you have to select three boxes either horizontally, diagonally or vertically

Customer Churn Prediction Model & Data Pipeline