https://github.com/samchenyu/cppchessengine
Minimax Algorithim with Alpha-Beta Pruning, Multi-Threading and Precomputed-Tables
https://github.com/samchenyu/cppchessengine
Last synced: 7 months ago
JSON representation
Minimax Algorithim with Alpha-Beta Pruning, Multi-Threading and Precomputed-Tables
- Host: GitHub
- URL: https://github.com/samchenyu/cppchessengine
- Owner: SamChenYu
- Created: 2024-08-15T10:27:01.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2024-09-28T22:44:10.000Z (over 1 year ago)
- Last Synced: 2024-12-28T11:28:54.025Z (over 1 year ago)
- Language: C++
- Homepage:
- Size: 235 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# C++ Chess Engine
Utilising Minimax Algorithim with Alpha-Beta Pruning, Multi-Threading and Precomputed-Tables
~Roughly 1.5 million nodes per second for evaluation and move generation
## Board Representation: 12 Bitboards (Big Endian)
## EVALUATION Method
The evaluation ranges from -1 to 1:
1: Checkmate for white
-1: Checkmate for black
0: Equal evaluation or stalemate
The evaluation is dynamically weighted between the position and material difference.
The positional difference is calculated with piece square tables. The material difference is calculated with a sigmoid function:
$y = \frac{1}{1.1 + e^{(-x+4)}} \quad \text{for} \quad 1 < x < 39$
where x is the numerial material difference and y is the material evaluation.
[Link to PeSTO's Evaluation Function](https://www.chessprogramming.org/PeSTO%27s_Evaluation_Function)