Folks, I'm stumped... I need help with the following: Given - Two completed suduko puzzles A (correct answer) and R (unknown result). Question: What is the fewest number of checks that can be made to prove that A = R for the following assumptions: Assumption1 Assume that in R, no sub area has any duplicate numbers (ie, 1-9 inclusive) Assumption2 Assume that in R, no row has any duplicate numbers (can also be proven using columns instead of rows. Also - prove true or false When A = R, the diagonals will always include at least 1 duplicate number Write...