Hello,

I am new to programming, and I need help on a project for school.

Our goal is to create a sudoku solver in java, it is to be able to either solve for 1, 2, or 3 missing values only. The missing values are marked as zeroes. My professor wants us to count the zeroes, and solve them accordingly. It is important to note that for two missing zeroes, they are either ontop of each other vertically or horizontally next to each other. And for the three missing zeroes, they are next to each other in an L shape:

0 0 0 0 0 0 0

0 0 0 0 0

After finding the solution, print out the solution with the location of the missing zero. (Row, Col, and Solution)

if there are more than one zero missing it would look like this: (r, c, s) (r, c, s)

The program prints out END when it reaches a 9x9 of all zeroes.

Keep in mind this is supposed to take in as how ever many 9x9s my professor throw at us.

Thank you.