import numpy as np class NxNCube: def __init__(self, n): self.n = n # Representing 6 faces, each of size N x N self.faces = 'U': np.full((n, n), 'White'), 'D': np.full((n, n), 'Yellow'), 'F': np.full((n, n), 'Green'), 'B': np.full((n, n), 'Blue'), 'L': np.full((n, n), 'Orange'), 'R': np.full((n, n), 'Red') Use code with caution. Coordinate and Coordinate-Mapping Model
Use a dictionary:
and uses a "reduction" method to simplify large cubes into a solvable 3x3x3 state. You can find it on GitHub . nxnxn rubik 39-s-cube algorithm github python
: One of the most robust solvers available, tested on cubes up to . import numpy as np class NxNCube: def __init__(self,