Rework how potential solutions are presented.

solver/processing.go

@@ -16,6 +16,9 @@ func (solver *Solver) populate_blocks() {
 	solver.find_blocks(&solver.row7, &solver.row7s)
 	solver.find_blocks(&solver.row8, &solver.row8s)
 	solver.find_blocks(&solver.row9, &solver.row9s)
+
+	// This calculates and stores the total number of solutions to validate.
+	solver.iter = int64(len(solver.row1s)) * int64(len(solver.row2s)) * int64(len(solver.row3s)) * int64(len(solver.row4s)) * int64(len(solver.row5s)) * int64(len(solver.row6s)) * int64(len(solver.row7s)) * int64(len(solver.row8s)) * int64(len(solver.row9s))
 }
 
 func (solver *Solver) find_blocks(row *string, rows *[]int) {

solver/solver.go

@@ -22,8 +22,8 @@ func Run() {
 	// Find rows that fit with the entered rows
 	solver.populate_blocks()
 
-	solver.iter = int64(len(solver.row1s)) * int64(len(solver.row2s)) * int64(len(solver.row3s)) * int64(len(solver.row4s)) * int64(len(solver.row5s)) * int64(len(solver.row6s)) * int64(len(solver.row7s)) * int64(len(solver.row8s)) * int64(len(solver.row9s))
-	fmt.Println("Number of iterations:", solver.iter)
+	// Print the total number of solutions to validate
+	fmt.Println("Number of solutions:", solver.iter)
 
 	solver.check_combinations()