Problem 96. Knight's Tour Checker
Solution Stats
Problem Comments
-
4 Comments
I think several of the solutions to this problem would return a false positive on the vector [1 0 0 2].
I like this problem and I like chess.
Fantastic problem since it offers introductions to graph theory, specifically Hamiltonian path problems, time complexity, neural network solutions, and Warnsdorf's Rule. Thanks
easier than I expected
Solution Comments
-
1 Comment
quite interesting
-
1 Comment
nice solution!
-
3 Comments
wtf?
1774||ggl.it :)
interestingly, 1774-ggl == leet-ssh
-
1 Comment
should change the test suite to also include moves of 1,1 or 2,2 which this solution would not prevent...
-
1 Comment
Why bother?
Problem Recent Solvers1028
Suggested Problems
-
4795 Solvers
-
Number of 1s in a binary string
6314 Solvers
-
680 Solvers
-
720 Solvers
-
Given a square and a circle, please decide whether the square covers more area.
635 Solvers
More from this Author96
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!