The problem statement is "Given a board of N(1<=N=3) rows and M(1<=M<=50) columns, place the minimum number of knights such that every cell either contains a knight or is attacked by at least one knights." 1<=T<=150 test cases

Link :- https://www.codechef.com/problems/KNICOV

I am having a hard time figuring out the states of the DP and transitions between them. Can someone please explain in detail how to go about solving this?