Question- On a 3 x 4 chessboard there are 3 black knights (B B B) and three white knights (W W W). Exchange knights in the minimum number of turns (hint: use graph representation).
B B B W W W
0 0 0 min # of turns 0 0 0
0 0 0 =============> 0 0 0
W W W B B B
Please make sure it compiles and write the full program to get full credit. Thank you so much for your help.