BTW. "unpleasant surprises" is rather a joke for trolls!
Sting SF Black Hole 11
Moderator: Ras
-
lech
- Posts: 1175
- Joined: Sun Feb 14, 2010 10:02 pm
Re: Sting SF Black Hole 11
Sting-sf-bh-11x ( download: https://www.mediafire.com/file/oicgues2 ... 1.zip/file) works only in this way: If MultiPV>1 then both OldSting xor BlackHole ideas don't work.
BTW. "unpleasant surprises" is rather a joke for trolls!
BTW. "unpleasant surprises" is rather a joke for trolls!
Maybe, I can't be friendly, but let me be useful.
-
chessica
- Posts: 1008
- Joined: Thu Aug 11, 2022 11:30 pm
- Full name: Esmeralda Pinto
Re: Sting SF Black Hole 11
Hehehe,
Could you please show two examples of each engine that demonstrate its special capabilities compared to Stockfish?
-
lech
- Posts: 1175
- Joined: Sun Feb 14, 2010 10:02 pm
Re: Sting SF Black Hole 11
Both UCI options, OldSting and BlackHole are different attempts to solve the same problem: reaching an area unserved by a classic heuristic algorithm. Perhaps they could be combined, but that would require a lot of testing (setup). I'm not sure I want to do it. The current Sting-sf-bh-11x solution satisfies me.
Maybe, I can't be friendly, but let me be useful.
-
Chacal X
- Posts: 103
- Joined: Mon Mar 10, 2025 9:06 pm
- Full name: flavio thomazini
Re: Sting SF Black Hole 11
lech wrote: ↑Sat Jan 03, 2026 2:05 pm Both UCI options, OldSting and BlackHole are different attempts to solve the same problem: reaching an area unserved by a classic heuristic algorithm. Perhaps they could be combined, but that would require a lot of testing (setup). I'm not sure I want to do it. The current Sting-sf-bh-11x solution satisfies me.
I would like to congratulate you on this compilation; it has excellent performance, especially in 5+0 and 3+0 blitz, with depth in the analysis and in the search for checkmate.
One observation: if possible, add 2 more book bins; the program will be perfect. I believe it can face any elite engine without fear!
Flavio/
-
lech
- Posts: 1175
- Joined: Sun Feb 14, 2010 10:02 pm
Re: Sting SF Black Hole 11
Chess is primarily (by definition) a game, and thus the "classical" heuristic (or NN) algorithm achieved its primary goal: the machine defeated the human. However, there are specific input data (chess positions – studies) that this algorithm doesn't handle correctly, which may be merely a statistical (irrelevant) problem for the game, but are of very serious interest to another real group of people, so-called enthusiasts or creators of chess studies.
Therefore, based on the logical problem of chess, one can attempt to develop a general model (not special additions – tricks
) of the algorithm (AI) that will ensure that the lack of a good decision is actually the result of abstract input data (statistical error).
BTW, Sting should be compared (ELO) to the very old Stockfish 2.1.1 (is based on).
Therefore, based on the logical problem of chess, one can attempt to develop a general model (not special additions – tricks
BTW, Sting should be compared (ELO) to the very old Stockfish 2.1.1 (is based on).
Maybe, I can't be friendly, but let me be useful.