There are 0 repository under min-max-algorithm topic.
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.
Principles Of AI Lab Exercises
Reversi game with Min-Max algorithm with alpha-beta pruning
An Implementation of the Filler game with a min-max based AI written in the elm programming language
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
This repository contains all the lab assignments done in the CSE422 course of BracU.
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.
This project features a classic game of Tic-Tac-Toe implemented in JavaScript, enhanced with an artificial intelligence powered by the MiniMax algorithm.
Command line tic tac toe with 3 difficulty modes. You can play with computer or another friend or even simulate a match where AI is in both sides.
This repository includes the Tasks/ materials /Reports for the C# Object-oriented Programming-2 Lab course.
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.
It is a simple chess game which runs on a flask server. It is equipped with one built-in chess engine. It has an assistant which gives the user some introduction, instructions and credits.
a tic tac toe project I made in my first semester of University
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.
Tic tac toe inspired web app in React(TS)
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
🤖📚 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. Used min-max algorithm.
Course project: MASTERMIND Game in ocaml
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.
AI Bot in adjacency-strategy-game using min-max algorithm in java
A console chess game in python working on the Artificial Intelligence min-max algorithm
The Tic Tac Toe game project is a classic implementation of the popular game, developed in Python. It offers two exciting modes of play: single-player and multiplayer. The game is played on a 3x3 grid, where players take turns marking their moves with 'X' and 'O' symbols.