7 kyu
Knight's tour problem on (N x M) desk
90 of 213MrKoyl
Description:
In this Kata your task is to check the possibility to solve the 'Knight's tour problem' for the desk of the current size.
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 away from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed; otherwise, it is open.
In this Kata we will think only about open tours.
Input
n, m - desk size.
0 < n < 10.
0 < m < 10.
Output
Return true if a tour exist for the current desk.
Otherwise return false
Algorithms
Similar Kata:
Stats:
| Created | Dec 3, 2020 |
| Published | Dec 3, 2020 |
| Warriors Trained | 736 |
| Total Skips | 13 |
| Total Code Submissions | 1694 |
| Total Times Completed | 213 |
| JavaScript Completions | 90 |
| C Completions | 26 |
| Haskell Completions | 15 |
| Python Completions | 92 |
| Ruby Completions | 15 |
| Total Stars | 8 |
| % of votes with a positive feedback rating | 69% of 77 |
| Total "Very Satisfied" Votes | 46 |
| Total "Somewhat Satisfied" Votes | 15 |
| Total "Not Satisfied" Votes | 16 |
| Total Rank Assessments | 9 |
| Average Assessed Rank | 7 kyu |
| Highest Assessed Rank | 6 kyu |
| Lowest Assessed Rank | 8 kyu |
