|
Nemesis (draughts Player)
{{unreferenced, date=October 2010 Nemesis is an English draughts program by Murray Cash. Today Nemesis is no longer commercially available; development stopped years ago. Nemesis was the strongest program in 2002, when it won the British computer championship against Wyllie, a 16-game match ending +5 =11 in favor of Nemesis and the Computer Checkers World Championship played out in Las Vegas. The World Championship was a tournament featuring Nemesis, Cake and KingsRow. Each program played each of the others 24 times. The final scores were: #Nemesis 24.5 points (+1 =47 -0, 1 win against Cake) #KingsRow 24 points (+1 =46 -1, 1 win and 1 loss against Cake) #Cake 23.5 Points (+1 =45 -2, 1 win against KingsRow, 1 loss each against Nemesis and Kingsrow) Nemesis used its own 8-piece endgame tablebase 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, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
English Draughts
English draughts (British English) or checkers (American English), also called straight checkers or simply draughts, is a form of the strategy board game checkers (or draughts). It is played on an 8×8 checkerboard with 12 pieces per side. The pieces move and capture diagonally forward, until they reach the opposite end of the board, when they are crowned and can thereafter move and capture both backward and forward. As in all forms of draughts, English draughts is played by two opponents, alternating turns on opposite sides of the board. The pieces are traditionally black, red, or white. Enemy pieces are captured by jumping over them. The 8×8 variant of draughts was weakly solved in 2007 by a team of Canadian computer scientists led by Jonathan Schaeffer. From the standard starting position, both players can guarantee a draw with perfect play. Pieces Though pieces are traditionally made of wood, now many are made of plastic, though other materials may be used. Pieces are t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
KingsRow
KingsRow is a strong checkers and draughts engine. It was released by Ed Gilbert in 2000. The checkers engine can be used with the CheckerBoard GUI. The engine is available as freeware. History In the only Computer Checkers World Championship, KingsRow took second place behind Nemesis. KingsRow was stronger than Cake++ in the early years. Cake++ finally caught up with KingsRow and gradually became stronger. It competed a 624-game match against Cake++ on Thanksgiving 2004; Cake++ won 3 to 1, with 620 games ending in a draw. On July 17, 2005, Ed Gilbert completed building a 10-piece endgame database 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 analysin ... for use with KingsRow. A version for Italian checkers with a nine-piece endgame tablebase is available, too. Draughts version A 10 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Endgame Tablebase
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. Typically the database records each possible position with certain pieces remaining on the board, and the best moves with White to move and with Black to move. Tablebases are generated by retrograde analysis, working backward from a checkmated position. By 2005, all chess positions with up to six pieces, including the two kings, had been solved. By August 2012, tablebases had solved chess for almost every position with up to seven pieces, but the positio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
