enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Software for handling chess problems - Wikipedia

    en.wikipedia.org/wiki/Software_for_handling...

    Natch solves retrograde analysis problems by constructing a "proof game" - the shortest possible game leading to a certain position. Natch is a command line utility, but there is a Java based graphical interface. iNatch also provides moves with fairy conditions: monochrome chess, Einstein chess, vertical cylinder.

  3. List of chess software - Wikipedia

    en.wikipedia.org/wiki/List_of_chess_software

    A chess engine generates moves, but is accessed via a command-line interface with no graphics. A dedicated chess computer has been purpose built solely to play chess. A graphical user interface (GUI) allows one to import and load an engine, and play against it. A chess database allows one to import, edit, and analyze a large archive of past games.

  4. Chess Assistant - Wikipedia

    en.wikipedia.org/wiki/Chess_Assistant

    Chess Assistant is a commercial database program produced by Convekta, Ltd. The company started in Russia, but also has offices in England and the United States. The software is a management tool for organising chess information (databases of millions of games), opening training, game analysis, playing against the computer, and viewing electronic texts.

  5. Retrograde analysis - Wikipedia

    en.wikipedia.org/wiki/Retrograde_analysis

    In chess problems, retrograde analysis is a technique employed to determine which moves were played leading up to a given position. While this technique is rarely needed for solving ordinary chess problems, there is a whole subgenre of chess problems in which it is an important part; such problems are known as retros .

  6. Proof game - Wikipedia

    en.wikipedia.org/wiki/Proof_game

    A proof game is a type of retrograde analysis chess problem.The solver must construct a game starting from the initial chess position, which ends with a given position (thus proving that that position is reachable) after a specified number of moves.

  7. Turochamp - Wikipedia

    en.wikipedia.org/wiki/Turochamp

    Turochamp simulates a game of chess against the player by accepting the player's moves as input and outputting its move in response. The program's algorithm uses a heuristic to determine the best move to make, calculating all potential moves that it can make, then all of the potential player responses that could be made in turn, as well as further "considerable" moves, such as captures of ...

  8. Kasparov's Gambit - Wikipedia

    en.wikipedia.org/wiki/Kasparov's_Gambit

    An inline glossary of chess terms; A library of 500 famous games played by past world champions; An auxiliary graphical chessboard showing the computer's analysis while playing or reviewing moves; An interactive move list; An analysis text box, showing move's elapsed time, depth, score of the best evaluated line and number of positions seek

  9. Houdini (chess) - Wikipedia

    en.wikipedia.org/wiki/Houdini_(chess)

    Maintenance update with minor bug corrections and new analysis options. MultiPV_cp option to limit multi-PV analysis to moves within a range of the best move. FiftyMoveDistance option to make the 50-move rule kick in earlier. UCI_Elo and UCI_LimitStrength options as UCI standard-compliant alternative to Strength option. Exit on detection with ...