Skip to content

Initiated the development of a chess AI utilizing limited iterative deepening, min-max, alpha-beta pruning, and state recognition through an API, achieving a 30% improvement in runtime every week

loganchoi/ChessAI

Repository files navigation

Chess AI with Limited Iterative Deepening, Min-Max, Alpha-Beta Pruning, and State Recognition

Overview

Welcome to the Chess AI project! This repository is the home of a chess-playing artificial intelligence that utilizes advanced techniques, including limited iterative deepening, the min-max algorithm, alpha-beta pruning, and state recognition through an API. The development focuses on achieving a remarkable 30% improvement in runtime every week.

Features

  • Limited Iterative Deepening: Gradually enhances search depth for improved performance.
  • Min-Max Algorithm: Evaluates potential moves using the min-max algorithm.
  • Alpha-Beta Pruning: Optimizes the search process by reducing the number of nodes evaluated.
  • ** State Recognition:** Dynamically adapts to the game state.
  • Continuous Improvement: A commitment to achieving a 30% improvement in runtime each week.

About

Initiated the development of a chess AI utilizing limited iterative deepening, min-max, alpha-beta pruning, and state recognition through an API, achieving a 30% improvement in runtime every week

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published