Problem : Finding minimum knights needed to cover a NxN chess board.
NxN chess board has NxN squares which i numbered from 0 to NxN - 1. I've defined the following predicates.
allKnightsAttack(N, KnightsList, AttackedSquaresList)
this predicate gives Attacked Squares List.
Example:
if N =...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.