Wiki Article

Portal:Chess

Nguồn dữ liệu từ Wikipedia, hiển thị bởi DefZone.Net


Welcome to the Chess Portal

Introduction

Part of a Staunton chess set
Left to right: white king, black rook, black queen, white pawn, black knight, white bishop

Chess is a board game for two players, played on a square board consisting of 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, with each piece type having a different pattern of movement. An enemy piece may be captured (removed from the board) by moving one's own piece onto the square it occupies. The object of the game is to "checkmate" (threaten with inescapable capture) the enemy king. There are also several ways a game can end in a draw.

The recorded history of chess dates back to the emergence of chaturanga in 7th-century India. Chaturanga is also thought to be an ancestor of similar games like janggi, xiangqi, and shogi. After its introduction to Persia, it spread to the Arab world and then to Europe. The modern rules of chess emerged in Europe at the end of the 15th century, becoming standardized and gaining universal acceptance by the end of the 19th century. Today, chess is one of the world's most popular games, with millions of players worldwide.

Organized chess arose in the 19th century. International chess competitions today are governed by the International Chess Federation FIDE (Fédération Internationale des Échecs). The first universally recognized World Chess Champion, Wilhelm Steinitz, claimed his title in 1886; Gukesh Dommaraju is the current World Champion, having won the title in 2024. (Full article...)

8x8 Rook's graph

In graph theory, a rook's graph is an undirected graph that represents all legal moves of the rook chess piece on a chessboard. Each vertex of a rook's graph represents a square on a chessboard, and there is an edge between any two squares sharing a row (rank) or column (file), the squares that a rook can move between. These graphs can be constructed for chessboards of any rectangular shape. Although rook's graphs have only minor significance in chess lore, they are more important in the abstract mathematics of graphs through their alternative constructions: rook's graphs are the Cartesian product of two complete graphs, and are the line graphs of complete bipartite graphs. The square rook's graphs constitute the two-dimensional Hamming graphs.

Rook's graphs are highly symmetric, having symmetries taking every vertex to every other vertex. In rook's graphs defined from square chessboards, more strongly, every two edges are symmetric, and every pair of vertices is symmetric to every other pair at the same distance in moves (making the graph distance-transitive). For rectangular chessboards whose width and height are relatively prime, the rook's graphs are circulant graphs. With one exception, the rook's graphs can be distinguished from all other graphs using only two properties: the numbers of triangles each edge belongs to, and the existence of a unique 4-cycle connecting each nonadjacent pair of vertices. (Full article...)

General images

The following are images from various chess-related articles on Wikipedia.

Selected image

FIDE world ranking

This following chess-related articles is a most visited articles of WikiProject Chess, See complete list at Wikipedia:WikiProject Chess/Popular pages.

Did you know...

Reviewed articles

Chess from A to Z

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

Topics

Subcategories

Category puzzle
Category puzzle
Select [►] to view subcategories

Associated Wikimedia

The following Wikimedia Foundation sister projects provide more on this subject:

Sources

Discover Wikipedia using portals