2/28/2022 – You know the problem: can you place eight queens on a chessboard so that now two queens threaten each other. There are 92 distinct ways of doing this. But how about on larger chessboards? For 27×27 board people have worked out that there are exactly 234,907,967,154,122,528 ways. Now a Harward mathematician Michael Simkin has come up with an almost-definitive answer for any number queens on a corresponding chessboard. Warning: his result can lead to dizziness and fainting spells.
Your personal chess trainer. Your toughest opponent. Your strongest ally. FRITZ 20 is more than just a chess engine – it is a training revolution for ambitious players and professionals. Whether you are taking your first steps into the world of serious chess training, or already playing at tournament level, FRITZ 20 will help you train more efficiently, intelligently and individually than ever before.
Winning starts with what you know The new version 18 offers completely new possibilities for chess training and analysis: playing style analysis, search for strategic themes, access to 6 billion Lichess games, player preparation by matching Lichess games, download Chess.com games with built-in API, built-in cloud engine and much more.
Unleash your chess potential with this dynamic course focused on mastering the initiative.
€39.90
It is known as the eight queens puzzle and was first brought up in a German chess magazine in 1848 – by one Max Friedrich William Bezzel. The problem entails placing eight queens on a chessboard so that no two queens threaten each other. The problem is fairly easy to solve – even a rank beginner should be able to construct a position that fulfils the requirement.
But how many solutions are there to the problem? Below are twelve fundamentally distinct solutions (source: Wiki). Most of the positions have eight variants which you can get by rotating them 90, 180, or 270° and reflecting each them. However, one of the fundamental solutions, the last one shown below, is identical to its own 180° rotation, and has only four variants.
So it turns out that the total number of distinct solutions is 92, as was soon conclusively established. But then the question arose: in how many different ways could queens be placed on larger boards? How many ways are there to place n queens on an n x n board so that no queen attacks another queen?
It turns out that there is no known formula to work this out. For a 9x9 board there are 352 distinctive ways, on a 10 x10 board it is724. The largest board for which an exact solution has been worked out is the 27×27 board. There are exactly 234,907,967,154,122,528 different way to place the 27 queens so none attacks any other. Working it out was a very laborous task.
How about larger numbers, e.g. 1000 queens on a 1000 x 1000 board? Or a million queens on a million square board? It was a problem that fascinated mathematicians. In 2021 Michael Simkin found a way to calculate the result for very large numbers of n. He has worked on the problem for almost five years, applying breakthroughs from the field of combinatorics, which focuses on counting and problems of selection and arrangements. He calculated that there are about (0.143n)nways the queens can be placed on giant n-by-n chessboards. This final equation doesn’t provide the exact number, but it is as close to the actual result as anyone can get right now. You can read about it in greater detail in this Harward Gazette story. There we learn what the formula implies:
On the extremely large chessboard with one million queens, for example, 0.143 would be multiplied by one million, coming out to about 143,000. That figure would then be raised to the power of one million, meaning it’s multiplied by itself one million times. The final answer is a figure with five million digits.
A bit of advice to our readers: do not try to list all these positions. It would take too long.
Frederic FriedelEditor-in-Chief emeritus of the ChessBase News page. Studied Philosophy and Linguistics at the University of Hamburg and Oxford, graduating with a thesis on speech act theory and moral language. He started a university career but switched to science journalism, producing documentaries for German TV. In 1986 he co-founded ChessBase.
Rossolimo-Moscow Powerbase 2025 is a database and contains a total of 10950 games from Mega 2025 and the Correspondence Database 2024, of which 612 are annotated.
The greater part of the material on which the Rossolimo/Moscow Powerbook 2025 is based comes from the engine room of playchess.com: 263.000 games. This imposing amount is supplemented by some 50 000 games from Mega and from Correspondence Chess.
Focus on the Sicilian: Opening videos on the Najdorf Variation with 6.h3 e5 7.Nb3 (Luis Engel) and the Taimanov Variation with 7.Qf3 (Nico Zwirs). ‘Lucky bag’ with 38 analyses by Anish Giri, Surya Ganguly, Abhijeet Gupta, Yannick Pelletier and many more.
Throughout the video course, Sasikran shows various examples from his career to explain sacrifices for initiative, an attack, a better pawn structure and much more.
In this insightful video course, Grandmaster David Navara shares practical advice on when to calculate deeply in a position — and just as importantly, when not to.
The Trompowsky is especially suited for faster time controls as you don‘t have to memorise endless lines of theory, and you push your opponent out of their comfort zone after your second move.
€49.90
We use cookies and comparable technologies to provide certain functions, to improve the user experience and to offer interest-oriented content. Depending on their intended use, analysis cookies and marketing cookies may be used in addition to technically required cookies. Here you can make detailed settings or revoke your consent (if necessary partially) with effect for the future. Further information can be found in our data protection declaration.
Pop-up for detailed settings
We use cookies and comparable technologies to provide certain functions, to improve the user experience and to offer interest-oriented content. Depending on their intended use, cookies may be used in addition to technically required cookies, analysis cookies and marketing cookies. You can decide which cookies to use by selecting the appropriate options below. Please note that your selection may affect the functionality of the service. Further information can be found in our privacy policy.
Technically required cookies
Technically required cookies: so that you can navigate and use the basic functions and store preferences.
Analysis Cookies
To help us determine how visitors interact with our website to improve the user experience.
Marketing-Cookies
To help us offer and evaluate relevant content and interesting and appropriate advertisement.