30 Weird Chess Algorithms: Elo World
suckerpinch8 HN recommenders · recommended in 6 months, 2019-2026
965K views · 7 years ago · explainer · evergreen
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.
33:48How AlphaZero Completely CRUSHED Stockfish
GothamChess
4.9M views • 5 years ago
16:18Computer program that learns to play classic NES games
suckerpinch
2.2M views • 13 years ago
24:13Uppestcase and Lowestcase Letters [advances in derp learning]
suckerpinch
477K views • 5 years ago
22:15Badness 0 (Apostrophe‛s version)
suckerpinch
258K views • 2 years ago
15:37Alpha Zero's "Immortal Zugzwang Game" against Stockfish
agadmator's Chess Channel
1.7M views • 8 years ago
55:02GradIEEEnt half decent: The hidden power of imprecise lines
suckerpinch
391K views • 3 years ago
4:17Dunkey's Guide to Streaming Services
videogamedunkey
2.7M views • 2 years ago
4:22SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
suckerpinch
84K views • 18 years ago
9:22The Best (and Worst) Ways to Shuffle Cards - Numberphile
Numberphile
2.3M views • 11 years ago
5:58MarI/O - Machine Learning for Video Games
SethBling
11.5M views • 11 years ago
5:34On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain
1.2M views • 9 years ago
9:01Youtube Takes Down CHESS PODCAST for Being HARMFUL or DANGEROUS
agadmator's Chess Channel
610K views • 6 years ago
19:08NaN Gates and Flip FLOPS
suckerpinch
314K views • 7 years ago
4:00Hitler reacts to functional programming
Rymdkraftverk
275K views • 7 years ago
39:47How lucky is too lucky?: The Minecraft Speedrunning Dream Controversy Explained
Stand-up Maths
8.4M views • 5 years ago
36:47Harder Drive: Hard drives we didn't want or need
suckerpinch
2.1M views • 4 years ago
57:03HACKENBUSH: a window to a new world of math
Owen Maitzen
562K views • 5 years ago
22:54I Built a COMPUTER in Magic: The Gathering
Because Science
2M views • 7 years ago
12:20I Solved Klotski
2swap
2.1M views • 1 year ago
54:15Google I/O 2011: Java Puzzlers - Scraping the Bottom of the Barrel
Google for Developers
60K views • 15 years ago
13 comments from Hacker News
In fact, you don't even need an LLM tournament when you can have tom7's Elo World tournament: ▶ this video
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
> I figured it's how they were able to weaken a chess engine back in the day; can't adjust the overall strength, so add random blunders. In tom7’s Elo World, he does this (“dilutes” strong Chess AIs with a certain percentage of random moves) to smooth the gradient since otherwise it would be impossible to evaluate his terrible chess bots against something like Stockfish since they’d just lose every time. ▶ this video
"I was initially hoping to get some insight on e.g. which pairs of squares had the fewest moves for a given piece etc." This may not be quite what you were asking for, but it's close, and has the advantage that I can link it right now. Tom7's Elo World chess video has where pieces start and end up, and their survival rates, as a chart: ▶ this video
Mine are "Harder Drives"[1], "ELO World"[2], and "Printable x86"[3] [1] link [2] ▶ this video [3] link
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
Tom's really mastered his skill of casual misleading, he adds these "wait, what?" moments to every video. A more notorious example will be his explanation of how optical reflection works, check out his "30 Weird Chess Algorithms" ( ▶ this video ) around 10:20. Edit: spelling.
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.
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
Only somewhat related, but if you found these ideas amusing, you'd probably enjoy watching tom7's video on unusual chess engine strategies: ▶ this video
I had just looked up this wiki article a couple days ago based on this video: ▶ this video , "30 Weird Chess Algorithms: Elo World" An intricate and lengthy account of several different computer chess topics from my SIGBOVIK 2019 papers. We conduct a tournament of fools with a pile of different weird chess algorithms, ostensibly to quantify how well my other weird program to play color- and piece-blind chess performs. On the way we "learn" about mirrors, arithmetic encoding, perversions of game tree search, spicy oils, and hats. Is this also why it showed up just now?
Suckerpinch (Tom) recently had a video[1] about predicting the position of the oponents pieces from knowning just white. I don't think he's aware of this. Great video anyway. He trained an NN to predict the pieces and then used Stockfish on the resulting position. [1] ▶ this video
Tom7 made a video also: ▶ this video If you haven’t seen them his other videos are well worth watching as well.