A chess variant is a game related to, derived from, or inspired by chess. Such variants can differ from chess in many different ways.
"International" or "Western" chess itself is one of a family of games which have related origins and could be considered variants of each other. Chess developed from chaturanga, from which other members of this family, such as ouk chatrang, shatranj, Tamerlane chess,
shogi, and xiangqi also evolved.
Many chess variants are designed to be played with the equipment of regular chess. Most variants have a similar public-domain status as their parent game, but some have been made into commercial proprietary games. Just as in traditional chess, chess variants can be played over the board, by correspondence, or by computer. Some internet chess servers facilitate the play of some variants in addition to orthodox chess.
In the context of chess problems, chess variants are called heterodox chess or fairy chess. Fairy chess variants tend to be created for problem composition rather than actual play.
There are thousands of known chess variants (see list of chess variants). The Classified Encyclopedia of Chess Variants catalogues around two thousand, with the preface noting that—since creating a chess variant is relatively trivial—many were considered insufficiently notable for inclusion.
History of chess
The origins of the chess family of games can be traced to the game of chaturanga during the time of the Gupta Empire in India. Over time, as the game spread geographically, modified versions of the rules became popular in different regions. In Sassanid Persia, a slightly modified form became known as shatranj. Modifications made to this game in Europe resulted in the modern game. Courier chess was a popular variant in medieval Europe, which had a significant impact on the "main" variant's development.
Other games in the chess family, such as shogi (Japan), xiangqi (China),
and ouk chatran (Cambodian) are also developments from chaturanga made in other regions.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Since 2010 approaches in deep learning have revolutionized fields as diverse as computer vision, machine learning, or artificial intelligence. This course gives a systematic introduction into influent
Robert James Fischer (March 9, 1943 January 17, 2008) was an American chess grandmaster and the eleventh World Chess Champion. A chess prodigy, he won his first of a record eight US Championships at the age of 14. In 1964, he won with an 11–0 score, the only perfect score in the history of the tournament. Qualifying for the 1972 World Championship, Fischer swept matches with Mark Taimanov and Bent Larsen by 6–0 scores. After another qualifying match against Tigran Petrosian, Fischer won the title match against Boris Spassky of the USSR, in Reykjavík, Iceland.
Portable Game Notation (PGN) is a standard plain text format for recording chess games (both the moves and related data), which can be read by humans and is also supported by most chess software. PGN was devised around 1993, by Steven J. Edwards, and was first popularized and specified via the Usenet newsgroup rec.games.chess. PGN is structured "for easy reading and writing by human users and for easy parsing and generation by computer programs." The chess moves themselves are given in algebraic chess notation using English initials for the pieces.
An endgame tablebase is a computerized database that contains precalculated exhaustive analysis of chess endgame positions. It is typically used by a computer chess engine during play, or by a human or computer that is retrospectively analysing a game that has already been played. The tablebase contains the game-theoretical value (win, loss, or draw) in each possible position, and how many moves it would take to achieve that result with perfect play. Thus, the tablebase acts as an oracle, always providing the optimal moves.
Reinforcement learning is a type of supervised learning, where reward is sparse and delayed. For example in chess, a series of moves is made until a sparse reward (win, loss) is issued, which makes it impossible to evaluate the value of a single move. Stil ...
With the technological evolution of digital acquisition and storage technologies, millions of images and video sequences are captured every day and shared in online services. One way of exploring this huge volume of images and videos is through searching a ...
A computer program called GenOVa, written in Python, calculates the orientational variants, the operators (special types of misorientations between variants) and the composition table associated with a groupoid structure. The variants can be represented by ...