r/ComputerChess • • Sep 06 '26 Bravo

I replayed 1.6 billion Lichess games to work out which openings actually win at your rating

40 Upvotes

Hey all,

The thing that's always annoyed me with online opening preparation tools, courses and books is that they present a one-size-fits-all solution for openings, and usually rely on hand-picked lines that the author thinks will come up most in games. The problem with this approach is that if you are not 2400+, you end up drilling positions that you would most likely never see in a real game at your level.

I analyzed about three years worth of games played on lichess -- 1.6 billion of them -- and built a tree of ~25 million positions that records how every move actually performed across nine rating bands. For example, below 1200 the Najdorf main line (6.Bg5 e6 7.f4 Be7 8.Qf3 Qc7 9.O-O-O Nbd7) turns up about once every 2,300 games. The table below shows, for four heavily studied main lines, in how many games you can expect to reach one as Black if you actively try to go for it every single game:

Rating bandNimzo-Indian (Rubinstein, 6...c5)Ruy Lopez (Marshall, 8...d5)King's Indian (Mar del Plata, 8...Ne7)Sicilian (Najdorf, 9...Nbd7)
<10001,4765031,8752,246
1000-11991,0922213,0602,518
1200-13997051477451,302
1400-1599460971,222639
1600-179927964344246
1800-199919745174100
2000-2199188367042
2200-2399179343125
2400+157402326

Studying "main lines" doesn't make much sense unless you are already strong enough to reach them. What you should be drilling instead is what you actually expect to see at your level -- some sidelines that courses barely cover come up constantly in certain rating bands, so the distribution you practise against ends up looking nothing like the one you play against. The question you should therefore be asking is not what the most played or most recommended move in an opening is, but which move has the highest probability of getting you into middlegames that people at your level handle best.

We can use a variation of the expectimax algorithm to compute an expected score for each side, assuming your opponent plays like a typical opponent at a given level. An engine eval gives you a material and positional evaluation that might be hard to convert. This gives you a percentage instead, which is your expected score if you follow the recommended lines down the tree against an opponent of your own strength. An eval of 63% means you expect to score 0.63 per game (0 for a loss, 0.5 for a draw, 1 for a win). Because the algorithm is made to pick paths that lead to the best expected outcomes, it tends to prioritize sharp lines and often recommends gambits.

I have built a small, free, no-account website that lets you explore expectimax scores in the opening:

Link: https://outofbook.study

It also lets you drill openings at your level against a random distribution of what players at your level actually play, so you see every variation with the approximate frequency you'd get it in real games.

I plan to open-source the UI, server and analysis once I clean up the code a little bit. Happy to answer questions on the research, or complaints about what's broken or confusing about it.

Edit:
Code: https://github.com/nick-nikolov-00/out-of-book


r/ComputerChess • • Oct 27 '22

Who Needs Stockfish?

Post image
40 Upvotes

r/ComputerChess • • Feb 02 '21

Stockfish Defeats Lc0 in TCEC 20 Superfinal

Thumbnail thechessmind.net
38 Upvotes

r/ComputerChess • • Feb 19 '23

Man beats machine at Go in human victory over AI

Thumbnail
arstechnica.com
37 Upvotes

r/ComputerChess • • Sep 01 '25

Quantum chess online

Post image
36 Upvotes

A bit off the topic I suppose, but it's about chess and computers.

I made an implementation of quantum chess, as a free public play zone, it's online already at http://q-chess.com/. The rules are more or less usual for quantum chess (if there's such a thing), all described in detail and with illustrations. Split and merge moves, superposition and observations, I tried to stick to the canon as closely as possible.

There's a computer opponent, you can invite somebody to play against you, and theoretically you can just get paired with somebody, like in normal chess apps.


r/ComputerChess • • Oct 11 '22

Why Duck Chess is a beast

36 Upvotes

Duck chess is being played a lot right now. And while some people might just see it as a silly variant, from a theoretical perspective it is an absolute beast. Why?

The main reason why it is so much harder to create a super-human engine for the game of Go than it is for chess is that the average branching factor (which is basically the average number of legal moves) in Go is much higher than in chess.

To put it in numbers: the average branching factor for chess is estimated at about 35 while Go stands at 250. And what about duck chess?

Well, a conservative estimate would be to multiply the average 35 of standard chess with the number of duck moves, which is at least 31 (if all 33 pieces are still on the board there are 31 empty spaces).

Which means the conservative estimate for the branching factor in duck chess is 1085 (!!) dwarving both normal chess and Go.

So if Eric Rosen ever becomes a duck chess super GM, it might be possible that no engine could ever beat him ;)


r/ComputerChess • • May 03 '21

Stockfish (contempt 100) beat chess.com's engine set to 2900 with rook odds!

36 Upvotes

