HackerTube

30 Weird Chess Algorithms: Elo World

suckerpinch8 HN recommenders · recommended in 6 months, 2019–2026
YouTube
explainer · general · evergreen · 2019–2026 on HN

Tom Scott-style absurdist tour by Tom7 of SIGBOVIK chess projects: a tournament of 30 weird chess algorithms used to rate a color- and piece-blind chess program. Topics include mirrors, arithmetic encoding, perverted game tree search and a diluted Stockfish.

HN commenters call it a must-watch for its deadpan, absurdly elaborate engineering and cite it for ideas like diluting strong engines with random moves.

12 comments from Hacker News

@GuestHNUser2022-04 · in “Harder Drive: Hard drives we didn't want or need [video]”

Tom7 is brilliant for anyone that hasn't seen him before. His Reverse Emulation video ( link ) and Weird Chess Algorithms ( ▶ this video ) are a must watch. His dead pan delivery coupled with the ridiculous amount of effort he puts into things that don't _really_ matter is honestly inspiring.

Strongly recommends View on HN
@Rendello2026-05 · in “Regex Chess: A 2-ply minimax chess engine in 84,688 regular expressions”

This reminded me of Tom7's video where he made a bunch of ridiculous engines and pitted them against each other (and against "diluted" versions of Stockfish): ▶ this video link

Recommends View on HN
@iamevn2023-07 · in “GradIEEEnt half decent: The hidden power of imprecise lines [video]”

Anything that catches your eye is good but my favorites are: 30 Weird Chess Algorithms: ELO World ▶ this video Reverse Emulating the NES to give it SUPER POWERS! link

Recommends View on HN
@nick-of-time2023-07 · in “GradIEEEnt half decent: The hidden power of imprecise lines [video]”

Mine are "Harder Drives"[1], "ELO World"[2], and "Printable x86"[3] [1] link [2] ▶ this video [3] link

Recommends View on HN
@sillysaurusx2020-01 · in “Training GPT-2 to Play Chess”

It's unknown what role if any BPE plays. I was surprised to discover that the final probability of a move is equal to the probability of each token from the root prompt, i.e. even though "1.Nf3 e5" is encoded as ['1', '.', 'N', 'f', '3', ' e', '5'] the probability of e5 seems unaffected by the fact that Nf3 is 3 tokens as opposed to one. You're right that coming up with a token mapping could help things. It's a bit tricky to do that right now. Your options for fitting a custom vocab seems to be "use sentencepiece to fit a vocab, then modify the gpt-2 codebase to use the sentencepiece library for decoding". I am honestly not sure if the output of sentencepiece is compatible with traditional encoders. What I mean is, it doesn't seem to generate an encoder.json + vocab.bpe file. It seemed to be some other kind of format. So I'm not sure if the tooling that has evolved around OpenAI's encoder format would be applicable there. I really don't know, though. According to this slatestarcodex comment, someone got superior results on solely algebraic notation (which looks like g1f3 instead of Nf3): link Another extension that might help is to periodically inject the full FEN board state. This was the format we were going to try next, which injects the full FEN after every move: link I'm so happy to get to work with GPT-2 1.5B. It's been a lot of fun to train. By the way, if you like this kind of thing, you'll love Elo World. ▶ this video

Recommends View on HN