You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Currently translated at 100.0% (18 of 18 strings) Translation: applications/tdeknighttour Translate-URL: https://mirror.git.trinitydesktop.org/weblate/projects/applications/tdeknighttour/ru/ |
1 month ago | |
|---|---|---|
| icons | 1 year ago | |
| src | 12 months ago | |
| translations | 1 month ago | |
| .gitignore | 1 year ago | |
| AUTHORS | 1 year ago | |
| CMakeL10n.txt | 1 year ago | |
| CMakeLists.txt | 1 year ago | |
| COPYRIGHT | 1 year ago | |
| ConfigureChecks.cmake | 3 months ago | |
| README.md | 1 year ago | |
README.md
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed (or re-entrant); otherwise, it is open.
For more information: https://en.wikipedia.org/wiki/Knight%27s_tour