https://www.chess.com/analysis?autorun=true&pgn=%5BEvent%20%22vs%20Computer%22%5D%0A%5BSite%20%22Chess.com%22%5D%0A%5BDate%20%222021.04.17%22%5D%0A%5BRound%20%22?%22%5D%0A%5BWhite%20%22calaisawesome%22%5D%0A%5BBlack%20%22Super%20Grandmaster%22%5D%0A%5BResult%20%221-0%22%5D%0A%5BSetUp%20%221%22%5D%0A%5BFEN%20%22rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/1NBQKBNR%20w%20Kkq%20-%200%201%22%5D%0A%5BTimeControl%20%22-%22%5D%0A%0A1.%20e4%20d5%202.%20exd5%20e6%203.%20Bb5%2B%20Bd7%204.%20dxe6%20Qe7%205.%20Be2%20Qxe6%206.%20Nf3%20Nf6%207.%20a3%20Bd6%208.%0AO-O%20O-O%209.%20d4%20Ne4%2010.%20Bd3%20%7B%5B%25cal%20dd3h7%5D%5B%25c_arrow%20d3h7;from;d3;to;h7%5D%7D%2010...%20f5%0A11.%20Nbd2%20Nxd2%2012.%20Bxd2%20%7B%5B%25csl%20dd2,dd3%5D%5B%25c_square%20d2;square;d2,d3;square;d3%5D%7D%0A12...%20Re8%2013.%20Ng5%20%7B%5B%25cal%20dg5h7%5D%5B%25c_arrow%20g5h7;from;g5;to;h7%5D%5B%25csl%20dh7%5D%5B%25c_square%0Ah7;square;h7%5D%7D%2013...%20Qd5%2014.%20Qh5%20h6%2015.%20c4%20Bxh2%2B%2016.%20Kh1%20Qc6%2017.%20Qf7%2B%20Kh8%2018.%0AKxh2%20Qd6%2B%2019.%20f4%20hxg5%2020.%20Rh1%20Re6%2021.%20Kg1%2B%20Rh6%2022.%20Rxh6%2B%20Qxh6%2023.%20fxg5%20Qe6%2024.%0AQh5%2B%20%7B%5B%25cal%20dg5g6%5D%5B%25c_arrow%20g5g6;from;g5;to;g6%5D%7D%2024...%20Kg8%2025.%20g6%20Na6%2026.%20d5%0AQb6%2B%2027.%20Kh2%20Qd6%2B%2028.%20g3%20f4%2029.%20Qh7%2B%20Kf8%2030.%20Qh8%2B%20Ke7%2031.%20Qxg7%2B%20Ke8%2032.%20Bxf4%20Qf8%0A33.%20Qe5%2B%20Kd8%2034.%20g7%20Qe8%2035.%20Qxe8%2B%20Bxe8%2036.%20g8%3DQ%20Nc5%2037.%20Bg6%20Ke7%2038.%20Qg7%2B%20Bf7%2039.%0AQxf7%2B%20Kd8%2040.%20Qxc7%23%201-0&tab=report&referrer=vs-computer-game-report


r/ComputerChess • • Mar 28 '22

Stockfish wins TCEC Season 22 Premier Division

Thumbnail
chessdom.com
35 Upvotes

r/ComputerChess • • Jun 22 '23

Stockfish 16 is ready

34 Upvotes

Unless an issue is found, Stockfish 16 will be released by the end of next week.

Downloads are available temporarily here https://github.com/official-stockfish/Stockfish/releases/tag/stockfish-dev-20230622-a49b3ba7


r/ComputerChess • • Jun 23 '22

Public court hearing soon! - Stockfish

Thumbnail
stockfishchess.org
34 Upvotes

r/ComputerChess • • Jan 17 '21

Maia Chess: A human-like neural network chess engine

Thumbnail
maiachess.com
33 Upvotes

r/ComputerChess • • Jul 02 '20

Stockfish takes its revenge against Leela, winning the TCEC 18 title

Thumbnail self.chess
33 Upvotes

r/ComputerChess • • 18d ago

Kallisto, private engine, no one sell it, lost forever it seems.

Post image
32 Upvotes

r/ComputerChess • • Dec 02 '22

I have released Numbfish, a strong python engine which uses NNUE!

32 Upvotes

Hi,

I have created Numbfish, a strong python chess engine based on Sunfish but with some additional features, the most important of which is the Efficiently Updatable Neural Network (NNUE). For the first time ever, NNUE has been implemented in python, specifically numpy (and tflite) using the incremental updates just like Stockfish does in C++. The result is a very strong engine, much stronger than Sunfish. The additional positional information from NNUE makes this engine probably the strongest python engine running on 1-thread CPU.

You can challenge it also on lichess for 5+0 min games:

