-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathgenerator.py
53 lines (46 loc) · 1.52 KB
/
generator.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
from random import randint
# local import
try:
from solver.solver import Solver
except ImportError:
# for tests purposes
from src.solver.solver import Solver
class Generator:
"""Random valid Sudoku board generator"""
def __init__(self):
self.__solver = Solver()
def generate(self) -> list:
"""Generate valid random Sudoku board
:returns: valid Sudoku board
:rtype: list
"""
# fill random position with random value
b = [[0 for r in range(9)] for c in range(9)]
b[randint(0, 8)][randint(0, 8)] = randint(1, 9)
# 40%(32) to 60%(48) unempty squares (random value)
unempty = randint(32, 48)
# random postions list
ranpos = []
# get random positions
counter = 0
while counter <= unempty:
# get random row and random column
r, c = randint(0, 8), randint(0, 8)
# check for repeated values
if (r, c) not in ranpos:
ranpos.append((r, c))
counter += 1
# sovle the board
self.__solver.solve(b)
# apply solution in random positions
b2 = [[] for i in range(9)]
# iterate overall rows
for r in range(9):
# iterate overall columns
for c in range(9):
# check if (r, c) position in random positions list
if (r, c) in ranpos:
b2[r].append(b[r][c])
else:
b2[r].append(0)
return b2