Abulafia
Revision as of 21:43, 28 November 2019 by GerdIsenberg (talk | contribs)
Abulafia,
an UCI compliant experimental open source chess engine by Nicu Ionita, written in Haskell, and predecessor of Barbarossa [2].
Abulafia uses monad transformers
[3]
[4]
in continuation passing style to control the search.
Features
Board Representation
Search
- Iterative Deepening
- Principal Variation Search (PVS)
- Transposition Table
- Late Move Reductions
- Null Move Pruning
- Futility Pruning
- Quiescence Search
- Internal Iterative Deepening
Evaluation
See also
Forum Posts
- Abulafia, chess, Haskell and some (new?) ideas by Nicu Ionita, CCC, April 20, 2012
- The best chess engine written in Haskell by Ruxy Sylwyka, CCC, January 18, 2013
External Links
Chess Engine
Misc
References
- ↑ An illuminated page from Abraham Abulafia's Light of the Intellect (1285), The Vatican Library, Unknown artist; the author of the book is Abulafia, Kabbalah from Wikipedia, Wikimedia Commons
- ↑ Barbarossa 0.1.0 by Nicu Ionita, CCC, November 24, 2013
- ↑ Haskell/Monad transformers - Wikibooks
- ↑ Haskell/Understanding monads - Wikibooks
- ↑ Abulafia/Magics.hs at master · nionita/Abulafia · GitHub