Strong UCI chess engine.

Strength

Version	CCRL 40/15	CCRL Blitz	UBC
[2.0.0]	-	-	-
[1.0.0]	2629	-	2719

---

Search

The search function explores possible moves and evaluates their outcomes to find the best one. Core techniques include:

• Negamax with Fail-Soft 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
• Singular Extensions
• Razoring
• Cut Node
• Quiescence Search
• Move Ordering

---

Time Control

• Hard Limit
• Soft Limit
• Best Move TM
• Evaluation TM

---

Installation & Usage

Running The Engine

Linux

$ git clone [https://github.com/ProgramciDusunur/Potential.git](https://github.com/ProgramciDusunur/Potential.git)
$ cd Potential/src
$ make
$ ./Potential

---

Credits

This 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! 🌟

• Ciekce
• rwbc
• Dark Neutrino
• Zuppa
• Shawn
• Dan

---