Nalwald

Home * Engines * Nalwald

Nalwald logo

Nalwald,
an UCI compatible open source chess engine by Jost Triller, written in the Nim programming language , first released in April 2021 . 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 . Nalwald uses alpha-beta for search and a BAE (big array evaluation) for evaluating leaf nodes.

Features

Board Representation

• Bitboards
• Kindergarten Bitboards

Search

• Iterative Deepening
• Lazy SMP
• Principal Variation Search
• Aspiration Windows
• Transposition Table
• Move Ordering
  • Hash Move
  • Static Exchange Evaluation
  • Killer Heuristic
  • History Heuristic
  • Countermove Heuristic
  • Internal Iterative Deepening
• Selectivity
  • Null Move Reductions
  • Late Move Reductions
  • Check Extensions
  • Futility Reductions#Futility Pruning
  • Quiescence Search
  • Delta Pruning

Evaluation

• Tapered Eval
• Piece-relative Piece-Square Tables
• 3x3 pawn structure tables
• Piece combinations
• Passed Pawns
• Evaluation Tuning using Gradient Descent

See also

• Googleplex Starthinker
• Hactar

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

External Links

Chess Engine

• tsoj / Nalwald · GitHub
• Nalwald in CCRL Blitz

Misc

• Nalwald | PaxCalradica Wiki | Fandom

References

Up one Level