TalkChess.com

It would appear ChessBase came to their senses and are now providing the entirety of the source (including the network) here https://github.com/DanielUranga/Stockfish/tree/ff2 . The FatFritz2 network can be downloaded here: https://github.com/DanielUranga/Stockfish/blob/ff2/src/FatFritz2_v1.bin . F...

Does the Fat Fritz 2 binary include the network, or is it a separate file? There is no other file they say. Only binary and hidden "inside" net. There are only three non-cosmetic changes to Stockfish in FF2 given the provided source code. https://github.com/DanielUranga/Stockfish/commit/e44edde482a...

A useless clone, taking advantage of the work of unpaid volunteers that didn't put a price tag for advancing computer chess, trying to get money from people that don't know better. Legal but shady. The scheme only work with deceptive marketing (using SF-dev for their clone, comparing performance to...

A useless clone, taking advantage of the work of unpaid volunteers that didn't put a price tag for advancing computer chess, trying to get money from people that don't know better. Legal but shady. The scheme only work with deceptive marketing (using SF-dev for their clone, comparing performance to...

Oh, it is not about possibility. I meant that there is no need of spending money for developing FF2. They didn't wrote a new engine or something. They just changed Stockfish and trained a new NNUE. If we have nothing to prove, everything is suspicion. They can train a strong NNUE with a few thousan...

Oh goodness. Do you actually have to buy it for 99 euros? I suspect a lot of money was spent on renting hardware to create that double-size network. They have to recover the cost somehow. I don't think so. Just a few changes in source and some analyzing job. For the size, no matter how many positio...

Oh goodness. Do you actually have to buy it for 99 euros? I suspect a lot of money was spent on renting hardware to create that double-size network. They have to recover the cost somehow. I don't think so. Just a few changes in source and some analyzing job. For the size, no matter how many positio...

Nay Lin Tun wrote: ↑

Sun Feb 07, 2021 10:33 am

Easy for human, Qxc6, found within 3-5 seconds.

I found in 3-5 seconds too.

Handicaps shouldn't be allowed in a tournament that is supposed to be fair. We want the strongest engines to crush the weaker ones because we're interested in their strength difference, and not good quality chess games. Well, we are actually. At least I am. If you are interested in Computer Chess G...

I think mobility may be undervalued in traditional evaluations. When we think of the size of the evaluation data calculated for programs like LC0, I guess we are evaluating 0.1% of the terms that LC0 evaluates. So in that case we are missing almost everything. In the case of NNUE type evaluations, ...