Abulafia

Home * Engines * Abulafia



Abulafia, an UCI compliant experimental open source chess engine by Nicu Ionita, written in Haskell, and predecessor of Barbarossa. Abulafia uses monad transformers in continuation passing style to control the search.

=Features=

Board Representation

 * Bitboards
 * Magic Bitboards

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=
 * Material
 * Piece-Square Tables
 * Mobility
 * Center Control
 * King Safety
 * Passed Pawns
 * 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= Up one level