From Chessprogramming wiki
Revision as of 14:21, 23 August 2020 by GerdIsenberg (talk | contribs) (Created page with "'''Home * Engines * Bonanza''' FILE:Bonanza main cast 1959.JPG|border|right|thumb| Bonanza team performs distributed tree search <ref>[https://commons.wik...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * Engines * Bonanza

Bonanza team performs distributed tree search [1]

Bonanza, (Bonanza Feliz)
a XBoard compliant Category:Open Source Shogi engine developed by primary author Kunihito Hoki, started in 2004, at times supported by Takuya Obata, Takuya Sugiyama, and Takeshi Ito [2]. Bonanza is top contender at Computer Olympiads and World Computer Shogi Championships and so far two times champion, winning the WCSC16 in 2006, and the WCSC23 in 2013 [3].


Bonanza is written in C and utilizes 9x9 Bitboards in form of three 32-bit unsigned integers. It is a fractional ply alpha-beta engine performing a principal variation search with transposition table, null move pruning, recursive iterative-deepening for PV-nodes, various extensions, reductions, and futility pruning. Bonanza pioneered in large-scale machine learning of static evaluation functions, a supervised tuning method based on move adaptation, dubbed the Bonanza Method which evolved to Minimax Tree Optimization (MMTO). Bonanza utilizes and tuned piece-square tables indexed by king location and further two-piece locations, dubbed KPP or KKP, which was used in many other Shogi programs [4], and has influenced the design of NNUE [5].

Beside a parallel tree search, Bonanza is able to apply parallelization by the so called Consensus method [6], a kind of triple-brain approach where multiple, slightly modified instances of the same engine vote for the best move [7] [8].


Forum Posts

External Links

Shogi Engine



Up one Level