Abulafia

Home * Engines * Abulafia

[ Abulafia’s Light of the Intellect (1285) [1] 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

• Bitboards
• Magic Bitboards [5]

Search

• Iterative Deepening
• Principal Variation Search (PVS)
• Transposition Table
• Late Move Reductions
• Null Move Pruning
• Futility Pruning
• Quiescence Search
• Internal Iterative Deepening

Evaluation

• Material
• Piece-Square Tables
• Mobility
• Center Control
• King Safety
• Passed Pawns

See also#

• Barbarossa

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#

• nionita/Abulafia · GitHub
• Abulafia 0.61 in CCRL 40/4

Misc#

• Abulafia (disambiguation) from Wikipedia
• Abraham Abulafia from Wikipedia
• Meir Abulafia from Wikipedia

References#

1. ↑ 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
2. ↑ Barbarossa 0.1.0 by Nicu Ionita, CCC, November 24, 2013
3. ↑ Haskell/Monad transformers - Wikibooks
4. ↑ Haskell/Understanding monads - Wikibooks
5. ↑ Abulafia/Magics.hs at master · nionita/Abulafia · GitHub

Up one level