Skip to content

Latest commit

 

History

History
72 lines (54 loc) · 3.21 KB

README.md

File metadata and controls

72 lines (54 loc) · 3.21 KB

"The devil is in the details"

Note

This chess engine is currently named 'dojá' but there are chances that this might change in the nearest future The current NNUE implementation currently supports only AVX2

Warning

This project is still a work in progress

Some Optimizations + Features:

  • AlphaBeta Search
  • Quiescence Search
    • Delta Prunning
    • Standing Pat
  • Late Move Reduction (LMR)
  • MVV_LVA (Most Viable Victim -- Least Viable Attacker)
  • Move Ordering
  • Transposition Table
  • Null Move forward Pruning
  • Principal Variation Node
  • Killer Moves
  • History Moves
  • Aspiration Window
  • Iterative Deepening
  • PV-Table (Principal Variation Table)
  • Repetitions https://www.chessprogramming.org/Repetitions
  • [-] Singular extensions
  • [-] Full WASM support

How to Run this Project:

  1. Todo!

'dojá' derives inspiration from a lot of engines, blog posts, libraries, published articles, and videos. This list may not include every reference, but I'm grateful to everyone who has contributed in their way to fostering the Open-source community

Credits and Acknowledgments

  1. Viridithias
  2. Carp
  3. Bullet
  4. A port of Maksim Korzh's work
  5. BlueFever Software
  6. PeSTO's Evaluation Function
  7. Obsidian
  8. Stockfish

Some used

  1. Principal Variation Search
  2. Late Move Reductions
  3. Null-Move Forward Prunning
  4. Aspiration Windows
  5. Transposition Table

TO Read/Re-read

  1. Umko Chess Program
  2. Fully Distributed Chess Program
  3. Computer Chess Indexing
  4. Searchiing for Chess
  5. Genetic Algorithm for optimising chess position scoring
  6. Parallel Search of strong ordered game trees (*****)
  7. Pesto's evaluation table
  8. Little Chess Evaluation Compedium (****)
  9. History Heuristic (*****)