Chess AI

Chess AI developed with the minimax adversarial search algorithm with alpha beta pruning!

About   |   Technologies   |   Requirements   |   Starting   |   Contributing

🎯 About

Artificial Intelligence Chess developed with the minimax adversarial search algorithm with alpha beta pruning. It returns the best possible move it has been able to find at the given depth within a specified time interval, at each iteration the algorithm takes into account a series of Heuristics that tell it whether a particular move is good or bad based on the future outcome it might cause.

By default it analyzes the best move at a depth of 2 and with a time limit of 10 seconds, this means that it will evaluate all possible moves taking into account the outcome of 2 boards in the future.

ChessAI.short.mp4

🚀 Main Technologies

               

See more

• Python
  • chess
  • numpy
  • pygame
  • sys
  • ast
  • copy
  • os

✅ Requirements

Before starting 🏁, you need to have Git and Python installed (pip).

🏁 Starting

# Clone this project
    $ git clone https://github.com/fraineralex/ChessAI
# Access
    $ cd ChessAI
# Install dependencies
    $ pip install numpy
    $ pip install chess
    $ pip install pygame
# Run the project
    $ python src/main.py
# The server will execute and you will see the chess board

🎮 Scripts

• Entry point: main.py
• Press t to change theme (green, brown, blue, gray)
• Press r to restart the game

📝 License

This project is under license from MIT. For more details, see the LICENSE file.

Made with 💙 by Frainer Encarnación

👨🏻‍🚀 Developer

• Frainer Encarnación --> Github