Changes

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.