You can swap the internal Python list matrices out for flat, multidimensional NumPy integer arrays . This replaces slow Python nested loops with fast, hardware-optimized matrix slicing operations ( np.rot90 ).
# Display LEFT, FRONT, RIGHT, BACK faces side-by-sidefor r in range(self.n):l_part = " ".join(self.faces['L'][r])f_part = " ".join(self.faces['F'][r])r_part = " ".join(self.faces['R'][r])b_part = " ".join(self.faces['B'][r])print(f"l_part | f_part | r_part | b_part")print() nxnxn rubik 39scube algorithm github python full
def _init_solved_state(self): # Logic to create faces: U, D, L, R, F, B # Each face is an NxN grid pass You can swap the internal Python list matrices
If you are trying to write your own solver from scratch (without just calling a library), here is the roadmap for your code: nxnxn rubik 39scube algorithm github python full