Home * Engines * Barbarossa
146px-Friedrich_I._Barbarossa.jpg

Barbarossa,
an UCI compliant open source chess engine by Nicu Ionita, first released in Fall 2013 as successor of Abulafia [1] , both written in Haskell [2] [3] . It uses bitboards to represent the board, and magic bitboards [4] to determine sliding piece attacks. Barbarossa applies an alpha-beta search [5] utilizing a transposition table indexed by Zobrist keys, and uses the functional programming concept of monad transformers [6] [7] in continuation passing style to control the search. Some evaluation parameters were tuned by Rémi Coulom's CLOP, and more recently by MMTO as introduced by Kunihito Hoki and Tomoyuki Kaneko in the domain of Shogi [8] [9] .
Barbarossa [10]

See also


Forum Posts


External Links

Chess Engine

Misc


References

  1. ^ Barbarossa 0.1.0 by Nicu Ionita, CCC, November 24, 2013
  2. ^ Abulafia, chess, Haskell and some (new?) ideas by Nicu Ionita, CCC, April 20, 2012
  3. ^ Haskell (programming language) from Wikipedia
  4. ^ Barbarossa/Magics.hs at master · nionita/Barbarossa · GitHub
  5. ^ Barbarossa/Albeta.hs at master · nionita/Barbarossa · GitHub
  6. ^ Haskell/Monad transformers - Wikibooks
  7. ^ Haskell/Understanding monads - Wikibooks
  8. ^ Kunihito Hoki, Tomoyuki Kaneko (2014). Large-Scale Optimization for Evaluation Functions with Minimax Search. JAIR Vol. 49, pdf
  9. ^ MMTO for evaluation learning by Jon Dart, CCC, January 25, 2015
  10. ^ Bust of Friedrich I., "Barbarossa", gilded bronze, ca. 1160, given to his godfather Count Otto of Cappenberg in 1171. It was used as a reliquary in Cappenberg Abbey, St. Johannes Evangelist Church, Wikimedia Commons

What links here?


Up one level