NationMaster - Encyclopedia: ChessV

ChessV (short for Chess Variants) is a free program designed to play a few dozen chess variants. The developer of this program, Gregory Strong, intends to add more over time, but the stated goal of universality is probably not attainable by intensive manual programming. Of all chess variants currently supported, two of the most-played variants are probably Fischer Random Chess and Grand Chess. As of version 0.8 of this program, ChessV is capable of playing: ChessV Copyright (C) 2004 by Gregory Strong. ... ChessV Copyright (C) 2004 by Gregory Strong. ... Image File history File links Screenshot made of ChessV program, which is under GPL. This is a screenshot of copyrighted computer software. ... Image File history File links Screenshot made of ChessV program, which is under GPL. This is a screenshot of copyrighted computer software. ... Capablanca Chess is a variation on the game of chess that exists in several versions played on a board of either 10x10 or 10x8 squares. ... Free software, as defined by Richard Stallman and his Free Software Foundation, can be used, copied, studied, modified and redistributed. ... Program or Programme can refer to: a computer program a radio program, a television program a collection of managed projects a 12-step program one of the short films in The Animatrix series. ... A chess variant is any game derived from, related to or similar to chess in at least one respect. ... Fischer Random Chess (also called Chess 960, Fischerandom chess, FR chess, or FRC) is a chess variant created by Grandmaster Bobby Fischer (who was world chess champion from 1972 until 1975). ... Grand Chess is a chess variant invented by Christian Freeling. ...

with some of the variants capable of being customized in their details. Capablanca Chess is a variation on the game of chess that exists in several versions played on a board of either 10x10 or 10x8 squares. ... Cylinder chess is a variant of western Chess. ...

Engine Features

External links

Categories: Chess variants | Computer chess | Free Windows software | Open source games | Windows games In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem. ... Alpha-beta pruning is a technique to reduce the number of nodes evaluated by the minimax algorithm for two-player games. ... Negamax search is a slightly variant formulation of minimax search that relies on the zero-sum property of a two-player game. ... Iterative deepening depth-first search is a states-space search strategy, that visits each node in the search tree in the same order as depth-first search but does so by gradually increasing the maximum depth limit of the search iteratively. ... In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algorithm. ... Branch and bound is a general method for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. ... In games such as chess, shogi and xiangqi, a check is an immediate threat to capture the king. ... Heuristic is the art and science of discovery and invention. ... In computer chess, the killer heuristic is a technique for improving the efficiency of alpha-beta pruning. ... In chess, each player has one of two equivalent sets of pieces of different colors. ... The pawn (♙♟) is the weakest and most numerous piece in the game of chess, representing infantry, or more particularly pikemen. ... The king (♔♚) is a piece in the game of chess. ... In computer programming, lazy evaluation is a concept that attempts to minimize the work the computer has to do. ... In computer science, a hash table is a data structure that speeds up searching for information by a particular aspect of that information, called a key. ... In computer chess and other computer games, transposition tables are used to speed up the search of the game tree. ... In computer science, a cache (pronounced kÄƒsh) is a collection of data duplicating original values stored elsewhere or computed earlier, where the original data are expensive (usually in terms of access time) to fetch or compute relative to reading the cache. ...

Engine Features GA_googleFillSlot("encyclopedia_square");

External links

Engine Features