Skip to content
#

alpha-beta-pruning

Here are 181 public repositories matching this topic...

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.

  • Updated Jul 10, 2024
  • Java

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.

  • Updated Jan 16, 2024
  • Java

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.

  • Updated Aug 9, 2023
  • Java

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

  • Updated Aug 4, 2023
  • Java

Improve this page

Add a description, image, and links to the alpha-beta-pruning topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."

Learn more