{ "id": "chess", "title": "Chess", "lang": "en", "source_lang": "en", "summary": "Chess is a two-player strategy board game on an 8×8 board. It grew out of South Asian games, and its modern competitive system is built around FIDE, the Elo rating system and the World Championship.", "category": "society", "subcategory": "culture", "type": "concept", "aliases": [ "Western chess", "international chess" ], "generated_at": "2026-10-15", "model": "pro/claude-haiku-5-5", "url": "https://aiwiki.page/en/chess/", "translations": { "zh-Hans": { "url": "https://aiwiki.page/zh/chess/", "json": "https://aiwiki.page/zh/chess.json" } }, "sections": [ { "heading": "", "text": "Chess is a two-player board game of perfect information and no chance, played on an 8×8 board with sixteen pieces per side. Each player tries to checkmate the opponent's king, and the game is a classic example in game theory. Its simple rules produce an enormous range of positions, which has made it one of the most played and most studied games in the world, and a long-running testbed for artificial intelligence.\n\nThe game descends from the South Asian game chaturanga and passed through Persia and the Islamic world into medieval Europe, where it took on much of its present form in the late fifteenth century. Its history links India, Persia, medieval Europe and the Renaissance with the later rise of international tournaments, a formal world championship and a standardized rating system.\n\nThe entry covers the rules and notation, the origins and rule changes of the game, principles of strategy, the governance of competitive chess, the history of the World Championship and of women's chess, team competition, cultural depictions, computer chess, mathematical analysis, variants, research on cognition, online play and open questions. Because the 2026 World Championship match is scheduled for late 2026, the entry should be updated once it is played." }, { "heading": "Rules and basic structure", "text": "Chess is played by two players who alternate moves, with the White side moving first. The game takes place on a board of 64 squares arranged in an 8 × 8 grid, with light and dark squares alternating. Each player begins with sixteen pieces of six types: one king, one queen, two rooks, two bishops, two knights and eight pawns. The rooks move along ranks and files, the bishops along diagonals, and the knights in an L-shaped jump that can pass over other pieces. The queen combines rook and bishop movement, the king moves one square in any direction, and pawns advance straight forward but capture diagonally.\n\nThe aim of the game is checkmate: the king is under attack, or in check, and no legal move removes the threat. A game can also end by resignation, by a draw agreed between the players, or by stalemate. In stalemate the side to move is not in check but has no legal move, and the result is a draw. Other draws are determined by the FIDE Laws of Chess. Threefold repetition of a position and the fifty-move rule, which applies after fifty moves by each side without a pawn move or a capture, must be claimed by a player. Fivefold repetition and the seventy-five-move rule apply automatically. A game is also drawn when neither side can possibly checkmate, for example king against king, or king and a single minor piece against king.\n\nSeveral special rules modify these basic movements. In castling, the king moves two squares toward a rook, which then jumps over it to the adjacent square. This is allowed only if neither piece has moved before, the squares between them are empty, and the king is not in check, does not pass through an attacked square, and does not land on one. En passant allows a pawn that has just advanced two squares to be captured by an enemy pawn that could have taken it had it moved only one square, and this capture is possible only on the move immediately after. When a pawn reaches the far rank it is promoted to a queen, rook, bishop or knight of the same colour, and the player may choose a piece that has already been captured. The principle that a player may never leave their own king in check underlies all of these rules. It means that a piece pinned to the king cannot move off its line, and that the king cannot step onto a square the opponent attacks.\n\nFrom the standpoint of formal analysis, chess is a two-player, zero-sum game. One player's gain is the other's loss, and a typical scoring convention assigns 1 to a win, 0 to a loss and ½ to a draw. It is also deterministic, since no dice or shuffled cards are involved, and it has perfect information, because both players see the full state of the game at every move. These features make chess a standard example in game theory and in the analysis of zero-sum games. They also explain why the game's outcome is in principle fixed under optimal play, even though that value is not known." }, { "heading": "Notation, time controls and competition formats", "text": "Standard algebraic notation gives each of the 64 squares a two-symbol label that combines a file letter with a rank number, so every move can be written as a short text string. The notation assigns a unique two-character identifier to each of the 64 squares on a chessboard. Piece letters are English initials, so a knight move is written with an N, and the same scheme underlies most chess software.\n\nComplete games are stored in Portable Game Notation (PGN), a format devised in 1993 by Steven J. Edwards and first popularized via the Usenet newsgroup rec.games.chess. A PGN file opens with a block of tag pairs that record the players, event, date, and result, and then gives the moves in algebraic notation. Because the file is plain text, a human can read it in any editor, while programs can parse and generate it easily. Databases of millions of games are commonly distributed in this format.\n\nTime controls are usually written as a starting time plus an increment, such as 15+10. Increment is not the same as delay: delay postpones time deduction for a specified period, while increment adds time according to the clock rules. Under the FIDE Laws, the category of a control depends on the starting time plus sixty increments: 15+10 corresponds to twenty-five minutes for classification, and 3+2 corresponds to five. Blitz therefore covers under 10 minutes, 10 up to 60 is rapid, and 60 and above is classical. In practice, the controls differ in character. Without an increment, a fast game can end on time rather than by checkmate, whereas a small increment lets a won endgame be converted. Major events use longer schedules: the 37th Chess Olympiad allowed each player 90 minutes for all their moves, with an additional 30 seconds increment for each player after each move, beginning with the first. The World Rapid Championship uses 15 minutes per player with a 10 second increment.\n\nCompetitions use several formats. In a round-robin, every participant meets every other, and tiebreaks are needed when scores are level. Neustadtl remains the most common tie-breaking method in round-robin tournaments, though in Swiss system events, comparison of the Buchholz scores and the sum of progressive scores is more common. The Neustadtl (Sonneborn–Berger) score adds the conventional scores of the players a competitor has defeated to half the sum of the scores of those they drew against.\n\nSwiss-system events run a fixed number of rounds with players paired by their scores, and they rely heavily on tiebreaks. The Buchholz tiebreak is based on the combined scores of a player's opponents. A variant, Buchholz Cut 1, adds together the tournament scores of each opponent a player has faced, except the one with the lowest score. Tiebreak chains are applied in order, so if the players are still tied after one tie-break system is used, another system is used, and so on, until the tie is broken. The 2024 World Blitz Championship showed how decisive this can be, since a forfeit was treated differently from a played loss under the first criterion and changed the qualifiers for the knockout stage.\n\nKnockout formats decide a match by a fixed sequence of games. In the Chess World Cup 2025, each round consists of classical time limit games on the first two days, plus tie-breaks on the third day if they are required. If the score remains level, faster games follow, descending from rapid to blitz, and a single sudden-death armageddon game is used if the match is still tied.\n\nChess960, also called Fischer random, is a variant in which the back-rank pieces are shuffled before the game, creating 960 possible starting positions. It is played in official events alongside the standard game, and it reduces the role of memorized opening theory." }, { "heading": "Origins in India and Persia", "text": "Chess descends from chaturanga, a board game that took shape in northern India. Scholars usually date its earliest secure appearance to the Gupta period, around the sixth century CE. The earliest clear reference comes from north India from the Gupta Empire, dating from the sixth century AD. The name is a Sanskrit compound. It derives from the words for \"four\" and \"arm,\" referring to the game of the same name. The four branches it evokes were the foot soldiers, horsemen, elephants and war chariots of the classical Indian army, and these became the pawn, knight, bishop and rook of later chess.\n\nThe first literary mention is a court text by the poet Banabhatta, composed around 625. It presents the game as a familiar pastime, so familiar that people learned about warfare only through playing chaturanga on the ashtāpada board. The board itself was apparently an unmarked eight-by-eight grid. It is believed that chaturanga was played on an uncheckered 8 by 8 board called a ashtāpada, borrowed from another board game.\n\nThe game then moved into Sasanian Persia, where it was known by a Persian form of the Sanskrit name. The name of the game in adjoining countries appears to be derived from chaturanga – chatrang in Persian, shatranj in Arabic. Under Persian patronage its rules changed, and the form called shatranj became the standard version. A Persian text probably compiled in the seventh or eighth century, the Chatrang Namak, frames the game as a gift and challenge sent from an Indian ruler to a Persian shah. The Persian phrase shāh māt, meaning roughly \"the king is helpless,\" later gave rise to the term for checkmate.\n\nThe Islamic conquests carried shatranj far beyond Persia. It also appeared in Persia after the Islamic conquest (638-651). From Persia, the game passed to the Arabs following the Islamic conquest, becoming shatranj. Within the Arabic-speaking world, shatranj spread across the Middle East and North Africa, and it became the subject of written study. Arab players refined the rules and produced the first chess literature, including game collections and strategic treatises. This literature, along with Persian works, preserved the rules and problems that later reached Europe.\n\nThe early history is poorly documented, and several questions remain open. Few Sanskrit sources describe the game in detail, so knowledge of the game comes secondhand, mainly from Muslim sources. Archaeological evidence is similarly thin. Game pieces resembling chess pieces were excavated at Lothal, a port city of the Indus Valley Civilization in Gujarat, dating to approximately 2450 BC. Whether these pieces belonged to chaturanga or a predecessor game remains debated. The exact rules of chaturanga are also uncertain. Historians suppose that the game had similar rules to those of its successor shatranj, but there is uncertainty about the moves of the gaja, the forerunner of the modern bishop. Finally, the relationship between chaturanga and related games is disputed. Chaturanga is often described as a common ancestor of chess, Japanese shogi and Chinese xiangqi, but the precise lines of descent are not settled." }, { "heading": "Transmission to Europe and the medieval rules", "text": "Chess reached Christian Europe mainly through the Iberian Peninsula and Sicily in the tenth and eleventh centuries, when the game was already being played in the Islamic world as shatranj. It was taken up by Christian courts and monasteries, and the pieces circulated with their Arabic-derived names and slow movement. Spain is a particularly well-documented case: the game was received from the Arabs during the period of the Muslim presence in the peninsula, and Iberian courts became centres of chess literature in the following centuries.\n\nThe most important medieval Iberian text is the Libro de los juegos, completed in 1283 in the scriptorium at Toledo for Alfonso X of Castile. It covers chess, dice and tables games, and it contains more than one hundred chess problems, many of them of endgame type, together with variants such as a four-player \"chess of the four seasons\". Its opening pages set out the philosophy of the game, the movement of each piece and their relative values. The book also uses chess as a didactic image: in its prologue scene, a philosopher compares the reasoning mind to a chess game in a debate about fate and free will. This is the sense in which medieval texts treated chess as a model of order and governance, rather than as a pastime alone.\n\nUnder shatranj, the queen (called fers or alferza) moved only one square diagonally, and the bishop advanced by short leaps, so games were slow and often long. In Iberia and Italy, players began experimenting with more mobile versions of these pieces during the fourteenth and fifteenth centuries. The decisive change was that the queen became the strongest piece on the board and the bishop gained unlimited diagonal range. Castling, which allows the king and a rook to move together once, was adopted gradually; the change of queen and bishop and the spread of castling are usually dated to the period between about 1475 and 1525.\n\nThe earliest documentary witness to the new queen is a Valencian poem, Scachs d'amor (\"Chess of Love\"), written in 1475 or 1476 by Francesc de Castellví, Narcís Vinyoles and Bernat Fenollar. It is an allegory in which a game between Mars and Venus is played out, and it is considered the earliest recorded game with the modern queen and bishop moves. However, neither player in the poem castles or captures en passant, so it does not show the complete modern rule set. The manuscript was found in Barcelona in 1905 and later lost, and it is known mainly from photographs. Its authors are also sometimes linked to the coronation of Isabella I of Castile, though this interpretation is a matter of scholarly debate.\n\nTreatises followed the poem and fixed the new rules in print. Francesc Vicent's book of 1495 on the new game is often treated as the founding text of modern chess, and the later treatises of Lucena and Damiano spread the new rules through Europe. The printing press allowed these innovations to circulate quickly, and the new rules became the norm within a few decades, displacing older practice in most European centres.\n\nNotes on the sources: some popular accounts describe the 1475 poem as a \"treatise\", but it is a poem, and the printed treatises date from the 1490s onwards. Accounts of the exact date and motive for the change differ, and the link to Isabella is contested." }, { "heading": "Strategy: opening, middlegame and endgame", "text": "Opening play is guided by principles rather than fixed rules. Players aim to develop minor pieces quickly toward the centre, contest central squares with pawns and pieces, and castle early to place the king behind a protective pawn shelter. Moving the same piece repeatedly or bringing the queen out too early is generally discouraged, because it gives the opponent time to develop. Opening knowledge itself is catalogued by the five main categories, \"A\" to \"E\", which are divided into one hundred subcategories each, in total 500 from A00 to E99. The first edition of this reference appeared in five volumes from 1974 to 1979, and its coding system has since been adopted far beyond print.\n\nOnce the pieces are developed, the middlegame becomes a mixture of concrete tactics and long-term planning. Tactical motifs decide many games. A fork attacks two targets at once, a pin prevents a piece from moving without exposing a more valuable piece behind it, a skewer reverses that geometry by forcing the valuable piece to move first, and a discovered attack arises when moving one piece unmasks an attack by another. Positional play works on slower questions. Pawn structure is hard to change and shapes the plans of both sides for many moves. An outpost is a square on the opponent's side that cannot be challenged by enemy pawns, and it is especially valuable for knights. Piece activity measures how many useful squares a piece controls, and a player with more active pieces often has the initiative even without material gain. Much of this assessment is a heuristic judgement rather than a calculated result.\n\nWith few pieces left, the king becomes an active fighting piece, and the central question is often whether a pawn can promote. Basic technique includes king activity and opposition, in which the king that does not have to move gains a tempo-based advantage in a direct confrontation. Two canonical rook-and-pawn positions are used to teach this phase. The defensive technique was analyzed by François-André Danican Philidor in 1777. In its standard form the defender keeps a rook on the third rank, which cuts off the attacking king. The winning counterpart is the Lucena position. If the side with the pawn can reach this type of position, they can forcibly win the game. Its key idea is the \"bridge\": in many Lucena positions, the rook belongs on the fourth rank because it can later interpose between the checking rook and the king. Most practical rook-and-pawn endings are, in effect, contests over which of these two setups will arise.\n\nThe strategic thinking of the modern game was shaped by several schools. Wilhelm Steinitz, the first official World Champion, systematized positional play in the late nineteenth century, arguing that small advantages in space, pawn structure and king safety could accumulate into a decisive edge. The Romantic style, associated with mid-nineteenth-century players such as Adolf Anderssen and Paul Morphy, prized brilliant sacrifices and rapid attacks, often at the cost of soundness. The hypermodern school of Aron Nimzowitsch and Richard Réti in the 1920s challenged the idea that the centre must be occupied by pawns at once; instead, it could be controlled from a distance by pieces and challenged later. These approaches are not mutually exclusive, and most strong players combine elements of each depending on the position." }, { "heading": "FIDE, titles and the Elo rating system", "text": "The World Chess Federation (FIDE) is the sport's international governing body. It sets the laws of the game, sanctions world championships and awards titles. Its rating lists also seed players into the championship cycle, including the Candidates Tournament and the World Cup.\n\nFIDE's titles form a ladder. The Candidate Master (CM) and FIDE Master (FM) titles depend on rating alone, at a FIDE rating of 2200 or higher and a FIDE rating of 2300 or higher respectively. The International Master (IM) and Grandmaster (GM) titles also require norms, which are performances in qualifying events. An IM must reach a rating of 2400 and earn three IM norms in tournaments covering at least 27 games. A GM must reach 2500 and earn three GM norms. A GM norm is a performance rating of at least 2600 over 9 or more rounds, and the field must have an average rating of at least 2380, must include at least three grandmasters, and must include players from a mix of national federations. The rating threshold can be met at any point in a player's career, so a player need not hold it when the norms are completed.\n\nThe Elo system was devised by Arpad Elo, a physics professor and chess master. The USCF first instituted a rating system for over-the-board play in 1950, using a calculation formula devised by Kenneth Harkness. In 1960, the USCF adopted a more reliable rating system invented by Arpad Elo. FIDE adopted it in 1970, and the Elo ratings were introduced by the World Chess Federation as the official system to rank players on 1 July 1971. Bobby Fischer was the first world number one, in July 1971. Until the mid-1980s Elo himself performed the rating calculations, but FIDE reassigned the task of managing and computing the ratings to others, excluding Elo.\n\nThe expected score in the Elo model follows a logistic curve, not a normal distribution. The expected score for player A against player B is \\[E_A = \\frac{1}{1 + 10^{-(R_A - R_B)/400}}\\] The scaling factor of 400 means that a 400-point difference represents roughly 10:1 odds of victory for the stronger player, while a 200-point difference corresponds to approximately 3:1 odds. FIDE's published table is effectively a discretized version of this curve. On this basis, a player rated 100 points above an opponent has an expected score of about 0.64, or 64%. After each game, ratings change by \\[\\Delta R = K\\,(S - E)\\] where S is the actual score and E the expected score. The K-factor is a development coefficient. Under the regulations in force from 2017 to 2021, K = 40 applied to a player new to the rating list until he had completed events with at least 30 games, and K = 20 applied as long as a player's rating remained under 2400. Players who reached 2400 move to a lower coefficient, which keeps established top-level ratings more stable.\n\nRatings from different organizations are not directly comparable. Elo ratings are only meaningful within a closed pool of players, so a national rating does not translate exactly into a FIDE rating. Rating floors also differ: ratings for over-the-board play range from 100 to nearly 3000 in the United States, and USCF Elo ratings usually run about 100 points higher than FIDE Elo ratings for chess players rated in both systems. For this reason, a player's national title and FIDE title can differ in meaning even when the numbers look similar." }, { "heading": "World Championship history from Steinitz to Fischer", "text": "The title of World Champion grew out of nineteenth-century match play. Wilhelm Steinitz won his 1886 match against Johannes Zukertort in New York and is generally recognized as the first official holder of the title. He lost it in 1894 to the German-born Emanuel Lasker, whose reign of about 27 years remains the longest in the title's history. Lasker lost to the Cuban José Raúl Capablanca in Havana in 1921. Alexander Alekhine then defeated Capablanca in 1927, lost the title to Max Euwe in 1935, and regained it in 1937. Alekhine died in 1946 while still holding the title, which left the championship without a reigning champion.\n\nThe Fédération Internationale des Échecs (FIDE) then took over the organization of the title. In 1948 it staged a tournament, played in The Hague and Moscow, that Mikhail Botvinnik won, and it established a cycle of qualifying events, candidates tournaments and title matches to select challengers. Under this system, players from the Soviet Union held the title almost without interruption for the next quarter-century. Botvinnik lost and regained it, Vasily Smyslov and Mikhail Tal took it in turn, and Tigran Petrosian and Boris Spassky followed. The Soviet state's support for training and competition made the cycle difficult for players from other countries to break.\n\nThe break came from the United States. Bobby Fischer won the 1972 candidates cycle with lopsided results against Mark Taimanov, Bent Larsen and Petrosian, then met Spassky in Reykjavik, Iceland, in a match that ran from July to September 1972. Fischer won 12½–8½. Because the match was played between a Soviet champion and an American challenger, it attracted worldwide media attention and was widely presented as a contest between the two superpowers during the Cold War. Fischer did not defend the title. When he refused to play Anatoly Karpov under the terms FIDE had set, FIDE declared Karpov champion by forfeit in 1975.\n\nThe championship then split. Garry Kasparov, who had won the title from Karpov in a 1985 match, and Nigel Short left FIDE in 1993 after disputes over the organization and sponsorship of the title. They played their 1993 match in London under the Professional Chess Association, a body they had set up outside FIDE's control. FIDE stripped them of the title and held a separate championship, which Karpov won in Manila. For the next thirteen years two rival champions existed, with the PCA title passing from Kasparov to Vladimir Kramnik in 2000. The titles were reunified in 2006, when Kramnik defeated Veselin Topalov in a unification match held in Elista, Russia." }, { "heading": "Modern champions and the 2026 match", "text": "Anatoly Karpov and Garry Kasparov dominated the 1980s through a series of title matches, and Kasparov kept the title until 2000. The modern cycle that followed was shaped by Magnus Carlsen, a reign that ended in 2023, and by the rapid rise of a new generation of players from India, Uzbekistan and China.\n\nFrom Carlsen to Gukesh\n\nMagnus Carlsen held the title from 2013 to 2023. Ding Liren won the 2023 match, which made him the Chinese champion. In the 2024 championship match, D. Gukesh of India beat Ding by 7½–6½ and became the defending champion for 2026. Ramachess\n\nGukesh's results have been uneven since then. Wikipedia notes that his form has been poor in both classical and faster time controls. His classical rating peaked at 2794 in October 2024, and he lost 43 points during 2025, after finishing 41st at the 2025 FIDE Grand Swiss and leaving the 2025 World Cup in the third round as the top seed. As of October 2026, his FIDE classical rating is 2710, which places him 28th in the world, and his rapid and blitz ratings are 2686 and 2659. Ramachess A more positive picture appeared in May 2026 at the Super Rapid and Blitz event in Warsaw, where he beat Fabiano Caruana in the final rapid round, though he finished sixth overall. NewsX Outlook India\n\nThe 2026 Candidates Tournament\n\nThe Candidates Tournament was held at the Cap Saint Georges Hotel in Pegeia, Cyprus, from 28 March to 16 April 2026. It was a double round-robin of eight players, the format used for every Candidates event since 2013. Wikipedia Javokhir Sindarov of Uzbekistan won with 10 points from 14 games, with six wins, no losses and eight draws. He clinched first place with a round to spare, and Anish Giri took second with 8.5 points. ChessWorld\n\nSindarov, born in Tashkent in December 2005, had qualified by winning the 2025 FIDE World Cup in Goa, where he became the youngest winner of that event. Wikipedia His FIDE classical rating stood at 2782 in October 2026, which made him the fourth-ranked player in the world. In their three classical games, Sindarov has two wins and one draw against Gukesh. Ramachess\n\nFormat and schedule\n\nThe match is scheduled to take place at the Fondation Martin Bodmer in Cologny, near Geneva. It would be the first world title match held in Switzerland since 2004. Sunday Guardian Game 1 is set for 24 November 2026, and the match is planned for up to 14 classical games. A player who reaches 7.5 points wins outright, and tiebreak games are scheduled for 12 December if the score remains level. 365Chess\n\nSources differ on the opening dates. Some list 24 November to 12 December as the match period, while others give 22 November to 12 December, which includes the opening ceremony and media day. Sunday Guardian The schedule is therefore best checked against the latest FIDE announcement." }, { "heading": "Women's chess", "text": "Women's chess has its own championship structure, separate titles, qualification cycles and rating lists. The first Women's World Chess Championship was held in 1927, and the event has since been contested in several formats. The current cycle is led by the Women's World Chess Championship between the defending champion and a challenger chosen in a candidates tournament. In the 2025 match, Ju Wenjun defended her title by defeating Tan Zhongyi 6½–2½, winning the world championship for the fifth time.\n\nThe 2026 challenger is Vaishali Rameshbabu of India. She was the lowest-rated player in the field, yet she won the Women's Candidates Tournament 2026 and earned the right to play Ju Wenjun. She finished outright on 8.5 out of 14. Sources disagree on timing. The Wikipedia entry on the match says the dates and host city are yet to be decided. Her profile places the match in 2027, while press coverage refers to a contest later this year. The schedule should be checked against the latest FIDE announcement.\n\nIndividual achievement and the Polgár sisters\n\nJudit Polgár is the most cited reference point in discussions of women at the highest level. She is widely considered the greatest female chess player ever, as she is the only woman to have been ranked in the top 10 worldwide. Her early development is linked to an experiment by her father, the educational psychologist László Polgár. He set out to show that children could reach exceptional achievement if trained in a specialist subject from a very early age, and his stated thesis was that geniuses are made rather than born. He and his wife Klára educated their three daughters at home, with chess as the specialist subject. Judit became a grandmaster at 15 in 1991. Her older sister Susan became Women's World Chess Champion.\n\nThe experiment is itself contested. Some accounts treat it as evidence for nurture over nature, while Susan Polgár has argued that Judit's success came from hard work rather than unusual natural gifts. The experiment is usually cited as support for nurture over nature and as proof that women can become grandmasters. Judit's own career also shows the pressures of being a woman in a male-dominated field. She largely preferred men's events and made clear early on that she aimed to become the true World Champion. Her 1994 game against Garry Kasparov, which was marked by a touch-move dispute, is often discussed in the same context.\n\nCompeting explanations of the rating gap\n\nStatistical comparisons show that men are consistently over-represented at the top of rating lists. Explanations for this fall into several groups.\n\nThe first is participation. A large study of over 200,000 US players attributed the disparity in participation to a greater number of boys entering at the lowest performance level. Analyses of German rating data have produced different estimates of how much of the top-level gap participation explains. Bilalić and colleagues' original figure was about 96%, while Knapp's alternative hypergeometric model suggested participation explains around 66% of the difference.\n\nThe second concerns entry and attrition. A 2026 study of two decades of US data found that the key explanation for male-female differences in the population is ratings gaps at entry, which are large when first observed and persist over time. The same study found that although female players have higher attrition rates than males, the net effect of this differential attrition on ratings gaps is null (to slightly equalizing). A separate 2025 analysis reported that once boys and girls were matched on starting age, cohort year and rating, their rating trajectories were remarkably similar.\n\nA third explanation concerns the local environment. Higher female participation is associated with narrower male-female ratings gaps, particularly at lower levels of performance.\n\nA fourth explanation is psychological. Research on stereotype threat found that in an online study, the sexes performed equally when identities were anonymous, but when the sex of the opponents was known, female players performed worse against male players. A later analysis of a much larger dataset also found that female players tend to perform worse against male opponents than against female opponents, even after accounting for chess strength.\n\nThese accounts are not mutually exclusive, and each has been contested. Participation, entry-level differences, local context and stereotype effects may interact, and the relative weight of an innate-ability explanation remains disputed." }, { "heading": "Team competition and national traditions", "text": "The Chess Olympiad is the central team event, run by FIDE and held every two years. The 46th edition took place in Samarkand, Uzbekistan, in September 2026, and it was the first Olympiad held in Central Asia. Its Open and Women's sections use a Swiss system in which teams of five players contest each match over four boards across eleven rounds. The 2026 field was a record of about 400 teams. The host Uzbekistan took the Open title by beating Ukraine in the final round, India finished second, and China won the Women's section. The first official Olympiad had been held in London in 1927.\n\nThe Soviet Union built the most influential state-backed chess system. Chess was first used during the Civil War as a training tool for military recruits and was later promoted as a way to train Communist Party activists. By 1920 the state had linked the game to physical and cultural education, and a 1924 resolution placed chess circles in workers' clubs, factories, military units and schools. Opening circles to schoolchildren widened the pool of young talent. The state then created a title ladder: \"Master of the USSR\" in 1925, the Soviet grandmaster title in 1927, and Boris Verlinsky as the first Soviet grandmaster in 1929. A 1934 figure often cited gives 500,000 amateur players registered with the state programme.\n\nThe Soviet school's international reputation became visible after World War II, when Mikhail Botvinnik's generation began winning across international events. Its style was often described as fast-paced and daring, but its more durable contribution was methodical: coaches treated the opening, middlegame and endgame as connected phases and studied them systematically. Soviet or Soviet-trained players held the world title from 1948 until 2008, with the interruption of Bobby Fischer's reign from 1972 to 1975. The dissolution of the Soviet Union in 1991 ended the state sponsorship that had sustained the system.\n\nOther national traditions have produced major players and coaching methods of their own. Cuba is associated with José Raúl Capablanca, world champion from 1921 to 1927. Hungary has produced strong teams and players, including the Polgár sisters. Yugoslavia developed a generation of grandmasters in the postwar decades. Armenia has been a consistent force, and Levon Aronian was among the leading players in the Tata Steel Masters in 2017. China has become a dominant force in women's chess, as its 2026 Olympiad win shows, and India has produced a large number of elite players and coaches, several of whom finished at the top of major international events in the 2020s.\n\nClub leagues and national team competitions remain the foundation of chess life in most countries, supplying the amateur base from which professionals emerge. Invitational tournaments also shape the top of the sport. The Tata Steel Chess Tournament began in 1938 as an employee event for a Dutch steel company and is now held each January in Wijk aan Zee, where it is known as the \"Wimbledon of chess\". Magnus Carlsen, from Norway, holds the record for most titles there, with eight. Norway Chess, a tournament founded in Norway and held in late May, has seen Carlsen compete in every edition, winning seven of them." }, { "heading": "Chess in literature, film and art", "text": "Chess has long served as a literary and visual device, and its meaning has shifted with each era. In the late thirteenth century, the Dominican friar Jacobus de Cessolis (c. 1250 – c. 1322) preached a series of sermons that used the board as a model of society. These were later compiled as the Liber de moribus hominum et officiis nobilium super ludo scacchorum, usually called the Book of Chess. Each piece stood for a social role: the king for supreme authority, the rooks for public order, and the pawns for the trades and offices of a town. The book is less a manual than a work of moral instruction, and its popularity across clerics, nobles and townspeople made it one of the most widely copied texts of the late Middle Ages. It was first printed in Utrecht in 1473 and later appeared in English through William Caxton, which shows how far the moralizing tradition reached in medieval Europe.\n\nIn the modern novel, chess became a vehicle for psychological study rather than social allegory. Vladimir Nabokov's The Defense, first published in Russian in 1930, follows Aleksandr Ivanovich Luzhin from a withdrawn childhood to a career as a grandmaster, and traces how the game gradually displaces ordinary life until his mind breaks down during a major tournament. Nabokov reportedly drew on the 1925 Moscow tournament and on the Soviet film Chess Fever, and he modeled the character partly on the chess master Curt von Bardeleben. Stefan Zweig's novella Chess Story, written in 1941 and published in 1942 after the author's death, takes a different path. Set on a transatlantic liner bound for Buenos Aires, it pits the arrogant world champion Mirko Czentovic against Dr. B, a former prisoner of the Gestapo whose memory of isolation has turned chess into a source of trauma. Its interest lies less in the moves than in the link between wartime persecution, obsession and the fragility of the mind.\n\nCinema and television later spread chess to much wider audiences, often by building stories around competitive pressure and psychological strain. Films such as Searching for Bobby Fischer (1993) portrayed a young player's encounter with the professional game and its demands on family and identity. The Netflix miniseries The Queen's Gambit (2020), adapted from Walter Tevis's 1983 novel, followed a fictional orphan prodigy in the United States and drew large audiences to the game, with a noticeable rise in interest in chess instruction and online play. Such depictions tend to emphasize individual genius and emotional cost, and they have been criticized for simplifying the realities of professional life. Adaptations of Nabokov's novel also exist, such as the 2000 film The Luzhin Defence, directed by Marleen Gorris.\n\nThe visual arts have engaged with chess in more conceptual ways. Marcel Duchamp is the most prominent example. He played at a serious level, representing France at several Chess Olympiads in the 1920s and 1930s, and he gave up painting for a period in favor of the game. His chess-related output includes writings and works that treat the board as a formal system: the grid, the alternation of moves and the abstract rules became subjects in their own right. Duchamp's approach blurred the line between sport and art, and his example has been cited by later artists who see chess as a model of structure, chance and rule-making rather than only as a pastime.\n\nTaken together, these works show a recurring pattern. Chess is used as a symbol of order in medieval moral texts, as a mirror of obsession and madness in twentieth-century fiction, and as a formal structure in modern art. The same features that made the game attractive to moralists, novelists and artists, namely its fixed rules, its visible hierarchy and the outsized importance of individual decisions, also explain why it continues to appear in culture as an image of intelligence, control and its breakdown." }, { "heading": "Computers and chess: from Shannon to Deep Blue", "text": "Efforts to make machines play chess began before electronic computers could run such programs. Alan Turing wrote a chess procedure in 1948, known as Turochamp, that was worked out on paper rather than executed on a machine. Claude Shannon's paper \"Programming a Computer for Playing Chess\" was presented in 1949 and published in 1950. Shannon described a machine that assigns each position a score with an evaluation function and looks ahead through the game tree, choosing moves by minimax, which assumes the opponent will reply as damagingly as possible. He distinguished two strategies. Type A examines every continuation to a fixed depth, while Type B is selective, discarding weak lines and continuing calculation in unstable positions before applying the evaluation. Exhaustive search was beyond the hardware of the time, so selective search became the model for later programs, and modern engines generally combine elements of both approaches.\n\nDuring the 1950s and 1960s, researchers tested these ideas on the machines available to them. Los Alamos scientists experimented with a simplified board, which made the search manageable. At MIT, Richard Greenblatt's MacHack VI, written for a PDP-6 from late 1966, used alpha-beta pruning, which skips branches that cannot affect the final choice, along with about fifty heuristics to search deeper. It is usually credited as the first program to play in human tournaments and the first to receive a rating: its early 1967 result corresponded to a USCF rating of 1243, and by April 1967 its performance had risen to about 1640. In spring 1967 it defeated a human opponent in a tournament, a first for a program. Its speed was modest, roughly ten positions per second. Meanwhile, a program from the Soviet ITEP group won a nine-month telegraph correspondence match against the Kotok-McCarthy program developed in the United States, which had been developed with John McCarthy and others.\n\nThe machine that most famously changed the field was Deep Blue, built by IBM as the successor to earlier purpose-built machines, Chiptest and Deep Thought. Its strength came from large-scale computation combined with custom chess chips that recognized and valued features such as lines of attack, allowing it to evaluate up to 200 million positions per second. Sources differ on its configuration: one account describes 256 processors working in tandem, while IBM's own history describes 32 processors performing coordinated parallel computations.\n\nDeep Blue first attracted attention in February 1996, when it won the opening game of a match against Garry Kasparov in Philadelphia; Kasparov won the match 4–2. The rematch took place in May 1997 at the Equitable Center in New York. After Kasparov won the first game and Deep Blue the second, three games were drawn, and Deep Blue won the sixth game, which lasted 19 moves, to take the match 3.5–2.5. It was the first time a reigning world champion lost a match to a computer under standard tournament time controls. Kasparov then accused the IBM team of human assistance and requested a rematch; IBM declined and retired the machine. One account attributes Kasparov's defeat partly to a more cautious style he adopted in 1997, although the causes of the result remain a matter of interpretation.\n\nThe match became a landmark in artificial intelligence, but its meaning was contested from the start. Some commentators regarded it as a promotional event for IBM rather than a rigorous test of machine intelligence, and some chess fans criticized the quality of play in the games. The result sharpened the question of whether computers would displace human players, and what mastery of chess meant once machine calculation surpassed human calculation. One reading treated the match as evidence that brute-force search could outperform human intuition in a bounded domain; another held that chess skill had never been purely a matter of calculation. These questions shaped the next phase of computer chess, in which learning-based engines replaced hand-crafted evaluation." }, { "heading": "Modern engines and their effect on human play", "text": "Computer programs now play far above the level of the strongest human players, and this gap has shaped how the game is studied and played. The decisive public demonstration came in 2017. DeepMind's AlphaZero, which was trained solely via self-play, faced Stockfish 8 in a 100-game match and recorded 28 wins and 72 draws with no losses. The match used a fixed time control of one minute per move. Critics noted that the setup favored AlphaZero: Stockfish ran on 64 CPU threads and 1 GB of hash memory, while AlphaZero ran on only four TPUs and a 44-core CPU.\n\nA larger match reported in 2018 gave a clearer picture. Over 1,000 games, AlphaZero scored 155 wins, 6 losses and 839 draws, and the games were played under normal tournament time controls. AlphaZero itself was never released to the public, and Stockfish has since incorporated a neural-network evaluation of its own.\n\nThe two leading engines today follow different designs. Stockfish is open-source and is built on a traditional alpha-beta search, with an NNUE neural-network evaluation added to a very fast conventional search. Leela Chess Zero, by contrast, is a pure neural network: it was only given the rules of the game and became strong through reinforcement learning from repeated self-play. In the Top Chess Engine Championship, Stockfish has held the most recent superfinal titles while Leela has repeatedly finished within a handful of games of it. Published rating estimates differ by list and version. One 2026 source puts Stockfish at an estimated Elo of around 3653 in tournament time controls, while another cites 3759 Elo for Stockfish 18. Engine ratings are derived from results against other engines and, in some cases, against humans, so they are not on the same footing as FIDE ratings and are not directly comparable with them.\n\nIn practice, engines have changed preparation and analysis more than any other part of the game. Top players use engines to test out new ideas, find improvements in well-known lines, and discover new theoretical novelties, and as a result opening theory has become incredibly deep and complex, with some lines being analyzed 20 or 30 moves deep. Engines are also used to study an opponent's previous games and prepare specific lines for a match. After a game, players commonly review their moves with an engine, and for most amateur review an engine such as Stockfish serves as the standard reference, while Leela is often consulted as a second opinion in closed or strategic positions.\n\nThe effect on human play is debated. One view holds that the dominance of engines has made the game more formulaic, with fewer creative ideas and more reliance on deep preparation. Another argues that engines have widened the range of playable ideas, so that creativity now begins with verification rather than guesswork. Related concerns include the risk that players lose their individuality and turn chess into a memorization exercise, and the claim that engines have leveled the playing field, making it harder for the strongest players to dominate consistently. How engine strength should be compared with human rating, and whether engine-assisted play changes the meaning of human mastery, remain open questions." }, { "heading": "Mathematical and computational analysis", "text": "Counting chess is difficult, and the figures usually quoted measure different things: possible games, legal positions, and the cost of computing the best move. Keeping these apart avoids confusion.\n\nGame-tree size\n\nThe best-known figure comes from Claude Shannon's 1950 work. Drawing on master games compiled by Adriaan de Groot, he assumed roughly 10^3 options for each pair of White and Black moves and an average game of about 80 half-moves, which gives a game-tree size of about 10^120 (he estimated ≈ 10^3 options per (white, black) move pair, and that an average game is ≈ 80 plies (half-moves). Thus, he surmised that the game tree size (and game tree complexity) is at least ≈ 10^120). The number is an approximation built on assumed averages, not a measured count. Other calculations differ: Victor Allis gave a figure of at least 10^123, \"based on an average branching factor of 35 and an average game length of 80\". For scale, the number of atoms in the observable universe, to which it is often compared, is roughly estimated to be 10^80. This is the quantity usually termed game-tree complexity.\n\nLegal positions\n\nThe number of reachable board arrangements is far smaller. John Tromp and Peter Österlund estimated the number of legal chess positions with a 95% confidence level at (4.822±0.028)×10^44, based on an efficiently computable bijection between integers and chess positions. Other published estimates vary, with some placing the count between about 10^43 and 10^47. The gap between positions and games arises because transpositions allow one board to arise from many move orders, so the number of games far exceeds the number of positions.\n\nEndgame tablebases\n\nAn endgame tablebase is a precomputed database that gives the exact result of endgame positions. Tables are built by retrograde analysis, starting from checkmated positions and working backwards. For each position, the tablebase records the ultimate result of the game assuming perfect play from both sides (i.e. a win for White, a win for Black, or a draw), and the number of moves required to achieve that result. Ken Thompson's 1986 paper pioneered the technique of exhaustive retrograde analysis that is still used today. Coverage grew steadily: by 2005, tablebases for all positions having up to six pieces, including the two kings, had been created. The seven-piece tables were computed on a supercomputer at Moscow State University, and initially (in 2014) required 140 TB of storage space and the use of a supercomputer but was later reduced down to 18.4 TB through the Syzygy tablebase. One result from these tables is a mate-in-549 position discovered in the Lomonosov tablebase, which no human could solve unaided.\n\nComplexity of generalized chess\n\nComplexity theory treats chess by generalizing it to boards of arbitrary size, since a fixed 8×8 game is finite. Fraenkel and Lichtenstein showed in 1981 that, for generalized chess with arbitrary board sizes and setups, determining whether the first player has a winning strategy is EXPTIME-complete. EXPTIME denotes the set of all decision problems solvable by a deterministic Turing machine in exponential time. The result follows from the fact that such games can last a number of moves exponential in the board size. The result says that the difficulty grows exponentially with board size, but it does not give a direct answer for the standard board. It also means that finding perfect play is intractable in the worst case, which is why minimax search with alpha-beta pruning and heuristic evaluation are used in practice.\n\nWhether chess is solved\n\nChess is not known to be solved. Solving it would mean determining the theoretical value of the starting position under perfect play. Zermelo's theorem guarantees that a finite, two-player, zero-sum game of perfect information has a determined outcome, so the value exists in principle. The number of positions and the game-tree size make direct determination impossible with present methods. Tablebases have resolved perfect play in a limited set of endings, including all non-trivial endgames with no more than seven pieces or pawns (including the two kings), but this covers only a tiny fraction of the game." }, { "heading": "Variants of chess", "text": "Chess960, also called Fischer Random Chess, is the variant with the most formal standing. Bobby Fischer first presented the idea in Buenos Aires on 19 June 1996, to reduce the emphasis on opening preparation and to encourage creativity in play. The board, pieces and move rules are unchanged; only the eight pieces on each back rank are shuffled. Fischer kept two constraints: the bishops must stand on opposite-coloured squares, and the king must sit between the two rooks so that castling remains possible on both wings. Black's row mirrors White's. The count is straightforward: each bishop has four possible squares of its colour, the queen has six remaining squares, and the two identical knights share the five squares left, giving ten pairings. Thus \\(4 \\times 4 \\times 6 \\times 10 = 960\\). Castling differs only in its starting geometry, because the king and rook finish on the same squares as in orthodox castling, c1/g1 for White, c8/g8 for Black.\n\nChess960 has also entered formal competition. The 2026 tournament marks the first official FIDE-recognized Freestyle Chess World Championship, held at Schloss Weissenhaus in February 2026. Magnus Carlsen took the title by beating Fabiano Caruana 2½–1½ in the final, which secured his maiden Chess960 title and the twenty-first world title of his career. The title followed a 2025 season of Grand Slam events organised by Freestyle Chess Operations.\n\nCapablanca chess and knighted variants\n\nJosé Raúl Capablanca developed his variant after the Moscow 1925 tournament, when he wrote about the event and proposals for a new form of chess. His concern was that orthodox play was tending toward a \"draw death\", and he hoped that a larger game would give stronger players more room to win. He experimented with a 10×10 board before settling on the 10×8 format. Each side gained two pieces: the archbishop, which moves as a bishop or as a knight, and the chancellor, which moves as a rook or as a knight, but never both at once in a single move. The king moved three squares when castling instead of two, the pawns could advance one, two or three squares, and promotion to the new pieces was allowed. Edward Lasker assisted in development of the rules. The resulting family, also called knighted chess, contains over twenty Western chess variants which incorporate two new pieces, and the idea of a 10×8 board with these pieces is older than Capablanca's proposal.\n\nMultiplayer, hidden-information and rule-altering variants\n\nFour-player chess is played on a 14×14 board from which the four 3×3 corner blocks are removed. Four players occupy the sides, and the game may be played individually or in partnerships. Crazyhouse changes the capture rule: a captured piece switches sides, and on a later turn its new owner may drop it onto any empty square instead of moving a piece, with pawns barred from the first and eighth ranks. King of the Hill adds a second winning condition, in which a king that reaches one of the four central squares wins at once, alongside ordinary checkmate. Kriegspiel, devised in the late nineteenth century, is a hidden-information form in which each player sees only their own pieces, and a referee announces captures, checks and attempted illegal moves. Historical forms such as shatranj, which is discussed in the origins section, belong to the same tradition of changing the rules to test the game's balance.\n\nRelated games from Japan and China\n\nJapanese shogi and Chinese xiangqi are often compared with chess, though each has its own design. Shogi is played on a 9×9 board, and captured pieces can be returned to play by their captor, a mechanism close to Crazyhouse's drop rule. Pieces may also promote when they enter the far three ranks. Xiangqi is played on the intersections of lines rather than the squares, with a river across the middle and a palace for each general. Its pieces, which include chariots, cannons, horses and elephants, follow movement rules that differ from those of chess." }, { "heading": "Cognition, expertise and education", "text": "Chess has long served as a testing ground for theories of expertise. In the 1940s, the Dutch psychologist and master Adriaan de Groot described strong players as perceiving positions in terms of \"large complexes\", not as collections of separate pieces. William Chase and Herbert Simon later formalized this idea as chunking theory. In their 1973 work, experts outperformed weaker players when memorizing meaningful piece arrangements, and the authors explained the gap by the way experts store familiar clusters of pieces. Chunks were defined operationally by timing: pieces placed with gaps of less than about two seconds between them were grouped as one unit. The often-cited estimate of about 50,000 stored chunks for a Master or Grandmaster is an order-of-magnitude estimate, not a measured count.\n\nLater research refined this picture. Gobet and Simon re-examined the two-second boundary in 1998 and found it robust, while their template theory proposed that players also rely on long-term memory retrieval structures or templates in addition to chunks.\n\nChess has also been introduced into school systems, most prominently in Armenia. Chess became a compulsory subject for pupils in grades 2–4 in 2011, and the program's stated aims included developing convergent and divergent ways of thinking. Official survey results reported gains in concentration, creativity and logic after about 1.5 years of the program. These results came from the program's own surveys, so they are not independent evaluations. Popular commentary has gone further, claiming improvements in mathematics, reading and self-control, but these claims are not consistently supported. A more restrained picture comes from a controlled study of educational chess: after one academic year, the treated and control groups did not differ significantly in critical thinking, attention, patience or risk aversion, and the only clear advantage was in chess knowledge and proficiency.\n\nMeta-analyses offer the most systematic evidence on transfer to other abilities. Sala and Gobet's 2016 meta-analysis covered 24 studies and 40 effect sizes. For primary and middle school pupils, the reported effects were \\(d \\approx 0.38\\) for mathematics, \\(d \\approx 0.34\\) for overall cognitive ability and \\(d \\approx 0.25\\) for literacy. Effects grew with the amount of instruction, and about 25–30 hours was suggested as a minimum for meaningful benefit. A later analysis by the same group argued that the picture is less favorable: too few studies with an active control group have been carried out, and the few that exist suggest little far transfer. Broader reviews of cognitive training point the same way, finding small to medium near-transfer effects and small to null far-transfer effects. In other words, improvement at chess tends to be measurable, while carry-over to unrelated skills remains uncertain and depends heavily on study design, particularly the choice of control group.\n\nThe role of practice in chess expertise is also disputed. Researchers have debated how much of the variation in skill can be explained by accumulated practice, often framed through deliberate practice, and how much by differences in innate ability. Chess is a common test case because it produces large, precisely measured rating data and has long records of training hours. A 2016 meta-analysis by Burgoyne and colleagues examined the relationship between cognitive ability and chess skill, which keeps this question tied to measurable cognitive differences rather than to practice alone." }, { "heading": "Online chess and digital platforms", "text": "The first chess website which allowed playing through a graphical interface, was Caissa.com (known at the time as Caissa's Web) which launched in 1995. Later services such as Chess.com, and Lichess, and chess24, (acquired by Chess.com and later shut down). The growth of these sites from the late 1990s onward turned chess into a game that could be played across borders in real time, and by the 2020s the largest platforms handled very large volumes of games each day.\n\nThe COVID-19 lockdowns produced the sharpest rise in online activity. Chess.com had 1.5 million new subscribers in April, compared with 670,000 in January. FIDE's \"Checkmate Coronavirus\" event was the biggest online chess marathon ever, with an estimated 1.5 million games to be played across more than 2,000 tournaments in 720 hours of nonstop action. The effect was visible among professionals as well: between January and April of that year, the number of active GMs on Lichess more than doubled, eventually peaking at 728 in January 2021. Chess.com's own peak came earlier, in May 2020, with 922 active grandmasters. Activity then created a sharp surge in activity, followed by a slow post-pandemic decline. Popular culture also mattered: monthly Lichess games showed a second spike in October, likely caused by Netflix's popular series The Queen's Gambit.\n\nOnline ratings form a separate universe from official ones. Platforms such as Chess.com and Lichess run their own systems, and these are good for tracking your progress and playing competitively online, but they are not the same as a FIDE rating and don't count toward your official international chess ranking. The difference comes from structure rather than prestige: an online rating and a FIDE rating are not the same number because they come from different player pools, different rating formulas, and usually different time controls. Since a FIDE rating requires officially rated over-the-board events, you cannot obtain a standard FIDE rating through regular online play. Comparisons between platforms and federations are therefore approximate, and a number on one site cannot be read as equivalent to a number on another.\n\nFair play is the most contested operational issue. Chess.com's rules forbid running engines on ongoing games: using chess programs or engines to analyze positions in ongoing games is strictly prohibited. Daily games are treated differently, since you may consult non-engine resources, such as books and opening databases. Detection relies on statistics rather than a single signal. The cheat detection system detects suspicious play based on over 100 gameplay factors, and auto-bans players when a combination of these factors and accompanying statistical algorithms determines a performance to be extremely improbable. The company states that about 85% of closures are done without the need for a human to review the case. Its published figures report that the platform analyzed ~20 million games per day and closed about 314,000 accounts for fair play violations. Detection also extends to sandbagging, where players lose games on purpose to gain a competitive advantage against lower-rated players, and this is handled by algorithmic and automated sandbagging detection, which first warns and then closes the player for these violations.\n\nThe limits of these systems are openly discussed. Chess.com says that some detection methods are kept confidential to protect the system. Its guidance also notes that a high Accuracy score is not proof that a player didn't cheat. Critics argue the problem is larger than official figures suggest; one critical analysis notes that roughly 0.6% of all Chess.com accounts have been closed for violations against the fair play policy, and that the platform's staffing is small relative to its volume. Cheaters are also reported to adapt, with some playing random blunders to try and avoid the cheat detection algorithms of chess websites. In 2026, Chess.com reportedly began publicly marking accounts closed for cheating, rather than doing it quietly. Outside the major sites, event organizers have tried more intrusive methods; during an online national team event, players were required to be in front of his computer at all times as per the anti-cheating rules, with an arbiter, a proctor and multiple cameras monitoring each player." }, { "heading": "Open questions and disputes", "text": "Rating inflation complicates any attempt to compare players from different eras. The Elo rating system measures strength relative to a changing pool of active players, so a peak number from one decade does not carry the same meaning in another. Arpad Elo himself held that ratings could only measure a player against contemporaries, and he described rating as roughly like measuring a cork bobbing on agitated water. Peak ratings are nonetheless the simplest comparison, and they show a drift: the average of the ten highest-rated active players rose by 43 points between July 2000 and July 2014, while the average of the top hundred rose by 59 points. Whether this reflects a genuine increase in playing strength, driven by better preparation and analysis, or a shift in the rating scale itself, is disputed.\n\nBecause no single measure settles the question, the debate over the greatest player has produced several competing methods. Peak rating is the most straightforward but favors recent players. Alternatives weigh a player's dominance over contemporaries, longevity at the top, results in world championship matches and elite tournaments, and the strength of the opposition faced. These criteria can rank the same players very differently: a short but overwhelming peak and decades of consistent elite results point in different directions. Many disagreements over \"greatest\" are therefore disagreements about which criteria should count.\n\nDraws are a second open problem. At the highest level, decisive results have become rare in classical chess. Estimates vary by sample, but a study of about 22,000 games played in 1999 to 2002 by players rated near 2500 found that 55% ended in draws, and calculations suggest that grandmasters rated above 2750 draw more than 70% of their games. The 2018 world championship match between Magnus Carlsen and Fabiano Caruana had all twelve classical games drawn, and the 2021 match began with five consecutive draws before a decisive game. Two explanations are commonly offered: detailed preparation with strong engines narrows the margin for error, and long classical games give players time to neutralize each other's plans. In response, players and organizers have debated changes to time controls, the tiebreak systems used to decide level matches, and rules intended to produce more decisive results. Some of these proposals address the first-move advantage, since White's edge persists at higher levels of play even as decisive games become scarcer.\n\nHow machine analysis should shape human competition also remains unresolved. Engines now surpass the strongest players by a wide margin and are used in preparation, post-game review and training. This raises practical questions: whether players should face limits on preparation, how outside assistance can be detected in over-the-board and online events, and whether engine-derived opening lines reduce the variety of human play. The results of engine-only play point to the same tension. In a series of 10,000 self-play games by a leading program in 2020, White won most of the decisive games, but these made up only about 2% of the total, and the remaining 98% were draws. Whether such results reveal the limits of the game or the limits of the current rules is a question that artificial intelligence research has not resolved.\n\nTwo larger questions also remain open. Chess is not known to be solved. The outcome of perfect play from the starting position is fixed in principle, but no one knows what it is, and the gap between tablebase coverage of endgames and the full game is very large. The gender gap in participation and at the highest ratings is another open question. Explanations that have been proposed include differences in early participation, social and cultural factors, and the small size of the pool of players at the top. Each explanation has supporters, and the available data do not yet establish a single cause, so the entry should present these accounts as competing hypotheses rather than settled conclusions." } ], "links": [ "game-theory", "artificial-intelligence", "india", "persian-empire", "middle-ages", "renaissance", "zero-sum-game", "islam", "japan", "china", "heuristic", "soviet-union", "united-states", "cold-war", "russia", "norway", "world-war-ii", "minimax", "alpha-beta-pruning", "john-mccarthy", "deep-blue", "claude-shannon", "algorithm", "armenia" ], "sources": [ { "title": "1 July 1971: FIDE introduces Elo ratings", "url": "https://en.chessbase.com/post/1-july-1971-fide-introduces-elo-ratings" }, { "title": "Elo rating system", "url": "https://en.wikipedia.org/wiki/Elo_rating_system" }, { "title": "World Chess Championship 2026", "url": "https://en.wikipedia.org/wiki/World_Chess_Championship_2026" }, { "title": "Candidates Tournament 2026", "url": "https://en.wikipedia.org/wiki/Candidates_Tournament_2026" }, { "title": "Women%27s World Chess Championship 2026", "url": "https://en.wikipedia.org/wiki/Women%27s_World_Chess_Championship_2026" }, { "title": "FIDE Freestyle Chess World Championship 2026", "url": "https://en.wikipedia.org/wiki/FIDE_Freestyle_Chess_World_Championship_2026" }, { "title": "Comparison of top chess players throughout history", "url": "https://en.wikipedia.org/wiki/Comparison_of_top_chess_players_throughout_history" }, { "title": "Learning the Latent Rules of a Game from Data: A Chess Story", "url": "https://arxiv.org/pdf/2410.02426" }, { "title": "Portable Game Notation", "url": "https://en.wikipedia.org/wiki/Portable_Game_Notation" }, { "title": "Classical, rapid and blitz ratings", "url": "https://chessrankings.com/blog/classical-rapid-blitz-chess-ratings/" }, { "title": "Chess Time Controls: Bullet, Blitz, Rapid & Classical Explained", "url": "https://www.democraticchess.com/chess-time-controls" }, { "title": "37th Chess Olympiad", "url": "https://en.wikipedia.org/wiki/37th_Chess_Olympiad" }, { "title": "World Rapid Chess Championship", "url": "https://en.wikipedia.org/wiki/World_Rapid_Chess_Championship" }, { "title": "Sonneborn%E2%80%93Berger score", "url": "https://en.wikipedia.org/wiki/Sonneborn%E2%80%93Berger_score" }, { "title": "Swiss System Tiebreaks: Adviser & Calculator", "url": "https://www.chessworld.net/chessclubs/openingguide/swiss-system-tiebreaks.asp" }, { "title": "Buchholz system", "url": "https://en.wikipedia.org/wiki/Buchholz_system" }, { "title": "Tie-breaking in Swiss-system tournaments", "url": "https://en.wikipedia.org/wiki/Tie-breaking_in_Swiss-system_tournaments" }, { "title": "Chess World Cup 2025", "url": "https://en.wikipedia.org/wiki/Chess_World_Cup_2025" }, { "title": "Time Controls in Chess and Their Differences", "url": "https://worldchess.com/chess-terms/chess-time-controls" }, { "title": "Fast chess", "url": "https://en.wikipedia.org/wiki/Fast_chess" }, { "title": "World Blitz Chess Championship 2024", "url": "https://en.wikipedia.org/wiki/World_Blitz_Chess_Championship_2024" }, { "title": "PGN Explained: Chess's Portable Game Notation", "url": "https://chessmind.ai/chess-terms/pgn" }, { "title": "Chaturanga", "url": "https://en.wikipedia.org/wiki/Chaturanga" }, { "title": "Shatranj", "url": "https://en.wikipedia.org/wiki/Shatranj" }, { "title": "Chaturanga Chess - Old Indian Game Chess", "url": "https://worldchess.com/chess-terms/chaturanga-game" }, { "title": "Chess Variants/Chaturanga and Shatranj - Wikibooks, open books for an open world", "url": "https://en.wikibooks.org/wiki/Chess_Variants/Chaturanga_and_Shatranj" }, { "title": "Chaturanga…The lost game - Chess.com", "url": "https://www.chess.com/blog/Shadow_47/chaturangahellipthe-lost-game" }, { "title": "Chaturanga", "url": "https://www.chessvariants.com/historic.dir/chaturanga.html" }, { "title": "(PDF) The Poem Scachs d'amor (1475). First Text of Modern Chess", "url": "https://www.researchgate.net/publication/309789759_The_Poem_Scachs_d'amor_1475_First_Text_of_Modern_Chess" }, { "title": "Andorra Chess - From the Pyrenees to Valencia: How Iberia Shaped Modern Chess - Chess.com", "url": "https://www.chess.com/blog/escacsandorra/andorra-chess-from-the-pyrenees-to-valencia-how-iberia-shaped-modern-chess" }, { "title": "2025-10-07 Scachs d’amor: The Poem That Gave Birth to Modern Chess", "url": "https://www.kwabc.org/en/newsitem/scachs-d-amor-the-poem-that-gave-birth-to-modern-chess.html?pdf=4" }, { "title": "Scachs d%27amor", "url": "https://en.wikipedia.org/wiki/Scachs_d%27amor" }, { "title": "1475 The origin of modern chess - Carolus Chess", "url": "https://sites.google.com/site/caroluschess/modern-history/the-origin-of-modern-chess" }, { "title": "Valencia and the origin of modern chess - Chess.com", "url": "https://www.chess.com/news/view/valencia-and-the-origin-of-modern-chess" }, { "title": "Francesc Vicent", "url": "https://en.wikipedia.org/wiki/Francesc_Vicent" }, { "title": "Chess in Spain", "url": "https://en.wikipedia.org/wiki/Chess_in_Spain" }, { "title": "Libro de los juegos", "url": "https://en.wikipedia.org/wiki/Libro_de_los_juegos" }, { "title": "Alfonso's Book of Games", "url": "http://www.cyningstan.com/post/961/alfonsos-book-of-games" }, { "title": "Timeline of chess", "url": "https://en.wikipedia.org/wiki/Timeline_of_chess" }, { "title": "ECO - Chess Programming Wiki", "url": "https://chessprogramming.org/ECO" }, { "title": "Encyclopaedia of Chess Openings", "url": "https://en.wikipedia.org/wiki/Encyclopaedia_of_Chess_Openings" }, { "title": "Philidor position", "url": "https://en.wikipedia.org/wiki/Philidor_position" }, { "title": "Philidor Position Guide: Draw Rook Endgames Correctly", "url": "https://chesstrapguide.com/learn/philidor-position-endgame-guide-2026/" }, { "title": "Lucena position", "url": "https://en.wikipedia.org/wiki/Lucena_position" }, { "title": "Lucena Position Guide: Build the Bridge in Rook Endgames", "url": "https://chesstrapguide.com/learn/lucena-position-endgame-guide-2026/" }, { "title": "Rating Regulations - The K-Factor", "url": "https://old.fide.com/component/content/article/1-fide-news/3963-rating-regulations-the-k-factor.html" }, { "title": "How do I get a chess title (Grandmaster, IM, etc.)?", "url": "https://support.chess.com/en/articles/8557897-how-do-i-get-a-chess-title-grandmaster-im-etc" }, { "title": "FIDE titles", "url": "https://en.wikipedia.org/wiki/FIDE_titles" }, { "title": "United States Chess Federation", "url": "https://en.wikipedia.org/wiki/United_States_Chess_Federation" }, { "title": "Chess rating system", "url": "https://en.wikipedia.org/wiki/Chess_rating_system" }, { "title": "List of FIDE chess world number ones", "url": "https://en.wikipedia.org/wiki/List_of_FIDE_chess_world_number_ones" }, { "title": "Arpad Elo", "url": "https://en.wikipedia.org/wiki/Arpad_Elo" }, { "title": "Empirical parameterization of the Elo Rating System", "url": "https://arxiv.org/pdf/2512.18013" }, { "title": "FIDE Ratings Explained", "url": "https://chessarchive.net/en/chess-articles/fide-ratings-explained-what-they-are-how-they-are-calculated-and-why-the-system-works-the-way-it-does" }, { "title": "B. PERMANENT COMMISSIONS / 02. FIDE Rating Regulations (Qualification Commission) / FIDE Rating Regulations effective from 1 July 2017 till 31 December 2021 (with amendments effective from 1 February 2021) / FIDE Handbook", "url": "https://handbook.fide.com/chapter/b022017" }, { "title": "The Elo Rating in Chess: Where It Came From and How It Works", "url": "https://blog.duolingo.com/what-is-an-elo-rating-in-chess/" }, { "title": "FIDE Rating Calculator: Rating Change, Performance & Initial Rating", "url": "https://oldschoolchess.com/tools/fide-rating-calculator" }, { "title": "Chess title", "url": "https://en.wikipedia.org/wiki/Chess_title" }, { "title": "Anniversary of Arpad Elo", "url": "https://www.fide.com/anniversary-of-arpad-elo-rating-system-that-changed-chess-world/" }, { "title": "World Chess Championship 2026: Gukesh vs Sindarov Preview", "url": "https://www.365chess.com/view/world-chess-championship-2026/" }, { "title": "World Chess Championship 2026: Gukesh vs Sindarov, Results", "url": "https://ramachess.com/world-chess-championship-2026/" }, { "title": "Gukesh vs Sindarov World Chess Championship 2026: $2.5 Million Prize Money, Date, Time, Venue, Format And Live Streaming", "url": "https://sundayguardianlive.com/sports/gukesh-vs-sindarov-world-chess-championship-2026-25-million-prize-money-date-time-venue-format-and-live-streaming-285176/" }, { "title": "FIDE Candidates 2026 Final Standings & Study Suite", "url": "https://www.chessworld.net/chess-candidates-2026.asp" }, { "title": "Javokhir Sindarov", "url": "https://en.wikipedia.org/wiki/Javokhir_Sindarov" }, { "title": "D Gukesh Returns To Form; Beats Fabiano Caruana To Tie For Fourth At Super Rapid and Blitz 2026", "url": "https://www.newsx.com/sports/d-gukesh-returns-to-form-beats-fabiano-caruana-to-tie-for-fourth-at-super-rapid-and-blitz-2026-chess-news-215786/" }, { "title": "Super Rapid And Blitz 2026: D Gukesh Finishes Sixth; Hans Moke Niemann Wins Title", "url": "https://www.outlookindia.com/sports/others/super-rapid-blitz-2026-report-d-gukesh-sixth-place-finish-grand-chess-tour-world-championship-poland" }, { "title": "Women%27s World Chess Championship 2025", "url": "https://en.wikipedia.org/wiki/Women%27s_World_Chess_Championship_2025" }, { "title": "Women%27s Candidates Tournament 2026", "url": "https://en.wikipedia.org/wiki/Women%27s_Candidates_Tournament_2026" }, { "title": "Vaishali conquers Women’s Candidates to set up world title showdown against Ju Wenjun", "url": "https://www.fide.com/vaishali-conquers-womens-candidates-to-set-up-world-title-showdown-against-ju-wenjun/" }, { "title": "R Vaishali wins FIDE Candidates; to challenge Ju Wenjun for Women's World Championship - ESPN", "url": "https://www.espn.com/chess/story/_/id/48494671/r-vaishali-wins-fide-candidates-challenge-ju-wenjun-women-world-championship" }, { "title": "L%C3%A1szl%C3%B3 Polg%C3%A1r", "url": "https://en.wikipedia.org/wiki/L%C3%A1szl%C3%B3_Polg%C3%A1r" }, { "title": "Judit Polg%C3%A1r", "url": "https://en.wikipedia.org/wiki/Judit_Polg%C3%A1r" }, { "title": "Judit Polgár", "url": "https://jewishvirtuallibrary.org/judit-polg-aacute-r" }, { "title": "Expert performance of men and women: A cross-cultural study in the chess domain - ScienceDirect", "url": "https://www.sciencedirect.com/science/article/abs/pii/S0191886916304111" }, { "title": "Are participation rates sufficient to explain gender differences in chess performance?", "url": "https://www.researchgate.net/publication/42541397_Are_participation_rates_sufficient_to_explain_gender_differences_in_chess_performance" }, { "title": "Searching for the Queen's Gambit: An Analysis of Male-Female Performance Gaps in U.S. Chess - Brian Kisida, Matthew Pepper, Michael Podgursky, Michelle Wickman, 2026", "url": "https://journals.sagepub.com/doi/full/10.1177/15270025261438415" }, { "title": "An Exploratory Analysis of Male-Female Ratings Gaps in ...", "url": "https://edworkingpapers.com/sites/default/files/ai25-1181.pdf" }, { "title": "Study Reveals New Insights Into Gender Gap In Chess: Equal Start, Equal Progress - Chess.com", "url": "https://www.chess.com/news/view/li-glickman-chabris-2025-sex-ratings-retention-competitive-chess" }, { "title": "What’s behind the gender imbalance in top-level chess?", "url": "https://theconversation.com/whats-behind-the-gender-imbalance-in-top-level-chess-150637" }, { "title": "Vaishali Rameshbabu", "url": "https://en.wikipedia.org/wiki/Vaishali_Rameshbabu" }, { "title": "Judit Polgar Interview: 'I Had To Prove Myself More Than A Boy' - Chess.com", "url": "https://www.chess.com/article/view/judit-polgar-interview-chess" }, { "title": "Chess Olympiad 2026: Everything You Need To Know / News / World Chess - Official FIDE Online Chess Gaming Platform", "url": "https://worldchess.com/news/chess-olympiad-2026-everything-you-need-to-know" }, { "title": "Uzbekistan’s dream finish: Olympiad gold in Samarkand", "url": "https://www.fide.com/uzbekistans-dream-finish-olympiad-gold-in-samarkand/" }, { "title": "46th Chess Olympiad", "url": "https://en.wikipedia.org/wiki/46th_Chess_Olympiad" }, { "title": "2026 Chess Olympiad Round 7: Uzbekistan Leads With 7/7 Match Wins; No Team Perfect In Women's - Chess.com", "url": "https://www.chess.com/news/view/2026-samarkand-chess-olympiad-round-7" }, { "title": "Chess to the Masses: Soviet Chess and Education — Soviet Chess History", "url": "https://sovietchesshistory.org/soviet-chess-history/chess-to-the-masses" }, { "title": "Soviet chess school", "url": "https://en.wikipedia.org/wiki/Soviet_chess_school" }, { "title": "The Soviet School of Chess Revisited (Part One) - Chess.com", "url": "https://www.chess.com/blog/MikhailFyodorovich/the-soviet-school-of-chess-revisited-part-one" }, { "title": "How did Russians get so good at chess?", "url": "https://slate.com/news-and-politics/2009/09/how-did-russians-get-so-good-at-chess.html" }, { "title": "History", "url": "https://tatasteelchess.com/en/history" }, { "title": "Tata Steel Chess Tournament", "url": "https://www.tatasteelnederland.com/en/about-tata-steel/community-involvement/tata-steel-chess-tournament" }, { "title": "Tata Steel Chess Tournament 2017", "url": "https://en.wikipedia.org/wiki/Tata_Steel_Chess_Tournament_2017" }, { "title": "World Chess Weekly: Flurry Of Tournament Line-Ups Revealed As Tata Steel Hots Up / News / World Chess - Official FIDE Online Chess Gaming Platform", "url": "https://worldchess.com/news/world-chess-weekly-flurry-of-tournament-announcements-as-tata-steel-hots-up" }, { "title": "Tata Steel Chess Tournament 2025", "url": "https://en.wikipedia.org/wiki/Tata_Steel_Chess_Tournament_2025" }, { "title": "A Chess Story by Stefan Zweig: 9781805332411", "url": "https://www.penguinrandomhouse.com/books/841852/a-chess-story-by-stefan-zweig/" }, { "title": "The Royal Game", "url": "https://en.wikipedia.org/wiki/The_Royal_Game" }, { "title": "The Defense", "url": "https://en.wikipedia.org/wiki/The_Defense" }, { "title": "The Defense by Vladimir Nabokov", "url": "https://www.ebsco.com/research-starters/history/defense-vladimir-nabokov/" }, { "title": "Jacobus de Cessolis", "url": "https://en.wikipedia.org/wiki/Jacobus_de_Cessolis" }, { "title": "Jacobus de Cessolis: The chessboard as a model of virtue and medieval order", "url": "https://en.chessbase.com/post/jacobus-de-cessolis-uvencio-blanco" }, { "title": "Jacobus de Cessolis - Chess Collectors International", "url": "https://chesscollectorsinternational.org/history-of-chess/original-sources-of-chess-history/jacobus-de-cessolis/" }, { "title": "JACOBUS DE CESSOLIS, Liber de moribus hominum et officiis nobilium sive super ludum scaccorum [Book of the customs of men and the duties of nobles or the Book of Chess]", "url": "https://www.textmanuscripts.com/medieval/cessolis-liber-de-moribus-60910" }, { "title": "Caxton’s Chess Book", "url": "https://stjohnscollegelibraryoxford.org/2025/08/25/caxtons-chess-book/" }, { "title": "Claude Shannon - Chess Programming Wiki", "url": "https://chessprogramming.org/Claude_Shannon" }, { "title": "A Chess-Playing Machine Author(s): Claude E. Shannon", "url": "https://www.paradise.caltech.edu/ist4/lectures/shannonchess1950.pdf" }, { "title": "Fermat's Library", "url": "https://fermatslibrary.com/s/programming-a-computer-for-playing-chess" }, { "title": "Programming a Computer for Playing Chess", "url": "https://fr.wikipedia.org/wiki/Programming_a_Computer_for_Playing_Chess" }, { "title": "Superior Computer Chess with Model Predictive Control, Reinforcement Learning, and Rollout", "url": "https://arxiv.org/pdf/2409.06477" }, { "title": "MacHack VI", "url": "https://www.britannica.com/topic/MacHack-VI" }, { "title": "Computers and Chess - A History - Chess.com", "url": "https://www.chess.com/article/view/computers-and-chess---a-history" }, { "title": "Mac Hack", "url": "https://en.wikipedia.org/wiki/Mac_Hack" }, { "title": "Human%E2%80%93computer chess matches", "url": "https://en.wikipedia.org/wiki/Human%E2%80%93computer_chess_matches" }, { "title": "Kotok-McCarthy", "url": "https://en.wikipedia.org/wiki/Kotok-McCarthy" }, { "title": "Deep Blue defeats Garry Kasparov in chess match", "url": "https://www.history.com/this-day-in-history/may-11/deep-blue-defeats-garry-kasparov-in-chess-match" }, { "title": "Deep Blue", "url": "https://www.ibm.com/history/deep-blue" }, { "title": "Deep Blue", "url": "https://www.britannica.com/topic/Deep-Blue" }, { "title": "deep blue", "url": "https://www.ibm.com/mx-es/history/deep-blue" }, { "title": "Deep Blue Beats Kasparov in Chess", "url": "https://www.ebsco.com/research-starters/sports-and-leisure/deep-blue-beats-kasparov-chess/" }, { "title": "Deep Blue versus Kasparov, 1997, Game 6", "url": "https://en.wikipedia.org/wiki/Deep_Blue_versus_Kasparov,_1997,_Game_6" }, { "title": "Kasparov versus Deep Blue 1997 - Chess Programming Wiki", "url": "https://chessprogramming.org/Kasparov_versus_Deep_Blue_1997" }, { "title": "How IBM’s Deep Blue Beat World Champion Chess Player Garry Kasparov - IEEE Spectrum", "url": "https://spectrum.ieee.org/how-ibms-deep-blue-beat-world-champion-chess-player-garry-kasparov" }, { "title": "AlphaZero", "url": "https://en.wikipedia.org/wiki/AlphaZero" }, { "title": "AlphaZero", "url": "https://chess.fandom.com/wiki/AlphaZero" }, { "title": "Stockfish vs AlphaZero: What Really Happened", "url": "https://checkmatex.app/blog/stockfish-vs-alphazero-what-really-happened-2026" }, { "title": "Best Chess Engines in 2026, Ranked by Strength", "url": "https://bestchessmove.xyz/guides/best-chess-engines" }, { "title": "Leela Chess Zero - Chess Engines - Chess.com", "url": "https://chess.com/amp/terms/leela-chess-zero-engine" }, { "title": "Stockfish vs Leela Chess Zero (Lc0): Which for Game Review?", "url": "https://mychessplan.com/stockfish-vs-leela-chess-zero-adult-improver-engine-audit-2026/" }, { "title": "Stockfish vs Leela vs Komodo: Best Chess Engine 2026", "url": "https://checkmatex.app/blog/stockfish-vs-leela-vs-komodo-best-chess-engine-2026" }, { "title": "Why Stockfish is So Good (and How You Could Write a Chess Engine) - DEV Community", "url": "https://dev.to/djinn/why-stockfish-is-so-good-and-how-you-could-write-a-chess-engine-2lck" }, { "title": "Chess and Computers: How Technology Changed the Game - Chess.com", "url": "https://www.chess.com/blog/OnlineChessTeacher/chess-and-computers-how-technology-changed-the-game" }, { "title": "Chess Openings in the Engine Era", "url": "https://www.chessnutech.com/blogs/chess-rules/chess-openings-in-the-engine-era-1" }, { "title": "(PDF) The Effects of Computer and AI Engines on Competitive Chess", "url": "https://www.researchgate.net/publication/378174122_The_Effects_of_Computer_and_AI_Engines_on_Competitive_Chess" }, { "title": "AlphaZero - Chess Engines - Chess.com", "url": "https://www.chess.com/terms/alphazero-chess-engine" }, { "title": "The Epic Battle: Stockfish vs. Leela with 3600 ELO", "url": "https://www.toolify.ai/ai-news/the-epic-battle-stockfish-vs-leela-with-3600-elo-6540" }, { "title": "An estimation method for game complexity", "url": "https://arxiv.org/pdf/1901.11161" }, { "title": "Shannon number", "url": "https://en.wikipedia.org/wiki/Shannon_number" }, { "title": "Endgame tablebase", "url": "https://en.wikipedia.org/wiki/Endgame_tablebase" }, { "title": "The Effect of Endgame Tablebases on Modern Chess Engines By Christopher Peterson", "url": "https://digitalcommons.calpoly.edu/cgi/viewcontent.cgi?article=1276&context=cpesp" }, { "title": "Solving chess", "url": "https://en.wikipedia.org/wiki/Solving_chess" }, { "title": "Regular Boardgames", "url": "https://arxiv.org/pdf/1706.02462" }, { "title": "Computational Complexity of a Game of NxN Chess", "url": "https://medium.com/smith-hcv/computational-complexity-of-a-game-of-nxn-chess-e000f2070d8a" }, { "title": "Lomonosov tablebases", "url": "https://tb7.chessok.com/" }, { "title": "Generalized game", "url": "https://en.wikipedia.org/wiki/Generalized_game" }, { "title": "A Note on the Computational Complexity of Selfmate and Reflexmate Chess Problems", "url": "https://arxiv.org/pdf/2208.05376" }, { "title": "Computing a perfect strategy for n × n chess requires time exponential in n - ScienceDirect", "url": "https://www.sciencedirect.com/science/article/pii/0097316581900169" }, { "title": "How Many Possible Chess Games Are There?", "url": "https://stauntonchess.com/how-many-possible-chess-games-are-there.html" }, { "title": "Chess960", "url": "https://en.wikipedia.org/wiki/Chess960" }, { "title": "Chess960 (Fischer Random): Rules, Strategy & Tips (2026)", "url": "https://oldschoolchess.com/learn/variants/chess960" }, { "title": "Magnus Carlsen wins 2026 FIDE Freestyle World Championship", "url": "https://www.fide.com/magnus-carlsen-wins-2026-fide-freestyle-world-championship/" }, { "title": "Capablanca and the question of draws", "url": "https://en.chessbase.com/post/capablanca-and-the-question-of-draws" }, { "title": "Chess Variants/Capablanca Chess - Wikibooks, open books for an open world", "url": "https://en.wikibooks.org/wiki/Chess_Variants/Capablanca_Chess" }, { "title": "Capablanca chess", "url": "https://en.wikipedia.org/wiki/Capablanca_chess" }, { "title": "An Introduction to Fischer Random Chess", "url": "https://www.chessable.com/blog/an-introduction-to-fischer-random-chess/" }, { "title": "What is Chess960 or Fischer Random Chess?", "url": "https://www.digitalgametechnology.com/what-is-chess960-or-fischer-random-chess" }, { "title": "Chess960 numbering scheme", "url": "https://en.wikipedia.org/wiki/Chess960_numbering_scheme" }, { "title": "Carlsen beats Caruana in dramatic match to become Freestyle Chess World Champion!", "url": "https://en.chessbase.com/post/freestyle-chess-wc-2026-3" }, { "title": "Freestyle Chess Grand Slam Tour", "url": "https://en.wikipedia.org/wiki/Freestyle_Chess_Grand_Slam_Tour" }, { "title": "Memory Chunking - Chess.com", "url": "https://www.chess.com/blog/ghefley/memory-chunking" }, { "title": "MEMORY, 1998, 6 (3), 225-255 Expert Chess Memory: Revisiting the Chunking", "url": "http://iiif.library.cmu.edu/file/Simon_box00081_fld06512_bdl0007_doc0001/Simon_box00081_fld06512_bdl0007_doc0001.pdf" }, { "title": "[PDF] Expert chess memory: revisiting the chunking hypothesis.", "url": "https://www.semanticscholar.org/paper/Expert-chess-memory:-revisiting-the-chunking-Gobet-Simon/d11f079a1d6d3147abbb7868955a6231f4a5ba5b" }, { "title": "\"Chess at School\" Program", "url": "https://chessfed.am/en/static-page/detail/2" }, { "title": "Cognitive Training: A Field in Search of a Phenomenon - Fernand Gobet, Giovanni Sala, 2023", "url": "https://journals.sagepub.com/doi/full/10.1177/17456916221091830" }, { "title": "Near and Far Transfer in Cognitive Training: A Second-Order Meta-Analysis", "url": "https://online.ucpress.edu/collabra/article/5/1/18/113004/Near-and-Far-Transfer-in-Cognitive-Training-A" }, { "title": "Frontiers", "url": "https://www.frontiersin.org/journals/psychology/articles/10.3389/fpsyg.2022.986787/full" }, { "title": "How Chess Masters Remember: The Secret Is “Chunking”", "url": "https://historysgambit.com/curiosities/how-chess-masters-remember" }, { "title": "The Effects of Chess Instruction on Pupils' Cognitive and Academic Skills: State of the Art and Theoretical Challenges", "url": "https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5322219/" }, { "title": "Does Far Transfer Exist? Negative Evidence From Chess, Music, and Working Memory Training - Giovanni Sala, Fernand Gobet, 2017", "url": "https://journals.sagepub.com/doi/10.1177/0963721417712760" }, { "title": "Presentation of Armenian “Chess in Schools” Program", "url": "https://www.chessdom.com/presentation-of-armenian-chess-in-schools-program/" }, { "title": "Chess is the ultimate low-tech answer to the challenge of AI - New Eastern Europe", "url": "https://neweasterneurope.eu/2025/07/21/chess-is-the-ultimate-low-tech-answer-to-the-challenge-of-ai/" }, { "title": "(PDF) Analysis of the Efficiency of Teaching Chess in Schools", "url": "https://www.researchgate.net/publication/318679174_Analysis_of_the_Efficiency_of_Teaching_Chess_in_Schools" }, { "title": "Online chess", "url": "https://en.wikipedia.org/wiki/Online_chess" }, { "title": "Online Chess Taking Advantage Of Opportunity To Grow, Entertain During Coronavirus Pandemic", "url": "https://www.forbes.com/sites/michaellore/2020/05/26/online-chess-taking-advantage-of-opportunity-to-grow-entertain-during-coronavirus-pandemic/" }, { "title": "Where do Grandmasters play Chess? Lichess or Chess.com - Chess.com", "url": "https://www.chess.com/blog/New-dummy/where-do-grandmasters-play-chess-lichess-or-chess-com" }, { "title": "Online chess makes its move on pandemic players", "url": "https://cusjc.ca/noveltimes/2020/12/10/online-chess-makes-its-move-on-pandemic-players/" }, { "title": "ELo vs. FIDE Rating • page 1/2 • General Chess Discussion • lichess.org", "url": "https://lichess.org/forum/general-chess-discussion/elo-vs-fide-rating" }, { "title": "Online Rating vs FIDE Adviser, Range & Trainer", "url": "https://www.chessworld.net/chessclubs/openingguide/online-vs-fide-ratings.asp" }, { "title": "Online Chess vs FIDE: Rating & Tournament Adviser", "url": "https://www.chessworld.net/chessclubs/openingguide/online-chess-vs-fide.asp" }, { "title": "What do I need to know about Fair Play on Chess.com?", "url": "https://support.chess.com/en/articles/8568369-what-do-i-need-to-know-about-fair-play-on-chess-com" }, { "title": "Chess Cheating - Our Fair Play System Explained - Chess.com", "url": "https://www.chess.com/cheating" }, { "title": "The Cheating Problem in Online Chess is Worse Than Chess.com Admits - Chess.com", "url": "https://www.chess.com/blog/TheMythicBlog/the-cheating-problem-in-online-chess-is-worse-than-chess-com-admits" }, { "title": "Are You Playing a Chess Cheat", "url": "https://www.houseofstaunton.com/blogs/chess-matches/playing-a-chess-cheat" }, { "title": "How New Anti‑Cheating Technology Is Changing Chess - Chess.com", "url": "https://www.chess.com/blog/VNicolaisen/how-new-anti-cheating-technology-is-changing-chess" }, { "title": "Elo Rating System - Chess Terms - Chess.com", "url": "https://www.chess.com/terms/elo-rating-chess" }, { "title": "Asymmetric reformulation of draw rules in chess and its implications for game theory: Repetition as loss for White", "url": "https://arxiv.org/pdf/2604.03683" }, { "title": "Fairer Chess: A Reversal of Two Opening Moves in Chess Creates Balance Between White and Black", "url": "https://arxiv.org/pdf/2108.02547" }, { "title": "How Often Do Professional Chess Players Draw Games?", "url": "https://www.chesschampion.com/how-often-do-professional-chess-players-draw-games-8710255/" }, { "title": "First-move advantage in chess", "url": "https://en.wikipedia.org/wiki/First-move_advantage_in_chess" } ], "license": "https://creativecommons.org/licenses/by/4.0/" }