Difference between revisions of "Nalwald"
Line 33: | Line 33: | ||
** [[Late Move Reductions]] | ** [[Late Move Reductions]] | ||
** [[Check Extensions]] | ** [[Check Extensions]] | ||
− | ** [[ | + | ** [[Futility_Pruning]] |
** [[Quiescence Search]] | ** [[Quiescence Search]] | ||
** [[Delta Pruning]] | ** [[Delta Pruning]] |
Revision as of 02:29, 7 September 2024
Nalwald,
an UCI compatible open source chess engine by Jost Triller,
written in the Nim programming language [2],
first released in April 2021 [3].
Nalwald is a bitboard engine and generates sliding piece attacks Kindergarten like,
by looking up four pre-calculated line attack arrays, 32-Kbyte each, indexed by square and inner six bit line occupancy [4].
Nalwald uses alpha-beta for search and a BAE (big array evaluation) for evaluating leaf nodes.
Contents
Features
Board Representation
Search
- Iterative Deepening
- Lazy SMP
- Principal Variation Search
- Aspiration Windows
- Transposition Table
- Move Ordering
- Selectivity
Evaluation
- Tapered Eval
- Piece-relative Piece-Square Tables
- 3x3 pawn structure tables
- Piece combinations
- Passed Pawns
- Evaluation Tuning using Gradient Descent
See also
Forum Posts
- Nalwald: Chess engine written in Nim by Jost Triller, Reddit, April 25, 2021
- Re: New engine releases & news 2021 (Nalwald 1.8.1) by Tony Mokonen, CCC, May 08, 2021
- Re: New engine releases & news 2021 (Nalwald 1.9) by Jost Triller, CCC, June 16, 2021
- Re: New engine releases & news 2021 (Nalwald 1.10) by Jost Triller, CCC, July 03, 2021
- Nalwald by Jost Triller, CCC, September 17, 2021
- Re:Nalwald by Jost Triller, CCC, February 08, 2022