From e2838d89e361d6bfbf678d9a922bee602770be83 Mon Sep 17 00:00:00 2001
From: Camden Dixie O'Brien <cdo@wip.sh>
Date: Wed, 23 Nov 2022 23:46:18 +0000
Subject: [PATCH] Remove gen() function

---
 sud.c | 65 +----------------------------------------------------------
 1 file changed, 1 insertion(+), 64 deletions(-)

diff --git a/sud.c b/sud.c
index 172dfe6..f2fc105 100644
--- a/sud.c
+++ b/sud.c
@@ -44,73 +44,10 @@ bool load(struct sudoku *sud, const char *ptr)
 		if (update(sud, i / NDIGITS, i % NDIGITS, ptr[i] - '1') != OK)
 			return false;
 	}
+
 	return true;
 }
 
-static void clear(struct sudoku *sud, unsigned r, unsigned c)
-{
-	unsigned tr, tc, val;
-
-	/* Set undetermined with all possible values */
-	sud->cells[r][c].det = false;
-	for (unsigned i = 0; i < NDIGITS; ++i)
-		sud->cells[r][c].pvals[i] = true;
-
-	/* Update cell's possible values based off column. */
-	for (tr = 0; tr < NDIGITS; ++tr) {
-		if (tr == r || !sud->cells[tr][c].det)
-			continue;
-		val = sud->cells[tr][c].val;
-		sud->cells[r][c].pvals[val] = false;
-	}
-
-	/* Update possible values of cells in same row. */
-	for (tc = 0; tc < NDIGITS; ++tc) {
-		if (tc == c || !sud->cells[r][tc].det)
-			continue;
-		val = sud->cells[r][tc].val;
-		sud->cells[r][c].pvals[val] = false;
-	}
-
-	/* Update possible values of cells in same segment. */
-	const unsigned segr0 = SEGLEN * (r / SEGLEN);
-	const unsigned segc0 = SEGLEN * (c / SEGLEN);
-	for (tr = segr0; tr < segr0 + SEGLEN; ++tr) {
-		for (tc = segc0; tc < segc0 + SEGLEN; ++tc) {
-			if ((tr == r && tc == c) || !sud->cells[tr][tc].det)
-				continue;
-			val = sud->cells[tr][tc].val;
-			sud->cells[r][c].pvals[val] = false;
-		}
-	}
-}
-
-void gen(struct sudoku *sud, double fill_prop)
-{
-	/* Generate a completed sudoku. */
-retry:
-	initposs(sud);
-	for (unsigned r = 0; r < NDIGITS; ++r) {
-		for (unsigned c = 0; c < NDIGITS; ++c) {
-			unsigned val, n = 0;
-			do {
-				val = (unsigned)(rand() % NDIGITS);
-				++n;
-				if (n >= MAX_FILL_ATTEMPTS)
-					goto retry;
-			} while (update(sud, r, c, val) == NOT_ALLOWED);
-		}
-	}
-
-	/* Remove cells with probability of 1 - fill_prop. */
-	for (unsigned r = 0; r < NDIGITS; ++r) {
-		for (unsigned c = 0; c < NDIGITS; ++c) {
-			if ((double)rand() / (double)RAND_MAX < 1 - fill_prop)
-				clear(sud, r, c);
-		}
-	}
-}
-
 enum update_res update(struct sudoku *sud, unsigned r, unsigned c, unsigned val)
 {
 	unsigned tr, tc;