Nine Knights: Difference between revisions
Jump to navigation
Jump to search
imported>Kmk21 No edit summary |
imported>Kmk21 No edit summary |
||
| Line 5: | Line 5: | ||
[[Category:ICPC Problems]] | [[Category:ICPC Problems]] | ||
[[Category:Mcpc2017]] | [[Category:Mcpc2017]] | ||
[[Category:Scusa2017]] | |||
[[Category:Algorithm Trivial]] | [[Category:Algorithm Trivial]] | ||
[[Category:Implementation Trivial]] | [[Category:Implementation Trivial]] | ||
[[Category:Grid]] | [[Category:Grid]] | ||
[[Category:Brute Force]] | [[Category:Brute Force]] | ||
Latest revision as of 20:37, 29 December 2017
This problem gives us 9 knights on a 5x5 chess board and asks whether any knight can capture any other in 1 move.
This problem is trivial and involves simply checking each of the 8 possible moves for each knight.