Chess is a board game for two players. It is sometimes called international chess or Western chess to distinguish it from related games such as xiangqi (Chinese chess) and shogi (Japanese chess).
Chess is an abstract strategy game that involves no hidden information and no elements of chance. It is played on a chessboard with 64 squares arranged in an 8×8 grid. The players, referred to as "White" and "Black", each control sixteen pieces: one king, one queen, two rooks, two bishops, two knights, and eight pawns. White moves first, followed by Black. The game is typically won by checkmating the opponent's king, i.e. threatening it with inescapable capture. There are several ways a game can end in a draw.
The recorded history of chess goes back at least to the emergence of a similar game, chaturanga, in seventh-century India. After its introduction in Persia, it spread to the Arab world and then to Europe. The rules of chess as they are known today emerged in Europe at the end of the 15th century, with standardization and universal acceptance by the end of the 19th century. Today, chess is one of the world's most popular games and is played by millions of people worldwide. (Full article...)
Computer chess includes both hardware (dedicated computers) and software capable of playing chess. Computer chess provides opportunities for players to practice even in the absence of human opponents, and also provides opportunities for analysis, entertainment and training. Computer chess applications that play at the level of a chess grandmaster or higher are available on hardware from supercomputers to smart phones. Standalone chess-playing machines are also available. Stockfish, Leela Chess Zero, GNU Chess, Fruit, and other free open source applications are available for various platforms.
Computer chess applications, whether implemented in hardware or software, utilize different strategies than humans to choose their moves: they use heuristic methods to build, search and evaluate trees representing sequences of moves from the current position and attempt to execute the best such sequence during play. Such trees are typically quite large, thousands to millions of nodes. The computational speed of modern computers, capable of processing tens of thousands to hundreds of thousands of nodes or more per second, along with extension and reduction heuristics that narrow the tree to mostly relevant nodes, make such an approach effective. (Full article...)
Rank | Player | Rating |
---|---|---|
1 | Magnus Carlsen | 2831 |
2 | Hikaru Nakamura | 2802 |
3 | Arjun Erigaisi | 2797 |
4 | Fabiano Caruana | 2796 |
5 | Gukesh D | 2794 |
6 | Nodirbek Abdusattorov | 2783 |
7 | Alireza Firouzja | 2767 |
8 | Wei Yi | 2763 |
9 | Ian Nepomniachtchi | 2755 |
10 | Wesley So | 2751 |
11 | Viswanathan Anand | 2751 |
12 | Praggnanandhaa R | 2746 |
13 | Leinier Dominguez | 2741 |
14 | Jan-Krzysztof Duda | 2740 |
15 | Quang Liem Le | 2739 |
16 | Levon Aronian | 2738 |
17 | Maxime Vachier-Lagrave | 2735 |
18 | Shakhriyar Mamedyarov | 2733 |
19 | Hans Niemann | 2733 |
20 | Anish Giri | 2728 |
Index: | A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (0–9) |
Glossary: | A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
The following Wikimedia Foundation sister projects provide more on this subject: