Faster access than browser!
46 relations: Alice Chess, Almost Chess, Alpha–beta pruning, Angel problem, Baroque chess, Berolina chess, Cache (computing), Capablanca Chess, Check (chess), Chess, Chess engine, Chess piece, Chess with different armies, Chess960, Computer chess, Computer program, Courier chess, Cylinder chess, Embassy Chess, Extinction chess, Fairy-Max, Free software, GNU General Public License, Grand Chess, Hash table, Heuristic, Iterative deepening depth-first search, Janus chess, Killer heuristic, King (chess), Lazy evaluation, List of chess software, List of chess variants, Los Alamos chess, Makruk, Microsoft Windows, Negamax, Null-move heuristic, Omega Chess, Pawn (chess), Search algorithm, Shatranj, Tamerlane chess, Three-check chess, Transposition table, V. R. Parton.
Alice Chess
Alice Chess is a chess variant invented in 1953 by V. R. Parton which employs two chessboards rather than one, and a slight (but significant) alteration to the standard rules of chess.
New!!: ChessV and Alice Chess · See more »
Almost Chess
Almost Chess is a chess variant invented by Ralph Betza in 1977.
New!!: ChessV and Almost Chess · See more »
Alpha–beta pruning
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.
New!!: ChessV and Alpha–beta pruning · See more »
Angel problem
The angel problem is a question in combinatorial game theory proposed by John Horton Conway.
New!!: ChessV and Angel problem · See more »
Baroque chess
Baroque chess is a chess variant invented in 1962 by Robert Abbott.
New!!: ChessV and Baroque chess · See more »
Berolina chess
Berolina chess is a chess variant using a popular fairy chess piece called the Berolina pawn (also known as Berlin pawn or Anti-pawn).
New!!: ChessV and Berolina chess · See more »
Cache (computing)
In computing, a cache, is a hardware or software component that stores data so future requests for that data can be served faster; the data stored in a cache might be the result of an earlier computation, or the duplicate of data stored elsewhere.
New!!: ChessV and Cache (computing) · See more »
Capablanca Chess
Capablanca Chess (or Capablanca's Chess) is a chess variant invented in the 1920s by former World Chess Champion José Raúl Capablanca.
New!!: ChessV and Capablanca Chess · See more »
Check (chess)
A check is a condition in chess, shogi, and xiangqi that occurs when a player's king (or general in xiangqi) is under threat of on their opponent's next turn.
New!!: ChessV and Check (chess) · See more »
Chess
Chess is a two-player strategy board game played on a chessboard, a checkered gameboard with 64 squares arranged in an 8×8 grid.
New!!: ChessV and Chess · See more »
Chess engine
In computer chess, a chess engine is a computer program that analyses chess or chess variant positions and makes decisions on the best chess moves.
New!!: ChessV and Chess engine · See more »
Chess piece
A chess piece, or chessman, is any of the six different movable objects used on a chessboard to play the game of chess.
New!!: ChessV and Chess piece · See more »
Chess with different armies
Chess with different armies (or Betza's Chess or Equal Armies) is a chess variant invented by Ralph Betza in 1979.
New!!: ChessV and Chess with different armies · See more »
Chess960
Chess960, also called Fischer Random Chess (originally Fischerandom), is a variant of chess invented and advocated by former world chess champion Bobby Fischer, announced publicly on June 19, 1996, in Buenos Aires, Argentina.
New!!: ChessV and Chess960 · See more »
Computer chess
Computer chess is a game of computer architecture encompassing hardware and software capable of playing chess autonomously without human guidance.
New!!: ChessV and Computer chess · See more »
Computer program
A computer program is a collection of instructions for performing a specific task that is designed to solve a specific class of problems.
New!!: ChessV and Computer program · See more »
Courier chess
Courier Chess (or The Courier Game or simply courier) is a strategy board game in the chess family.
New!!: ChessV and Courier chess · See more »
Cylinder chess
Cylinder chess (or Cylindrical chess) is a chess variant with an unusual board.
New!!: ChessV and Cylinder chess · See more »
Embassy Chess
Embassy chess is a chess variant created in 2005 by Kevin Hill.
New!!: ChessV and Embassy Chess · See more »
Extinction chess
Extinction chess is a chess variant invented by R. Wayne Schmittberger, editor of Games magazine, in 1985.
New!!: ChessV and Extinction chess · See more »
Fairy-Max
Fairy-Max is a free and open source chess engine which can play orthodox chess as well as chess variants.
New!!: ChessV and Fairy-Max · See more »
Free software
Free software or libre software is computer software distributed under terms that allow users to run the software for any purpose as well as to study, change, and distribute it and any adapted versions.
New!!: ChessV and Free software · See more »
GNU General Public License
The GNU General Public License (GNU GPL or GPL) is a widely used free software license, which guarantees end users the freedom to run, study, share and modify the software.
New!!: ChessV and GNU General Public License · See more »
Grand Chess
Grand Chess is a large-board chess variant invented by Dutch games designer Christian Freeling in 1984.
New!!: ChessV and Grand Chess · See more »
Hash table
In computing, a hash table (hash map) is a data structure that implements an associative array abstract data type, a structure that can map keys to values.
New!!: ChessV and Hash table · See more »
Heuristic
A heuristic technique (εὑρίσκω, "find" or "discover"), often called simply a heuristic, is any approach to problem solving, learning, or discovery that employs a practical method, not guaranteed to be optimal, perfect, logical, or rational, but instead sufficient for reaching an immediate goal.
New!!: ChessV and Heuristic · See more »
Iterative deepening depth-first search
In computer science, iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state space/graph search strategy in which a depth-limited version of depth-first search is run repeatedly with increasing depth limits until the goal is found.
New!!: ChessV and Iterative deepening depth-first search · See more »
Janus chess
Janus Chess is a chess variant played on a 10×8 board.
New!!: ChessV and Janus chess · See more »
Killer heuristic
In competitive two-player games, the killer heuristic is a technique for improving the efficiency of alpha-beta pruning, which in turn improves the efficiency of the minimax algorithm.
New!!: ChessV and Killer heuristic · See more »
King (chess)
In chess, the king (♔,♚) is the most important piece.
New!!: ChessV and King (chess) · See more »
Lazy evaluation
In programming language theory, lazy evaluation, or call-by-need is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (sharing).
New!!: ChessV and Lazy evaluation · See more »
List of chess software
This is a list of notable chess software (engines and/or Graphical User Interface).
New!!: ChessV and List of chess software · See more »
List of chess variants
A chess variant (or unorthodox chess) is a game "related to, derived from, or inspired by chess".
New!!: ChessV and List of chess variants · See more »
Los Alamos chess
Los Alamos chess (or Anti-clerical chess) is a chess variant played on a 6×6 board without bishops.
New!!: ChessV and Los Alamos chess · See more »
Makruk
Makruk (หมากรุก), or Thai chess, is a board game that descended from the 6th-century Indian game of chaturanga or a close relative thereof, and therefore related to chess.
New!!: ChessV and Makruk · See more »
Microsoft Windows
Microsoft Windows is a group of several graphical operating system families, all of which are developed, marketed, and sold by Microsoft.
New!!: ChessV and Microsoft Windows · See more »
Negamax
Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game.
New!!: ChessV and Negamax · See more »
Null-move heuristic
In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algorithm.
New!!: ChessV and Null-move heuristic · See more »
Omega Chess
Omega Chess is a commercial chess variant designed by Daniel MacDonald.
New!!: ChessV and Omega Chess · See more »
Pawn (chess)
The pawn (♙,♟) is the most numerous piece in the game of chess, and in most circumstances, also the weakest.
New!!: ChessV and Pawn (chess) · See more »
Search algorithm
In computer science, a search algorithm is any algorithm which solves the search problem, namely, to retrieve information stored within some data structure, or calculated in the search space of a problem domain.
New!!: ChessV and Search algorithm · See more »
Shatranj
Shatranj (شطرنج, from Middle Persian chatrang) is an old form of chess, as played in the Persian Empire.
New!!: ChessV and Shatranj · See more »
Tamerlane chess
Tamerlane Chess is a strategy board game related to chess and derived from chaturanga.
New!!: ChessV and Tamerlane chess · See more »
Three-check chess
Three-check chess is a chess variant in which the winner is the first player to check their opponent three times.
New!!: ChessV and Three-check chess · See more »
Transposition table
In computer chess and other computer games, transposition tables are used to speed up the search of the game tree.
New!!: ChessV and Transposition table · See more »
V. R. Parton
Vernon Rylands Parton (2 October 1897 – 31 December 1974) was an English chess enthusiast and prolific chess variant inventor, his most renowned variant being Alice Chess.
New!!: ChessV and V. R. Parton · See more »
Redirects here:
References
[1] https://en.wikipedia.org/wiki/ChessV
