-
Notifications
You must be signed in to change notification settings - Fork 2
/
Weekend_Puzzle_2034.jl
194 lines (169 loc) · 4.43 KB
/
Weekend_Puzzle_2034.jl
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
return false
end
function print_board(solution_board)
print()
for i in 1:9
for j in 1:9
print(' ')
print(solution_board[i, j])
end
println()
end
println() #blank line
end
function consecutives(arr)
#returns true if there are consecutive nums in arr
for i in 1:8
if arr[i] != 0 && arr[i+1] != 0
if (arr[i+1]-arr[i]) in [1,-1]
return true
end
end
end
return false
end
function sum_consecutives(arr)
if !consecutives(arr)
return 0
end
output = 0
for i in 1:8
if (arr[i+1]-arr[i]) in [1,-1]
output += (arr[i+1]+arr[i])
return output
end
output += arr[i]
end
output
end
function check_no_conflicts(board)
for i in 1:9
thisrow = view(board,i,:)
if repeat(thisrow)
return false
end
# if consecutives(thisrow) && LEFT[i] == 0
# return false
# end
# if consecutives(reverse(thisrow)) && RIGHT[i] == 0
# return false
# end
# if sum_consecutives(thisrow) > LEFT[i]
# return false
# end
# if count(j->j==0,thisrow) == 0
# if sum_consecutives(reverse(thisrow)) > RIGHT[i]
# return false
# end
# end
if consecutives(thisrow)
if sum_consecutives(thisrow) != LEFT[i]
return false
end
end
if count(j->j==0,thisrow) == 0
if sum_consecutives(thisrow) != LEFT[i]
return false
end
if sum_consecutives(reverse(thisrow)) != RIGHT[i]
return false
end
end
thiscol = view(board, :, i)
if repeat(thiscol)
return false
end
# if consecutives(thiscol) && TOP[i] == 0
# return false
# end
# if consecutives(reverse(thiscol)) && BOTTOM[i] == 0
# return false
# end
# if sum_consecutives(thiscol) > TOP[i]
# return false
# end
# if count(j->j==0,thiscol) == 0
# if sum_consecutives(reverse(thiscol)) > BOTTOM[i]
# return false
# end
# end
if consecutives(thiscol)
if sum_consecutives(thiscol) != TOP[i]
return false
end
end
if count(j->j==0,thiscol) == 0
if sum_consecutives(thiscol) != TOP[i]
return false
end
if sum_consecutives(reverse(thiscol)) != BOTTOM[i]
return false
end
end
if repeat(quadrant(board,i))
return false
end
end
return true
end
function solve(values, safe_up_to, size)
solution_list = zeros(size)
ind = 1
for r in 1:9
for c in 1:9
if BOARD[r, c] == 0
lookup[ind] = CartesianIndex(r, c)
ind += 1
end
end
end
function extend_solution(position)
for value in values
BOARD[lookup[position]] = value
#println(BOARD)
if safe_up_to(BOARD)
if position >= size
return true
end
new_solution = extend_solution(position+1)
if new_solution
return true
end
else
BOARD[lookup[position]] = 0
if value == values[length(values)] && position > 1
BOARD[lookup[position-1]] = 0
end
if position < size
BOARD[lookup[position+1]] = 0
end
end
end
false
end
extend_solution(1)
end
function main()
#b = BOARD
blanks = count(i->(i==0),BOARD)
#print("blanks:",blanks)
if solve(1:9, check_no_conflicts, blanks)
print_board(BOARD)
else
print("solve failed to find solution")
end
end
@time main()
#=
Solution:
3 4 5 6 2 8 1 9 7
9 8 1 5 4 7 6 2 3
7 6 2 3 9 1 5 4 8
6 9 4 1 5 3 8 7 2
5 7 3 2 8 9 4 1 6
1 2 8 7 6 4 9 3 5
2 5 7 9 1 6 3 8 4
4 1 6 8 3 2 7 5 9
8 3 9 4 7 5 2 6 1
50.647787 seconds (1.02 G allocations: 84.545 GiB, 13.48% gc time)
=#