Skip to content

README.md

Latest commit

 

History

History
38 lines (25 loc) · 1.54 KB

README.md

File metadata and controls

38 lines (25 loc) · 1.54 KB
Raw

ChessAI_MimimaxAlphaBetaAlgorithms

Artificial Intelligence Chess AI with optimized minimax algorithm with alpha beta pruning and heuristic function implementation by Plipus Telaumbanua

Website: www.plipustel.com
Complete live code: Youtube PlipusCode Channel

Description

This project is aimed for educational purpose, implement the Artificial Intelligence algorithms: Minimax and Alpha Beta Pruning. The pretty project example in game theory is building Chess AI. Since the game tree of Chess AI has over 10^40 nodes (According to Stuart Russel), it is impossible to traverse of the tree. The best way to cut off the pruned branch is by defining the Heuristic Evaluation Functions(Reference: Shannon Fano) The Evaluation function on this project, take the very fundamental eval functions:

  • 1. Pieces Power
  • 2. Pieces Positions
  • 3. Pieces Movement
  • 4. King safety

For serious project, the sophistic evaluation functions must be added and improved

Development

2024, Aug

Author

Plipus Telaumbanua <www.plipustel.com>

Screenshoot

ChessAI

References

  • Book: Artificial Intelligence a Modern Approach 3rd Edition: Russel Stuart, Peter Norvig
  • Paper: Programming a Computer for Playing Chess: Claude E. Shannon