| Version | SP-CC UHO-Top15 | CCRL 40/15 | CCRL Blitz | CEGT 40/4 | CEGT 40/20 | MCERL |
|---|---|---|---|---|---|---|
| [1.0.0] | - | - | - | - | - | - |
The evaluation function determines how good or bad a position is for each side. Key evaluation aspects include:
-
Material Balance
-
Mobility
-
King Safety
-
King Distance
-
Tempo
-
Check Tempo
-
Winnable
-
Can Passer Pawn Move
-
King Distance
-
Rook Open File
-
Rook Semi Open File
-
Pawn Structure
- Passed Pawns
- Isolated Pawns 🚧
- Doubled Pawns 🚧
- Backward Pawns 🚧
- Pawn Chains 🚧
-
Tapered Eval (Opening, Middlegame, Endgame)
The search function explores possible moves and evaluates their outcomes to find the best one. Core techniques include:
-
Negamax with Fail-Hard Framework
-
Principle Variation Search
-
Iterative Deepening
-
Transposition Table (TT)
-
Aspiration Windows
-
Late Move Pruning
-
Mate Distance Pruning
-
Late Move Reduction
-
Null Move Pruning
-
Futility Pruning
-
Reverse Futility Pruning
-
Quiescence SEE Pruning
-
PVS SEE Pruning
-
Improving Heuristic
-
Razoring
-
Cut Node
-
Quiescence Search
-
Move Ordering
When searching for the best move, the engine searches moves in the following order:
- Transposition Table Move
- Principle Variation Moves
- SEE Move Ordering (Capture Moves)
- MVV/LVA (Capture Moves)
- Quiet History Moves
- Hard Limit
- Soft Limit
- Best Move TM
- Evaluation TM
$ git clone https://github.com/ProgramciDusunur/Potential.git
$ cd Potential/src
$ make
$ ./PotentialThis project has been shaped and inspired by the valuable support and thoughtful feedback of the following individuals. Your contributions and insights have been greatly appreciated—thank you! 🌟