In this lab you will write a backtracking algorithm to solve a simple puzzle that is

similar to sudoku. in "simpledoku" you have to fill an empty square grid of n x n

cells, with each cell getting one of the digits 1 through n. a number may not be

repeated in any row, in any column, in the long top-left-to-bottom-right diagonal, or

in the long top-right-to-bottom-left diagonal. try it on paper first. you’ll find that the

4x4 puzzle is very easy, but things get harder as the grid gets bigger. many students

report the 6x6 is harder than they expected, but 7x7 is easier than 6x6.

assignment:

1) create an enum, called evaluation, that defines 3 constants:

accept, abandon, and continue (just like the example in

lecture).