https://lichess.org/@/numbfish_bot

Also, here is the repo. https://github.com/dimdano/numbfish

Supports both UCI protocol and regular play from the terminal. Please, leave a star ⭐ if you like it . If you make Numbfish stronger I will merge your improvements!


r/ComputerChess • • Nov 06 '21

On this day in 1956, the MANIAC I supercomputer in Los Alamos became the first computer to ever defeat a human in chess. Playing a simplified 6x6 version of the game, the half-ton behemoth checkmated a lab assistant in 23 moves.

Post image
32 Upvotes

r/ComputerChess • • Aug 23 '20

Youtube channel about how to write a chess engine in C from scratch

Thumbnail
youtube.com
32 Upvotes

r/ComputerChess • • Sep 26 '26

We built a pipeline that turns a player's own games into opening lessons

31 Upvotes

Stockfish finds the recurring mistakes, then every generated line is engine-checked.

For years my friends and I wanted lessons built from our own games instead of generic puzzles. We never found it, so we built it, beta-tested it with friends, and are now launching it now.

Example built on GothamChess's games: chessxray.com/p/gothamchess
His first weapon with White, the Trompowsky: 889 games, 63.4%, and three automatic moves that are still costing him points.

Drop your chess.com username in the comments.

The first 5: your full course, free.

The next 20: two free masterclasses on your openings, one as White and one as Black, built on the ones that cost you the most.

Everyone else: up to 25% off with the code REDDIT at chessxray.com


r/ComputerChess • • Apr 20 '22

Humaia: An attempt to make the most human Lichess bot.

31 Upvotes

This is a bot I created that uses the Maia 1400 network in a modified version of Lc0 so that instead of always picking the most likely human move, it picks a move randomly based on the likelihood that a human of that level would play it.

This means that you'll get a wide variety of openings, middle games, and end games, good, bad, and tricky. You'll also see blunders, confused moves, aggressive moments, and more.

In short, you'll (hopefully) feel like you're playing against a human being.

Here it is on Lichess!

PS: It is running on my computer, so it may be down sometimes. I'm looking into getting a server for it.


r/ComputerChess • • Jul 24 '21

How do I go about trying to modify Stockfish?

31 Upvotes

Sorry if this is not the right place to ask, but I'm trying to modify Stockfish so it plays as if en passant is forced. (as it should)

I've looked into fairy-max and it doesn't seem possible with it.

So I cloned the stockfish github repo, basically copied the part where it generates en passant moves and pasted it into the final move generation function so that if there is a pseudo legal en passant, you either have to take it or it's stalemate/checkmate depending on if the king is in check or not, and compiled it.

It seems to be working in the sense it won't make an "illegal" move, but it doesn't look ahead knowing that it can force the opponent to take en passant.

For example this extremely common position gives me Rxc8 instead of the mate in 8 forcing a4, but in this position black's brillant d5!! forces a stalemate.

I don't really know that much about c++ or AI, but my best guess would be to look into evaluate.cpp or movepick.cpp, any pointers would be greatly appreciated.


r/ComputerChess • • Aug 08 '20

Stockfish introduces neural network (NNUE) evaluation to the repo. +80 elo improvements already.

Thumbnail
blog.stockfishchess.org
31 Upvotes

r/ComputerChess • • Apr 01 '26

I ran Stockfish on 100 of my games and mapped where I actually blunder. Turns out it's not random.

30 Upvotes

I kept feeling like I was losing games the same way over and over.

Not “random blunders” like the exact same dumb mistakes.

So I took ~100 of my games, ran them through Stockfish, and mapped where on the board my worst moves happen.

Turns out my blunders are NOT random.

They cluster on specific squares like I have “danger zones” where my brain just shuts off.

Some things I noticed:

  • There’s a hotspot around f3 / d3 where I just self-destruct

  • I treat my knights like kamikaze missiles instead of actual pieces

  • I randomly take c4 as black way too often (no idea why)

  • Somehow my bishops are the only pieces behaving like adults

Different games… same squares.

Next thing I want to try is splitting it by openings (like Sicilian vs London) to see if the heatmap changes.


r/ComputerChess • • Jun 09 '25

I made a chess website that lets you see every move evaluation. You can play at ChessFish.io

Post image
30 Upvotes

r/ComputerChess • • Apr 30 '23

Conchess vintage computer

Thumbnail
gallery
30 Upvotes

Hi everyone, (First of all I'm french oui oui baguette so my English is bad.) I found this old conchess Computer, escorter version, from the 80's in a thriftshop for 10e. For most of all it's working perfectly and I'm glad to that. Due to the short existence of the conchess company, there is not mutch information on internet. (This board won a world championship of chess computer in 1984 apparently.) If anybody knows something about it I would be glad to read it.

À la prochaine !