This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

Barbarossa

Home * Engines * Barbarossa

Barbarossa 1Barbarossa 1

  1. 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↩︎

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. Discrete SPSA (DSPSA), introduced by Qi Wang 10 was applied in pawn evaluation tuning 11 .

Contents
  1. See also
  2. Forum Posts
    1. 2012 ...
    2. 2020 ...
  3. External Links
    1. Chess Engine
    2. Misc
  4. References

See also

Forum Posts

2012 ...

2020 ...

Chess Engine

Misc

References

Up one level

  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. Qi Wang (2013). Optimization with Discrete Simultaneous Perturbation Stochastic Approximation Using Noisy Loss Function Measurements. Ph.D. thesis, Johns Hopkins University, advisor James C. Spall↩︎

  11. DSPSA eval weights for pawns · nionita/Barbarossa@b9ba4de · GitHub↩︎

Categories: UCI · Open Source · Haskell · Legend · Nobility

What links here

Contributors: GerdIsenberg.