A puzzle solving game for TDE
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.
 
 
Michele Calgaro 05f4fb4e74 Translated using Weblate (Italian)
Currently translated at 100.0% (18 of 18 strings)

Translation: applications/tdeknighttour
Translate-URL: https://mirror.git.trinitydesktop.org/weblate/projects/applications/tdeknighttour/it/
5 months ago
icons initial commit to move the project into a separated directory 5 months ago
src Replace TRUE/FALSE with boolean values true/false 5 months ago
translations Translated using Weblate (Italian) 5 months ago
.gitignore Initial commit 5 months ago
AUTHORS initial commit to move the project into a separated directory 5 months ago
CMakeL10n.txt Fix up cmake files and add translations 5 months ago
CMakeLists.txt Fix up cmake files and add translations 5 months ago
COPYRIGHT initial commit to move the project into a separated directory 5 months ago
ConfigureChecks.cmake Fix up cmake files and add translations 5 months ago
README.md rename README to README.md 5 months 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