-
Notifications
You must be signed in to change notification settings - Fork 0
/
sq1.py
204 lines (176 loc) · 6.82 KB
/
sq1.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
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
195
196
197
198
199
200
201
202
203
204
# CubingB, copyright 2022 Zach Wegner
#
# This file is part of CubingB.
#
# CubingB is free software: you can redistribute it and/or modify it under the
# terms of the GNU Affero General Public License as published by the Free
# Software Foundation, either version 3 of the License, or (at your option) any
# later version.
#
# CubingB is distributed in the hope that it will be useful, but WITHOUT ANY
# WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
# A PARTICULAR PURPOSE. See the GNU Affero General Public License for more
# details.
#
# You should have received a copy of the GNU Affero General Public License
# along with CubingB. If not, see <https://www.gnu.org/licenses/>.
import math
import random
from util import PuzzleDefs, ScrambleType
[W, Y, R, O, G, B] = range(6)
PIECES = [(Y, R, B), (Y, B), (Y, B, O), (Y, O), (Y, O, G), (Y, G), (Y, G, R), (Y, R),
(W, O, B), (W, B), (W, B, R), (W, R), (W, R, G), (W, G), (W, G, O), (W, O)]
TOP = [0, None, 1, 2, None, 3, 4, None, 5, 6, None, 7]
BOTTOM = [8, None, 9, 10, None, 11, 12, None, 13, 14, None, 15]
# Rotate the pieces in one layer
def rotate(l, n):
assert -12 <= n <= 12
return (l * 3)[12 - n:24 - n]
class Square1:
def __init__(self, top=TOP, bottom=BOTTOM, flipped=False):
self.top = top
self.bottom = bottom
self.flipped = flipped
# Rotate top layer by t, bottom layer by b, and optionally slice
def move(self, t, b, slice=True):
top = rotate(self.top, t)
bottom = rotate(self.bottom, b)
if slice:
if (top[0] is None or top[6] is None or
bottom[5] is None or bottom[11] is None):
return False
self.top = top[:6] + bottom[5:11]
self.bottom = bottom[:5] + top[6:] + bottom[11:]
self.flipped = not self.flipped
else:
self.top = top
self.bottom = bottom
return True
def run_alg(self, moves):
if isinstance(moves, str):
moves = parse_alg(moves)
for [t, b, slice] in moves:
self.move(t, b, slice=slice)
def check_top_rot(self, rot):
return (self.top[-rot % 12] is not None and
self.top[(-rot + 6) % 12] is not None)
def check_bottom_rot(self, rot):
return (self.bottom[(-rot + 5) % 12] is not None and
self.bottom[(-rot + 11) % 12] is not None)
SOLVED_SQ1 = Square1()
def parse_alg(moves):
try:
# Dumb hack alert! For parsing simplicity, add another character after
# the slashes that we can split on. This is basically to make parsing the
# final move (which might or might not have a slice) easier
moves = moves.replace('/', '/`')
result = []
for move in moves.split('`'):
if not move:
continue
slice = move.endswith('/')
move = move.replace('/', '')
[t, b] = move.split(',')
t = int(t)
b = int(b)
assert (t or b) and -6 <= t <= 6 and -6 <= b <= 6
result.append((t, b, slice))
return result
except Exception:
return None
class PuzzleDefsSq1(PuzzleDefs):
SCRAMBLE_MOVES_SQ1 = 15
def supported_scrambles(self):
return [ScrambleType.RANDOM_MOVES,
ScrambleType.ENTER_SCRAMBLE, ScrambleType.HAND_SCRAMBLE]
def gen_random_moves(self):
moves = []
cube = Square1()
length = self.SCRAMBLE_MOVES_SQ1
for i in range(length):
tops = [i for i in range(12) if cube.check_top_rot(i)]
bottoms = [i for i in range(12) if cube.check_bottom_rot(i)]
tb = [(t, b) for t in tops for b in bottoms if (t, b) != (0, 0)]
[top, bottom] = random.choice(tb)
cube.move(top, bottom)
moves.append(((top + 5) % 12 - 5, (bottom + 5) % 12 - 5,
True if i < length-1 else bool(random.randrange(2))))
return moves
def parse_scramble(self, scramble):
return parse_alg(scramble)
def alg_list(self, moves):
result = []
for [t, b, slice] in moves:
result.append('%s,%s%s' % (t, b, '/' if slice else ''))
return result
def alg_str(self, moves):
return ''.join(self.alg_list(moves))
def html_spacer(self):
# Zero-width space
return '​'
def gen_diagram(self, scramble):
cube = Square1()
cube.run_alg(scramble)
return gen_sq1_diagram(cube)
################################################################################
## SVG rendering stuff #########################################################
################################################################################
SVG_COLORS = {
'w': '#fff',
'y': '#222', # All the cool kids use white/black, not white/yellow
'r': '#d00',
'o': '#f92',
'g': '#0b0',
'b': '#00f',
'-': '#777',
}
COLOR_MAP = 'wyrogb'
# How far to stretch the xy points to render the sides of pieces
STRETCH = 1.4
# Some geometry for rendering a square-1 diagram
LENGTH = 1 / math.cos(math.radians(15))
P1 = LENGTH * math.sin(math.radians(15))
R2 = LENGTH * 2 ** .5 / 2
def gen_sq1_diagram(sq1):
def gen_path(points, rot, color):
color = SVG_COLORS[COLOR_MAP[color]]
path = 'M%sz' % 'L'.join('%s %s' % xy for xy in points)
return f'''<path d="{path}" fill="{color}" stroke="black"
transform="rotate({rot})" stroke-width=".02" />'''
def gen_layer(layer):
for [i, p] in enumerate(layer):
if p is None:
continue
piece = PIECES[p]
# Render top piece
if len(piece) == 3:
points = [(0, 0), (-P1, 1), (-1, 1), (-1, P1)]
else:
points = [(0, 0), (-P1, 1), (-R2, R2)]
yield gen_path(points, i*30, piece[0])
# Stretch endpoints of top piece to render sides
stretched = [(x * STRETCH, y * STRETCH) for [x, y] in points]
for j in range(1, len(points) - 1):
p = points[j:j+2] + stretched[j+1:j-1:-1]
yield gen_path(p, i*30, piece[j])
# Generate top/bottom layers
layer_1 = '\n'.join(gen_layer(sq1.top))
layer_2 = '\n'.join(gen_layer(sq1.bottom))
# Generate middle
s = 1 - P1
s2 = 2 - s if not sq1.flipped else s
middle_l = gen_path([(0, 0), (0, s), (s, s), (s, 0)], 0, R)
middle_r = gen_path([(0, 0), (0, s), (s2, s), (s2, 0)], 0,
O if sq1.flipped else R)
return f'''<svg viewBox='-2.5 -2.5 10 5'>
{layer_1}
<g transform="translate(5, 0)">
{layer_2}
</g>
<g transform="translate({2.5-s}, {2.2-s})">
{middle_l}
</g>
<g transform="translate(2.5, {2.2-s})">
{middle_r}
</g>
</svg>'''