 |
VOOZH | about |
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
A game of Chinese checkers where a user is able to play against an AI with multi levels of difficulty. The internal ai utilises the min-max algorithm
🤖📚 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.
A smart, responsive Tic-Tac-Toe game built using JavaFX. Challenge and test your skills against a simple AI powered by the Minimax algorithm. This is a modern take on the classic game, featuring a clean UI and smooth interaction.
Tic-Tac-Toe game logic in JavaScript packaged with Minimax algorithm; built as a learning project.
Generic implementation of the Max-n algorithm in Java
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.
a tic tac toe project I made in my first semester of University
Homework-2-KR-AI
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.
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.
Add a description, image, and links to the min-max-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the min-max-algorithm topic, visit your repo's landing page and select "manage topics."