Introduction - If you have any usage issues, please Google them yourself
Given two matrices 4 × 4 grid graph A and B, the color of each box is black or white. A graphic black and white box and graphics B equal to the total. Through the exchange of the color of the adjacent square. Try to design an algorithm to calculate how many steps need to transform at least, to transform the graphic A graphic B