Latest revision as of 02:30, 7 September 2024

Home * Engines * Nalwald

Nalwald logo ^[1]

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.

Features

@@ Line 33: / Line 33: @@
 ** [[Late Move Reductions]]
 ** [[Check Extensions]]
-** [[Futility_Pruning]]
+** [[Futility Pruning|Futility Reductions]]
 ** [[Quiescence Search]]
 ** [[Delta Pruning]]
@@ Line 41: / Line 41: @@
 * 3x3 pawn structure tables
 * Piece combinations
-* [[Passed Pawns]]
+* [[Passed Pawn|Passed Pawns]]
 * [[Automated Tuning|Evaluation Tuning]] using [https://en.wikipedia.org/wiki/Gradient_descent Gradient Descent]