Chess problem: Difference between revisions
purpose |
No edit summary |
||
Line 1: | Line 1: | ||
A '''Chess problem''' is a position in [[chess]] that is used as a teaching tool or a [[brain teaser]]. |
A '''Chess problem''' is a position in [[chess]] that is used as a teaching tool or a [[brain teaser]]. There is a collection of [[chess problems]] on the [[wikipedia|wiki]]. |
||
The problem does not have to be a position that can be reached during normal gameplay. One such example is the famous [[Knight's Tour]] which is a chess problem in which the [[Knight (chess)|Knight]] must reach every square on the board in the least number of moves. |
The problem does not have to be a position that can be reached during normal gameplay. One such example is the famous [[Knight's Tour]] which is a chess problem in which the [[Knight (chess)|Knight]] must reach every square on the board in the least number of moves. |
Revision as of 22:31, 28 March 2003
A Chess problem is a position in chess that is used as a teaching tool or a brain teaser. There is a collection of chess problems on the wiki.
The problem does not have to be a position that can be reached during normal gameplay. One such example is the famous Knight's Tour which is a chess problem in which the Knight must reach every square on the board in the least number of moves.
Chess problems that are based on positions that could be reached during normal gameplay are commonly used as teaching tools. Opening position and middle game problems are those in which a person must find a single tactical move that will give one side a significant advantage or a win. Endgame positions are used to challenge a player to solve a variety of common positions that occur at the end of a chess game when most of the pieces are removed from the board. The purpose of these teaching problems is to help a player to see advantageous and winning strategies.