It is proposed that this article be deleted because of the following concern:
If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it . ContentsThe article may be deleted if this message remains in place for seven days, i.e., after 17:19, 15 January 2019 (UTC). Nominator: Please consider notifying the author/project: {{subst:proposed deletion notify |SMIRF|concern=No sources, no evidence software meets GNG}} ~~~~ |
 | This article does not cite any sources .(July 2010) (Learn how and when to remove this template message) |
| Developer(s) | Reinhard Scharnagl |
|---|---|
| Stable release | MS-176b / December 29, 2009 |
| Operating system | Windows |
| Type | Computer chess |
| License | Shareware/Donationware |
| Website | www |
SMIRF (an acronym for Strategiespielprogramm mit intelligent rückkoppelnden Funktionen) [1] is a Windows chess game. It implements an appropriate innovative variant of an adaptive recursive feedback algorithm. The procedure effectively cuts the search tree both in depth and in width. Creating an optimally efficient chess engine is a touchstone of artificial intelligence research. Thus, this approach is associated with artificial intelligence. The creation of such software is a goal of the SMIRF project.
In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing, and automated reasoning tasks.
In computer science, a search tree is a tree data structure used for locating specific keys from within a set. In order for a tree to function as a search tree, the key for each node must be greater than any keys in subtrees on the left and less than any keys in subtrees on the right.
In computer chess, a chess engine is a computer program that analyzes chess or chess variant positions, and generates a move or list of moves that it regards as strongest. A chess engine is usually a back end with a command-line interface with no graphics nor windowing. Engines are usually used with a front end, a windowed graphical user interface such as Chessbase or WinBoard that the user can interact with via a keyboard, mouse or touchscreen. This allows the user to play against multiple engines without learning a new user interface for each, and allows different engines to play against each other.