Skip to content

An AI chess engine developed in Javascript that implements a Mini-Max algorithm to perform an adversarial search with the objective of finding the next best move. To make the process of searching the game tree more efficient, Alpha-Beta pruning is incorporated in the logic. The heuristic function to evaluate the board position is defined as the …

Notifications You must be signed in to change notification settings

neelanjan00/ChessAI

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Chess AI

Welcome to Chess AI 👋

Version Twitter: NeelanjanManna

An AI chess engine developed in Javascript that implements a Mini-Max algorithm to perform an adversarial search with the objective of finding the next best move. To make the process of searching the game tree more efficient, Alpha-Beta pruning is incorporated in the logic. The heuristic function to evaluate the board position is defined as the sum of individual piece cost weighted according to the piece-square table. Finally, there's a leaderboard for those who successfully beat the AI, which is implemented using Firebase Cloud Firestore.

Demo

Usage

Execute the public/index.html file

Author

👤 Neelanjan Manna

Show your support

Give a ⭐️ if this project helped you!

About

An AI chess engine developed in Javascript that implements a Mini-Max algorithm to perform an adversarial search with the objective of finding the next best move. To make the process of searching the game tree more efficient, Alpha-Beta pruning is incorporated in the logic. The heuristic function to evaluate the board position is defined as the …

Topics

Resources

Stars

Watchers

Forks