Skip to content

Melnikov_K_D_task_1 #14

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
kmelnikovmh wants to merge 2 commits into from
Closed

Melnikov_K_D_task_1 #14

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
2f7801a
Initial v1.0
kmelnikovmh Feb 4, 2026
d7e2e0d
Remove map
kmelnikovmh Feb 4, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
143 changes: 125 additions & 18 deletions src/main/java/hse/java/practice/task1/RubiksCube.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,40 +2,147 @@

import java.util.Arrays;

/**
* Необходимо реализовать интерфейс Cube
* При повороте передней грани, меняются верх низ право и лево
*/
public class RubiksCube {

private static final int EDGES_COUNT = 6;
final int EDGES_COUNT = 6;
final int FIXED_ELEM = 8;
final Edge[] edges = new Edge[EDGES_COUNT];
final int[] state = new int[EDGES_COUNT * FIXED_ELEM + 1];

private final Edge[] edges = new Edge[EDGES_COUNT];

/**
* Создать валидный собранный кубик
* грани разместить по ордеру в енуме цветов
* грань 0 -> цвет 0
* грань 1 -> цвет 1
* ...
*/
public RubiksCube() {
CubeColor[] colors = CubeColor.values();
for (int i = 0; i < 6; i++) {
for (int i = 0; i < EDGES_COUNT; ++i) {
edges[i] = new Edge(colors[i]);
}
for (int i = 1; i <= EDGES_COUNT * FIXED_ELEM; ++i) {
state[i] = i;
}
}

public void front(RotateDirection direction) {
public void front(RotateDirection dir) { rotate(Face.FRONT, dir); }
public void back(RotateDirection dir) { rotate(Face.BACK, dir); }
public void left(RotateDirection dir) { rotate(Face.LEFT, dir); }
public void right(RotateDirection dir) { rotate(Face.RIGHT, dir); }
public void up(RotateDirection dir) { rotate(Face.UP, dir); }
public void down(RotateDirection dir) { rotate(Face.DOWN, dir); }

}

public Edge[] getEdges() {
for (int i = 0; i < EDGES_COUNT; ++i) {
edges[Permutations.EDGE_ORDER[i]].setParts(buildEdge(i));
}
return edges;
}

@Override
public String toString() {
return Arrays.toString(edges);
}



enum Face { FRONT, BACK, LEFT, RIGHT, UP, DOWN }

void rotate(Face face, RotateDirection dir) {
int[][] cycles;
switch (face) {
case FRONT: cycles = dir == RotateDirection.CLOCKWISE ? Permutations.FRONT_CW : Permutations.FRONT_CCW; break;
case BACK: cycles = dir == RotateDirection.CLOCKWISE ? Permutations.BACK_CW : Permutations.BACK_CCW; break;
case LEFT: cycles = dir == RotateDirection.CLOCKWISE ? Permutations.LEFT_CW : Permutations.LEFT_CCW; break;
case RIGHT: cycles = dir == RotateDirection.CLOCKWISE ? Permutations.RIGHT_CW : Permutations.RIGHT_CCW; break;
case UP: cycles = dir == RotateDirection.CLOCKWISE ? Permutations.UP_CW : Permutations.UP_CCW; break;
case DOWN: cycles = dir == RotateDirection.CLOCKWISE ? Permutations.DOWN_CW : Permutations.DOWN_CCW; break;
default: throw new IllegalArgumentException("Unknown Face");
}
appCycle(cycles);
}

void appCycle(int[][] cs) {
for (int[] c : cs) {
int prev = state[c[c.length - 1]];
for (int i = 0; i < c.length; i++) {
int cur = state[c[i]];
state[c[i]] = prev;
prev = cur;
}
}
}

int elemToPos(int x, int y) {
int pos = x + y * 3 + 1;
if (5 < pos) {
return pos - 1;
}
return pos;
}


CubeColor getColor(int edgeIdx) {
return CubeColor.values()[Permutations.EDGE_ORDER[edgeIdx]];
}

CubeColor getCellColor(int edgeIdx, int pos) {
int stateIndex = state[edgeIdx * FIXED_ELEM + pos];
int front = (stateIndex - 1) / FIXED_ELEM;
return getColor(front);
}

CubeColor[][] buildEdge(int edgeIdx) {
CubeColor[][] face = new CubeColor[3][3];
for (int y = 0; y < 3; ++y) {
for (int x = 0; x < 3; ++x) {
if (x == 1 && y == 1) {
face[y][x] = getColor(edgeIdx);
} else {
face[y][x] = getCellColor(edgeIdx, elemToPos(x, y));
}
}
}
return face;
}

static class Permutations {
static final int[] EDGE_ORDER = {2, 4, 3, 5, 0, 1};

static final int[][] FRONT_CW = {
{9,11,16,14}, {10,13,15,12}, {38,17,43,8}, {39,20,42,5}, {40,22,41,3}
};
static final int[][] FRONT_CCW = {
{9,14,16,11}, {10,12,15,13}, {38,8,43,17}, {39,5,42,20}, {40,3,41,22}
};

static final int[][] BACK_CW = {
{25,27,32,30}, {26,29,31,28}, {19,33,6,48}, {21,34,4,47}, {24,35,1,46}
};
static final int[][] BACK_CCW = {
{25,30,32,27}, {26,28,31,29}, {19,48,6,33}, {21,47,4,34}, {24,46,1,35}
};

static final int[][] LEFT_CW = {
{1,3,8,6}, {2,5,7,4}, {33,9,41,32}, {36,12,44,29}, {38,14,46,27}
};
static final int[][] LEFT_CCW = {
{1,6,8,3}, {2,4,7,5}, {33,32,41,9}, {36,29,44,12}, {38,27,46,14}
};

static final int[][] RIGHT_CW = {
{17,19,24,22}, {18,21,23,20}, {48,16,40,25}, {45,13,37,28}, {43,11,35,30}
};
static final int[][] RIGHT_CCW = {
{17,22,24,19}, {18,20,23,21}, {48,25,40,16}, {45,28,37,13}, {43,30,35,11}
};

static final int[][] UP_CW = {
{33,35,40,38}, {34,37,39,36}, {25,17,9,1}, {26,18,10,2}, {27,19,11,3}
};
static final int[][] UP_CCW = {
{33,38,40,35}, {34,36,39,37}, {25,1,9,17}, {26,2,10,18}, {27,3,11,19}
};

static final int[][] DOWN_CW = {
{41,43,48,46}, {42,45,47,44}, {6,14,22,30}, {7,15,23,31}, {8,16,24,32}
};
static final int[][] DOWN_CCW = {
{41,46,48,43}, {42,44,47,45}, {6,30,22,14}, {7,31,23,15}, {8,32,24,16}
};
}
}