Nine Knights

From programming_contest
Revision as of 23:50, 1 December 2017 by imported>Kmk21
Jump to navigation Jump to search

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.