You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This project features an advanced chess engine leveraging algorithms such as minimax with alpha-beta pruning, transposition tables, and heuristic-based move ordering. It aims to surpass human-level performance in strategic decision-making and tactical analysis. Leveraging Java's multithreading capabilities ensures efficient execution on hardware's.
24-bit ANSI colored, console-based chess engine using Java. Optional multi-threaded AI using Minimax with alpha-beta pruning. Fully configurable properties including: ply depth, thread pool size, optional AI time limit, all colors, and more.
A customizable chess game which allows you to play human vs human, computer vs human and computer vs computer. The computer AI is implemented through the MiniMax algorithm and enhanced with Alpha-Beta pruning.
The program is a digital rendition of Connect 4, where players aim to align four discs vertically, horizontally, or diagonally. Players alternate turns, with the AI using the minimax algorithm and alpha-beta pruning to select its best move. The AI predicts up to 4 moves ahead, emphasizing winning quickly and delaying losses.
In this project, the AI uses the minimax algorithm with alpha-beta pruning to make the best next move. I implemented the AI to have an adjustable search depth to speed up the decision-making time on larger board sizes and allow for comparing the strengths of AI with varying depths.
The game is played on a vertical screen with eight rows, where players take turns dropping their pieces into one of the columns.The objective is to be the first player to connect four pieces in a row horizontally, vertically, or diagonally.
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.
Jungle: Chess Game Engine - Implementation of Minimax, Alpha-Beta Pruning, Move Ordering, and Quiescence Search - SUSTech's project of course CS109: Introduction to Programming in Spring 2023 - Score: 110/100