|
Kaissa (fictional Game)
Kaissa (russian: Каисса) was a chess program developed in the Soviet Union in the 1960s. It was named so after Caissa, the goddess of chess. Kaissa became the first world computer chess champion in 1974 in Stockholm. History By 1967, a computer program by Georgy Adelson-Velsky, Vladimir Arlazarov, Alexander Bitman and Anatoly Uskov on the M-2 computer in Alexander Kronrod’s laboratory at the Institute for Theoretical and Experimental Physics had defeated Kotok-McCarthy running on the IBM 7090 at Stanford University. By 1971, Mikhail Donskoy joined with Arlazarov and Uskov to program its successor on an ICL System 4/70 at the Institute of Control Sciences. In 1972 the program played a correspondence match against readers of popular Russian newspaper, ''Komsomolskaya Pravda''. The readers won, 1½-½. It was the journalists of ''Komsomolskaya Pravda'' who gave the program its name, ''Kaissa''. Kaissa became the first world computer chess champion in 1974 in Stockholm ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chess
Chess is a board game for two players, called White and Black, each controlling an army of chess pieces in their color, with the objective to checkmate the opponent's king. It is sometimes called international chess or Western chess to distinguish it from related games, such as xiangqi (Chinese chess) and shogi (Japanese chess). The recorded history of chess goes back at least to the emergence of a similar game, chaturanga, in seventh-century India. The rules of chess as we know them 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, played by millions of people worldwide. Chess is an abstract strategy game that involves no hidden information and no use of dice or cards. It is played on a chessboard with 64 squares arranged in an eight-by-eight grid. At the start, each player controls sixteen pieces: one king, one queen, two rooks, t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chess (Northwestern University)
Chess was a pioneering chess program from the 1970s, written by Larry Atkin, David Slate and Keith Gorlen at Northwestern University. Chess ran on Control Data Corporation's line of supercomputers. Work on the program began in 1968 while the authors were graduate students at the university. The first competitive version was Chess 2.0 which gradually evolved to Chess 3.6 and was rewritten as the 4.x series. It dominated the first computer chess tournaments, such as the World Computer Chess Championship and ACM's North American Computer Chess Championship. NWU Chess adopted several innovative or neglected techniques including bitboard data structures, iterative deepening, transposition tables, and an early form of forward pruning later called futility pruning. The 4.x versions were the first programs to abandon selective search in favor of full-width fixed-depth searching. In 1976, Chess 4.5 won the Class B section of the Paul Masson American Class Championships, the first time a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Checkmate
Checkmate (often shortened to mate) is any game position in chess and other chess-like games in which a player's king is in check (threatened with ) and there is no possible escape. Checkmating the opponent wins the game. In chess, the king is never actually captured—the player loses as soon as the player's king is checkmated. In formal games, it is usually considered good etiquette to resign an inevitably lost game before being checkmated. If a player is not in check but has no legal move, then it is '' stalemate'', and the game immediately ends in a draw. A checkmating move is recorded in algebraic notation using the hash symbol "#", for example: 34.Qg3#. Examples A checkmate may occur in as few as two moves on one side with all of the pieces still on the board (as in Fool's mate, in the opening phase of the game), in a middlegame position (as in the 1956 game called the Game of the Century between Donald Byrne and Bobby Fischer), or after many moves with as few as t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rook (chess)
The rook (; ♖, ♜) is a piece in the game of chess. It may move any number of squares horizontally or vertically without jumping, and it may an enemy piece on its path; additionally, it may participate in castling. Each player starts the game with two rooks, one in each corner on their own side of the board. Formerly, the rook (from Persian رخ ''rokh''/''rukh'', meaning "chariot") was alternatively called the tower, marquess, rector, and comes (count or earl). The term "castle" is considered to be informal, incorrect, or old-fashioned. Placement and movement The white rooks start on squares a1 and h1, while the black rooks start on a8 and h8. The rook moves horizontally or vertically, through any number of unoccupied squares (see diagram). The rook cannot jump over pieces. The rook may capture an enemy piece by moving to the square on which the enemy piece stands, removing it from play. The rook also participates with the king in a special move called castling, wherein i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Duke University
Duke University is a private research university in Durham, North Carolina. Founded by Methodists and Quakers in the present-day city of Trinity in 1838, the school moved to Durham in 1892. In 1924, tobacco and electric power industrialist James Buchanan Duke established The Duke Endowment and the institution changed its name to honor his deceased father, Washington Duke. The campus spans over on three contiguous sub-campuses in Durham, and a marine lab in Beaufort. The West Campus—designed largely by architect Julian Abele, an African American architect who graduated first in his class at the University of Pennsylvania School of Design—incorporates Gothic architecture with the Duke Chapel at the campus' center and highest point of elevation, is adjacent to the Medical Center. East Campus, away, home to all first-years, contains Georgian-style architecture. The university administers two concurrent schools in Asia, Duke-NUS Medical School in Singapore (established in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Toronto
Toronto ( ; or ) is the capital city of the Canadian province of Ontario. With a recorded population of 2,794,356 in 2021, it is the most populous city in Canada and the fourth most populous city in North America. The city is the anchor of the Golden Horseshoe, an urban agglomeration of 9,765,188 people (as of 2021) surrounding the western end of Lake Ontario, while the Greater Toronto Area proper had a 2021 population of 6,712,341. Toronto is an international centre of business, finance, arts, sports and culture, and is recognized as one of the most multicultural and cosmopolitan cities in the world. Indigenous peoples have travelled through and inhabited the Toronto area, located on a broad sloping plateau interspersed with rivers, deep ravines, and urban forest, for more than 10,000 years. After the broadly disputed Toronto Purchase, when the Mississauga surrendered the area to the British Crown, the British established the town of York in 1793 and later designat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
2nd Computer Olympiad
The Computer Olympiad is a multi-games event in which computer programs compete against each other. For many games, the Computer Olympiads are an opportunity to claim the "world's best computer player" title. First contested in 1989, the majority of the games are board games but other games such as Contract bridge, bridge take place as well. In 2010, several puzzles were included in the competition. History Developed in the 1980s by David Levy (chess), David Levy, the first Computer Olympiad took place in 1989 at the Park Lane Hotel in London. The games ran on a yearly basis until after the 1992 games, when the Olympiad's ruling committee was unable to find a new organiser. This resulted in the games being suspended until 2000 when the Mind Sports Olympiad resurrected them. Recently, the International Computer Games Association (ICGA) has adopted the Computer Olympiad and tries to organise the event on an annual basis. Games contested The games which have been contested ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
IBM PC Compatible
IBM PC compatible computers are similar to the original IBM PC, XT, and AT, all from computer giant IBM, that are able to use the same software and expansion cards. Such computers were referred to as PC clones, IBM clones or IBM PC clones. The term "IBM PC compatible" is now a historical description only, since IBM no longer sells personal computers after it sold its personal computer division in 2005 to Chinese technology company Lenovo. The designation "PC", as used in much of personal computer history, has not meant "personal computer" generally, but rather an x86 computer capable of running the same software that a contemporary IBM PC could. The term was initially in contrast to the variety of home computer systems available in the early 1980s, such as the Apple II, TRS-80, and Commodore 64. Later, the term was primarily used in contrast to Apple's Macintosh computers. These "clones" duplicated almost all the significant features of the original IBM PC architectures. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linz
Linz ( , ; cs, Linec) is the capital of Upper Austria and third-largest city in Austria. In the north of the country, it is on the Danube south of the Czech border. In 2018, the population was 204,846. In 2009, it was a European Capital of Culture. Geography Linz is in the centre of Europe, lying on the Paris–Budapest west–east axis and the Malmö–Trieste north–south axis. The Danube is the main tourism and transport connection that runs through the city. Approximately 29.27% of the city's wide area is grassland. A further 17.95% are covered with forest. All the rest areas fall on water (6.39%), traffic areas and land. Districts Since January 2014 the city has been divided into 16 statistical districts: Before 2014 Linz was divided into nine districts and 36 statistical quarters. They were: #Ebelsberg #Innenstadt: Altstadtviertel, Rathausviertel, Kaplanhofviertel, Neustadtviertel, Volksgartenviertel, Römerberg-Margarethen #Kleinmünchen: Kleinmünchen, Neue ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Chess
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 master or higher are available on hardware from supercomputers to smart phones. Standalone chess-playing machines are also available. Stockfish, 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Null-move Heuristic
In computer chess programs, the null-move heuristic is a heuristic (computer science), heuristic technique used to enhance the speed of the alpha-beta pruning search algorithm, algorithm. Rationale Alpha-beta pruning speeds the minimax algorithm by identifying ''cutoffs'', points in the game tree where the current position is so good for the side to move that best play by the other side would have avoided it. Since such positions could not have resulted from best play, they and all branches of the game tree stemming from them can be ignored. The faster the program produces cutoffs, the faster the search runs. The null-move heuristic is designed to guess cutoffs with less effort than would otherwise be required, whilst retaining a reasonable level of accuracy. The null-move heuristic is based on the fact that most reasonable chess moves improve the position for the side that played them. So, if the player whose turn it is to move can forfeit the right to move (or make a null mo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pruning (algorithm)
Pruning is a data compression technique in machine learning and search algorithms that reduces the size of decision trees by removing sections of the tree that are non-critical and redundant to classify instances. Pruning reduces the complexity of the final classifier, and hence improves predictive accuracy by the reduction of overfitting. One of the questions that arises in a decision tree algorithm is the optimal size of the final tree. A tree that is too large risks overfitting the training data and poorly generalizing to new samples. A small tree might not capture important structural information about the sample space. However, it is hard to tell when a tree algorithm should stop because it is impossible to tell if the addition of a single extra node will dramatically decrease error. This problem is known as the horizon effect. A common strategy is to grow the tree until each node contains a small number of instances then use pruning to remove nodes that do not provide ad ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
