There is a 7-by-7 square grid containing an "A" and "B" in each square, in a checkerboard pattern. You must get the board to have no palindromes in it, going horizontally or vertically, in a full row or column.
The goal is to find the least amount of turns needed to get no palindromes in a full row or column. Start with the starting grid. Then switch two squares that are right next to each other. Each switch you make counts as one turn.
Explain Your Reasoning