rcuber 0.7.20

crate for rubiks cube and solver (LBL, CFOP, Roux, min2phase)
Documentation 
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

use crate::cubie::Edge::{self, *};
use crate::solver::lbl::get_put_move;
use crate::{
    cubie::CubieCube,
    moves::Move::{self, *},
};

/// MiddleEdgeSolver for LBL(Layer by Layer) method, i.e, solve four middle layer edges(FR, FL, BL, BR).
/// # Example
/// ```rust
/// use rcuber::cubie::CubieCube;
/// use rcuber::moves::Formula;
/// use rcuber::solver::lbl::cross::CrossSolver;
/// use rcuber::solver::lbl::bottom::BottomCornerSolver;
/// use rcuber::solver::lbl::middle::MiddleEdgeSolver;
///
/// fn main() {
///     let cc = CubieCube::default();
///     let moves = Formula::scramble();
///     let cc = cc.apply_formula(&moves);
///     let mut cross = CrossSolver::new(cc, true);
///     let _cs = cross.solve();
///     let mut bottom = BottomCornerSolver{cube: cross.cube};
///     let _bs = bottom.solve();
///     let mut middle = MiddleEdgeSolver{cube: bottom.cube};
///     let _ms = middle.solve();
///     assert!(middle.is_solved());
///     println!("Scramble: {:?}\nSolution: {:?}, {:?}, {:?}", moves, _cs, _bs, _ms);
/// }
/// ```
pub struct MiddleEdgeSolver {
    pub cube: CubieCube,
}

impl MiddleEdgeSolver {
    fn is_solved_edge(edge: (Edge, u8, u8)) -> bool {
        edge.0 as u8 == edge.1 && edge.2 == 0
    }

    fn get_sorted_edges(&self) -> Vec<((Edge, u8, u8), i32)> {
        let m_edges = get_edges_middle(&self.cube);
        let mut m_edges_sort = Vec::new();
        for edge in m_edges {
            if MiddleEdgeSolver::is_solved_edge(edge) {
                continue;
            }
            if edge.1 < 4 {
                m_edges_sort.push((edge, -1));
            } else {
                m_edges_sort.push((edge, -2));
            }
        }
        m_edges_sort.sort_by_key(|e| e.1);
        m_edges_sort
    }

    pub fn solve(&mut self) -> Vec<Move> {
        let mut solution = Vec::new();
        let mut m_edges_sort = self.get_sorted_edges();
        'edges: while m_edges_sort.len() > 0 {
            let (edge, _) = m_edges_sort.pop().unwrap();
            if edge.1 < 4 {
                for _y in 0..4 {
                    let mut y_put = get_put_move(_y, y);
                    let _cube = self.cube;
                    self.cube = self.cube.apply_moves(&y_put);
                    for i in 0..4 {
                        let mut u_put = get_put_move(i, U);
                        let _cube = self.cube;
                        self.cube = self.cube.apply_moves(&u_put);
                        for mut c_put in
                            [vec![R, U3, R3, U3, F3, U, F], vec![F3, U, F, U, R, U3, R3]]
                        {
                            let _cube = self.cube;
                            self.cube = self.cube.apply_moves(&c_put);
                            let mut y_put_r = get_put_move(_y, y3);
                            self.cube = self.cube.apply_moves(&y_put_r);
                            if MiddleEdgeSolver::is_solved_edge((
                                edge.0,
                                self.cube.ep[edge.0 as usize] as u8,
                                self.cube.eo[edge.0 as usize],
                            )) {
                                solution.append(&mut y_put);
                                solution.append(&mut u_put);
                                solution.append(&mut c_put);
                                solution.append(&mut y_put_r);
                                m_edges_sort = self.get_sorted_edges();
                                continue 'edges;
                            }
                            self.cube = _cube;
                        }
                        self.cube = _cube;
                    }
                    self.cube = _cube;
                }
            } else {
                for _y in 0..4 {
                    let mut y_put = get_put_move(_y, y);
                    let _cube = self.cube;
                    self.cube = self.cube.apply_moves(&y_put);
                    let mut c_get_put = vec![F3, U3, F, U, R, U, R3];
                    self.cube = self.cube.apply_moves(&c_get_put);
                    let mut y_put_r = get_put_move(_y, y3);
                    self.cube = self.cube.apply_moves(&y_put_r);
                    if self.cube.ep[0..4].contains(&edge.0) {
                        solution.append(&mut y_put);
                        solution.append(&mut c_get_put);
                        solution.append(&mut y_put_r);
                        m_edges_sort = self.get_sorted_edges();
                        continue 'edges;
                    }
                    self.cube = _cube;
                }
            }
            m_edges_sort = self.get_sorted_edges();
        }
        solution
    }

    /// Check if the middle layer's edge is solved.
    pub fn is_solved(&self) -> bool {
        let edges_m = get_edges_middle(&self.cube);
        let mut solved = 0;
        for edge in edges_m {
            match edge {
                (FR, 8, 0) | (FL, 9, 0) | (BL, 10, 0) | (BR, 11, 0) => solved += 1,
                _ => {}
            };
        }
        if solved == 4 {
            return true;
        }
        false
    }
}

pub fn get_edges_middle(cc: &CubieCube) -> Vec<(Edge, u8, u8)> {
    let mut edges = Vec::new();
    for edge in [FR, FL, BL, BR] {
        for i in 0..12 {
            if cc.ep[i] == edge {
                edges.push((edge, i as u8, cc.eo[i]));
            }
        }
    }
    edges
}

#[cfg(test)]
mod tests {
    use crate::{
        cubie::CubieCube,
        moves::Formula,
        solver::lbl::{bottom::BottomCornerSolver, cross::CrossSolver, middle::MiddleEdgeSolver},
    };

    #[test]
    fn test_middle_layer() {
        let cc = CubieCube::default();
        let moves = Formula::scramble();
        let cc = cc.apply_formula(&moves);
        let mut cross = CrossSolver::new(cc, true);
        let _cs = cross.solve();
        let mut bottom = BottomCornerSolver { cube: cross.cube };
        let _bs = bottom.solve();
        // let _bs = optimise_moves(&_bs);
        let mut middle = MiddleEdgeSolver { cube: bottom.cube };
        let _ms = middle.solve();
        assert!(middle.is_solved());
        // let _ms = optimise_moves(&_ms);
        println!(
            "Scramble: {:?}\nSolution: {:?}, {:?}, {:?}",
            moves, _cs, _bs, _ms
        );
    }
}