> Rating Stockfish against a human scale, such as FIDE Elo, has become virtually impossible. The gap in strength is so large that a human player cannot secure the necessary draws or wins for an accurate Elo measurement.
3,662 karma · joined June 12, 2010
Project: ibexlang.org // Fast data frames
Blog: bobjansen.net
Moderator at http://quant.stackexchange.com
> Rating Stockfish against a human scale, such as FIDE Elo, has become virtually impossible. The gap in strength is so large that a human player cannot secure the necessary draws or wins for an accurate Elo measurement.
This doesn't sound like a good idea to me.
At least, that’s my reading but it appears it confuses about half of the commenters here.
Comments should answer the question why you are not using some kind of hash set and do a single pass over the data and why it's OK to reorder the strings. One could reasonable expect that Dedupe shows first occurrences in order.
I believe it to be likely that the C programmer would even writes the code faster and better because of the useful abstractions. An LLM will certainly write the code faster but it will contain more bugs (IME).
https://github.com/bobjansen/mealmcp
There is a website too so you don’t actually need to use MCP:
Legal: doesn’t break the rules of chess. For example: no pawns on the eighth rank or in check when it’s not their turn.
Reachable: there is a series of moves that lead to this position from the standard starting position.
The attacker sends an email to the user which is intercepted by Copilot which processes the email and embeds the email for RAG. The mail is crafted to have a high likelihood to be retrieved during regular prompting. Then Copilot will write evil markdown crafted to exfiltrate data using GET parameters so the attack runs when the mail is received.
It would be incredibly tedious to be surprised every 5 seconds.