FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
cube-solver/cube.cpp at master · alan196/cube-solver · GitHub
alan196
/
cube-solver
Public
forked from
dicarlo236/cube-solver
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
cube-solver
/
cube.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
175 lines (150 loc) · 3.91 KB
Breadcrumbs
cube-solver
/
cube.cpp
Copy path
File metadata and controls
175 lines (150 loc) · 3.91 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
#
include
<
string.h
>
#
include
<
stdlib.h
>
#
include
<
stdio.h
>
#
include
<
sys/time.h
>
#
include
"
SolverConnection.h
"
#
include
"
cube.h
"
#
include
"
mbed.h
"
char
sides[] =
"
urfdlb
"
;
//
face names, lowercase, in order
char
usides[] =
"
URFDLB
"
;
//
face names, uppercase, in order
char
f_name[] =
"
"
;
//
output face name
char
solve_string[
9
*
6
+
1
];
//
output solve string
char
color_names[
6
][
10
] = {
"
blue
"
,
"
red
"
,
"
white
"
,
"
green
"
,
"
orange
"
,
"
yellow
"
};
char
ref_solve_string[] =
"
FBRUUFRRLFDDURBBRFFFDFFFLDLDBURDDRRDLLULLLBUBBLUUBDRBU
"
;
char
ref_solve_string2[] =
"
FLBRUBFBDBRUDRRDUDUULBFFBDRDRFLDFBLFLFRBLDLDRRFUUBLLUU
"
;
SolverConnection solver;
bool
valid_cube =
false
;
struct
timespec
stopa, starta;
char
* solution;
bool
get_valid
()
{
return
valid_cube;
}
void
build_solve_string
(
bool
verbose)
{
valid_cube =
true
;
printf
(
"
Build Solve String
\n
"
);
int
* f =
get_facelet_codes
();
f[
4
] =
0
;
f[
13
] =
1
;
f[
22
] =
2
;
f[
31
] =
3
;
f[
40
] =
4
;
f[
49
] =
5
;
if
(verbose)
{
//
printf("\tchecking configuration.\n");
int
sums[
6
] = {
0
,
0
,
0
,
0
,
0
,
0
};
for
(
int
i =
0
; i <
54
; i++)
{
if
(f[i] <
0
|| f[i] >
5
)
{
printf
(
"
[ERROR] facelet %d (%s) has invalid code %d
\n
"
,i,
number_to_name
(i),f[i]);
valid_cube =
false
;
}
else
sums[f[i]]++;
}
for
(
int
i =
0
; i <
6
; i++)
{
if
(sums[i] !=
9
)
{
printf
(
"
[ERROR] found %d of color %d (%s)
\n
"
,sums[i],i,color_names[i]);
valid_cube =
false
;
}
}
}
if
(valid_cube)
{
for
(
int
i =
0
; i <
54
; i++)
solve_string[i] = usides[f[i]];
solve_string[
54
] =
0
;
printf
(
"
\t
solve string: %s
\n
"
,solve_string);
}
else
{
printf
(
"
\t
got invalid cube, using reference string: %s
\n
"
,ref_solve_string);
strcpy
(solve_string,ref_solve_string);
}
}
void
init_solver
()
{
solver.
initConnection
(
9090
);
//
char* soln = solver.solve(ref_solve_string2);
//
printf("Test solve solution: %s\n",soln);
//
string_to_sequence(soln);
//
print_sequence();
}
void
init_solver2
()
{
solver.
initConnection
(
9090
);
}
void
start_solve_timer
()
{
clock_gettime
(
CLOCK_MONOTONIC_RAW
,&starta);
}
char
*
get_solution
()
{
solution = solver.
solve
(solve_string);
clock_gettime
(
CLOCK_MONOTONIC_RAW
,&stopa);
uint64_t
us = (stopa.
tv_sec
- starta.
tv_sec
) *
1000000
+ (stopa.
tv_nsec
- starta.
tv_nsec
) /
1000
;
printf
(
"
time: %f ms
\n
"
,((
float
)us)/
1000
.
f
);
printf
(
"
solution string: %s
\n
"
,solution);
return
solution;
}
//
convert facelet name to number
int
name_to_number
(
char
* name)
{
//
check length
int
len =
strlen
(name);
if
(len !=
2
)
{
printf
(
"
name_to_number: length is %d, expected 2.
\n
"
,len);
return
-
1
;
}
//
coordinate 1: side
int
c1 = -
1
;
for
(
int
i =
0
; i <
6
; i++)
if
((name[
0
]|
0x20
) == sides[i])
//
the 0x20 sets the lowercase bit
c1 = i;
if
(c1 == -
1
)
{
printf
(
"
name_to_number: first character was %c/%c. unrecognized.
\n
"
,name[
0
],name[
0
]|
0x20
);
return
-
1
;
}
//
coordinate 2: facelet
int
c2 =
atoi
(name+
1
);
if
(c2 <
0
|| c2 >
8
)
{
printf
(
"
name_to_number: second character was %c. unrecognized.
\n
"
,name[
1
]);
return
-
1
;
}
return
c2 + c1*
9
;
}
char
*
number_to_name
(
int
facelet)
{
//
check if in range
if
(facelet <
0
|| facelet >
53
)
{
f_name[
0
] =
'
)
'
;
f_name[
1
] =
'
;
'
;
return
f_name;
}
//
c2 is remainder, c1 is quotient
int
c2 = facelet;
while
(c2 >
8
) c2-=
9
;
int
c1 = (facelet - c2)/
9
;
f_name[
0
] = usides[c1];
f_name[
1
] = c2 +
0x30
;
return
f_name;
}
void
test_facelet_functions
()
{
for
(
int
i =
0
; i <
54
; i++)
{
number_to_name
(i);
int
r =
name_to_number
(f_name);
if
(r != i)
printf
(
"
FAIL i = %d
\n
"
,i);
}
}
Back
|
FazBrowse Home
|
New Git URL