Difference between revisions of "Belzebub"
GerdIsenberg (talk | contribs) (Created page with "'''Home * Engines * Belzebub''' FILE:Beelzebub.png|border|right|thumb| Beelzebub <ref>Beelzebub as depicted in [https://en.wikipedia.org/wiki/Collin_de_Pl...") |
GerdIsenberg (talk | contribs) |
||
Line 14: | Line 14: | ||
<span id="Repetitions"></span> | <span id="Repetitions"></span> | ||
==Repetitions== | ==Repetitions== | ||
− | Like [[TSCP]], Belzebub uses following algorithm to detect [[Repetitions|repetitions]], credited to [[John Stanback]], originated from [[SCP]] and his [[GNU Chess]] versions <ref>[https://www.stmintz.com/ccc/index.php?id=119911 Re: Detecting three-fold repetition?] by [[John Stanback]], [[CCC]], July 17, 2000</ref>. However, it may detect false repetitions in case of exchanging two unequal pieces <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=490672&t=45846 Re: Move Tables - explain as if I'm five] by [[Karlo Bala Jr.]], [[CCC]], November 05, 2012</ref>. Further, the routine keeps the [https://en.wikipedia.org/wiki/Garbage_collection_%28computer_science%29 garbage collector] busy by allocating the integer array each call, even if the [[Fifty-move Rule|fifty move counter]] is less or equal three. | + | Like [[TSCP]], Belzebub uses following algorithm to detect [[Repetitions|repetitions]], credited to [[John Stanback]], originated from [[SCP]] and his [[GNU Chess]] versions <ref>[https://www.stmintz.com/ccc/index.php?id=119911 Re: Detecting three-fold repetition?] by [[John Stanback]], [[CCC]], July 17, 2000</ref>. However, it may detect false repetitions in case of exchanging two unequal pieces <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=490672&t=45846 Re: Move Tables - explain as if I'm five] by [[Karlo Balla|Karlo Bala Jr.]], [[CCC]], November 05, 2012</ref>. Further, the routine keeps the [https://en.wikipedia.org/wiki/Garbage_collection_%28computer_science%29 garbage collector] busy by allocating the integer array each call, even if the [[Fifty-move Rule|fifty move counter]] is less or equal three. |
<pre> | <pre> | ||
/* reps() returns the number of times that the current | /* reps() returns the number of times that the current |
Latest revision as of 18:48, 19 February 2020
Belzebub,
a WinBoard compliant open source chess engine written by Radosław Kamowski in Java, released in May 2002 as free chess game for mobile phones. Belzebub played the first and second Polish Computer Chess Championship. After finishing last at the PCCC 2002, Belzebub became runner-up of the uniform category at the PCCC 2003 behind Tytan.
Contents
Etymology
Belzebub is the Polish diction of Beelzebub or Baalzebûb, Arabic: بعل الذباب, Ba‘al az-Zubab, literally "Lord of the Flies", a Semitic deity that was worshiped in the Philistine city of Ekron. In later Christian and Biblical sources, Beelzebub is referred to as another name for Devil [2] [3] [4]. In Christian demonology, classified by Peter Binsfeld in Tractatus de confessionibus maleficorum & Sagarum an et quanta fides iis adhibenda sit, 1589 [5], Beelzebub is one of the seven Princes of Hell [6] associated with gluttony, one of the seven deadly sins. Gluttony also occurs in chess [7] or even more in computer chess with basically material based evaluation, i.e. grabbing unimportant pawns with the queen, ignoring development and king safety.
Description
Search
Belzebub uses plain 8x8 board arrays, and applies alpha-beta with null move pruning inside an iterative deepening framework with aspiration windows. Move ordering considers the principal variation from previous iteration maintained in a triangular PV-table, MVV-LVA for captures and killer- and history heuristic otherwise.
Repetitions
Like TSCP, Belzebub uses following algorithm to detect repetitions, credited to John Stanback, originated from SCP and his GNU Chess versions [8]. However, it may detect false repetitions in case of exchanging two unequal pieces [9]. Further, the routine keeps the garbage collector busy by allocating the integer array each call, even if the fifty move counter is less or equal three.
/* reps() returns the number of times that the current position has been repeated. Thanks to John Stanback for this clever algorithm. */ int reps() { int i; int b[] = new int[64]; int c = 0; /* count of squares that are different from the current position */ int r = 0; /* number of repetitions */ /* is a repetition impossible? */ if (fifty <= 3) { return 0; } /* loop through the reversible moves */ int m = hply - fifty - 1; if (m < 0) { m = 0; } // gdy gra jest wznawiana to tablica hist jest pusta for (i = hply - 1; i >= m; --i) { if (++b[hist_from[i]] == 0) { --c; } else { ++c; } if (--b[hist_to[i]] == 0) { --c; } else { ++c; } if (c == 0) { ++r; } } return r; }
Selected Games
PCCC 2003 - Belzebub - Robin [10]
[Event "PCCC 2003"] [Site " Łódź, Poland"] [Date "2003.08.?"] [Round "?"] [White "Belzebub"] [Black "Robin"] [Result "1-0"] 1.Nf3 Nf6 2.e3 e6 3.Bb5 Be7 4.d4 O-O 5.O-O d5 6.Re1 Bd7 7.Bd3 c5 8.Bd2 Nc6 9.Nc3 Rc8 10.Bb5 Ne4 11.a4 Nxd2 12.Qxd2 cxd4 13.exd4 Bb4 14.Re3 Qa5 15.Qd1 a6 16.Bxc6 Bxc6 17.Ne2 Be8 18.c3 Be7 19.b3 Bd8 20.Re5 Bd7 21.Rh5 f6 22.Qc2 g6 23.Rh6 Re8 24.Nh4 Kg7 25.Rxh7+ Kxh7 26.Qxg6+ Kh8 27.Qf7 Rg8 28.Nf4 Rg7 29.Nhg6+ Kh7 30.Nf8+ Kh8 31.N4g6+ Rxg6 32.Nxg6# 1-0
External Links
Chess Engine
Demonology
- Belzebub from Wikipedia.pl (Polish)
- Beelzebub from Wikipedia
- Baalzebub (Beelzebub) - Hastings' Dictionary of the Bible
- Baal (demon) from Wikipedia [11]
- Classification of demons from Wikipedia
- List of demons in the Ars Goetia from Wikipedia
Misc
- Beelzebub (disambiguation) from Wikipedia
- Beelzebub - Final Fantasy Encyclopaedia
- Beelzebub (manga) from Wikipedia
- Beelzebub's Tales to His Grandson - Wikipedia
- Baal from Wikipedia
- Fly from Wikipedia
- Baalzebul (Dungeons & Dragons) from Wikipedia
- Lord of the Flies from Wikipedia
- Lord of the Flies (disambiguation) from Wikipedia
- Bruford - Beelzebub (Rock Goes to College, 1979, BBC series), YouTube Video
References
- ↑ Beelzebub as depicted in Collin de Plancy's Dictionnaire Infernal (Paris, 1863)
- ↑ Catholic Encyclopedia: Beelzebub
- ↑ New Advent Bible: Matthew 12:24-29
- ↑ New Advent Bible: Luke 11:15-22
- ↑ historicum.net: Traktate: Binsfeld (Themenschwerpunkt Hexenverfolgung)
- ↑ Beelzebub from Wikipedia
- ↑ Reykjavik Open 2013. Fifth round. The advantages of communing with nature | WhyChess
- ↑ Re: Detecting three-fold repetition? by John Stanback, CCC, July 17, 2000
- ↑ Re: Move Tables - explain as if I'm five by Karlo Bala Jr., CCC, November 05, 2012
- ↑ II Mistrzostwa Polski Programów Szachowych - PGN
- ↑ The demon Bael from Collin de Plancy's Dictionnaire Infernal, 1862