Difference between revisions of "Sunsetter"

From Chessprogramming wiki
Jump to: navigation, search
Line 1: Line 1:
'''[[Main Page|Home]] * [[Engines]] * Sunsetter'''
'''[[Main Page|Home]] * [[Engines]] * Sunsetter'''
[[FILE:Sunset with coconut palm tree, Fiji.jpg|border|right|thumb| Sunset  <ref>[https://en.wikipedia.org/wiki/Sunset Sunset] from [https://en.wikipedia.org/wiki/Fiji Fiji] over [https://en.wikipedia.org/wiki/Pacific_Ocean Pacific ocean] with [https://en.wikipedia.org/wiki/Coconut coconut palm tree], [https://commons.wikimedia.org/wiki/File:Sunset_with_coconut_palm_tree,_Fiji.jpg image] by Andrew Mandemaker, April 17, 2006, [https://creativecommons.org/licenses/by-sa/2.5/deed.en CC BY-SA 2.5], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]  
[[FILE:François Boucher 028.jpg|border|right|thumb| [[:Category:François Boucher|François Boucher]] - The Setting of the Sun <ref>[[:Category:François Boucher|François Boucher]] - [https://commons.wikimedia.org/wiki/File:Fran%C3%A7ois_Boucher_028.jpg The Setting of the Sun], 1752, [https://en.wikipedia.org/wiki/Wallace_Collection Wallace Collection], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]  
Line 55: Line 55:
[[Category:François Boucher]]

Latest revision as of 13:27, 17 March 2020

Home * Engines * Sunsetter

François Boucher - The Setting of the Sun [1]

an open source chess engine under the GNU General Public License v2.0 [2] that plays Bughouse and Crazyhouse - a separate version also orthodox chess. Sunsetter is written by Georg von Zimmermann in C++, recent versions co-authored by Ben Dean-Kawamura [3], available at GitHub, compliant to the Chess Engine Communication Protocol [4].



Move Generation

Sunsetter is a bitboard engine which uses rotated bitboards to calculate sliding piece attacks [6]. The board structure further keeps an 8x8 board, and Crazyhouse specific, a bitboard of promoted pawns, and piece-lists of each player's reserve (in hand), also keeping some incremental updated attack tables. Pseudo-legal moves are generated in four stages.


Sunsetter performs NegaScout with transposition table within its iterative deepening framework using a zero aspiration window to decide whether the forced re-search of the first move half-opens the window in plus or minus infinity direction [7]. Null move pruning, extended futility pruning, razoring and fractional extensions are used to shape the tree, which has considerable larger branching factor in Crazyhouse. Sunsetter features book learning based on the final result, where root moves receive a bonus if persistent from advantageous positions in previously won games.


Sunsetter's evaluation in centipawn resolution considers material, material in hand, board control, development, and king safety [8].

Forum Posts

2000 ...

2010 ...

External Links

Chess Engine



Up one level