-
-
Save artbikes/4c5e7e2b07ffe41b7b367175aca94746 to your computer and use it in GitHub Desktop.
Simple 2x2x2 Rubik's Cube Solver in Python
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import sys | |
# ------- | |
# | 16 17 | | |
# | Y | | |
# | 18 19 | | |
# ------- ------- ------- ------- | |
# | 12 13 | 00 01 | 04 05 | 08 09 | | |
# | X | Z | X | Z | | |
# | 14 15 | 02 03 | 06 07 | 10 11 | | |
# ------- ------- ------- ------- | |
# | 20 21 | | |
# | Y | | |
# | 22 23 | | |
# ------- | |
MOVES = [ | |
[0, 21, 2, 23, 6, 4, 7, 5, 19, 9, 17, 11, 12, 13, 14, 15, 16, 1, 18, 3, 20, 10, 22, 8], # CW X | |
[0, 1, 14, 15, 4, 5, 2, 3, 8, 9, 6, 7, 12, 13, 10, 11, 16, 17, 18, 19, 22, 20, 23, 21], # CW Y | |
[2, 0, 3, 1, 18, 5, 19, 7, 8, 9, 10, 11, 12, 20, 14, 21, 16, 17, 15, 13, 6, 4, 22, 23], # CW Z | |
[0, 17, 2, 19, 5, 7, 4, 6, 23, 9, 21, 11, 12, 13, 14, 15, 16, 10, 18, 8, 20, 1, 22, 3], # CCW X | |
[0, 1, 6, 7, 4, 5, 10, 11, 8, 9, 14, 15, 12, 13, 2, 3, 16, 17, 18, 19, 21, 23, 20, 22], # CCW Y | |
[1, 3, 0, 2, 21, 5, 20, 7, 8, 9, 10, 11, 12, 19, 14, 18, 16, 17, 4, 6, 13, 15, 22, 23], # CCW Z | |
] | |
MOVE_NAMES = ['+X', '+Y', '+Z', '-X', '-Y', '-Z'] | |
def do_move(state, move): | |
return tuple([state[i] for i in move]) | |
def solved(state): | |
for i in range(0, 24, 4): | |
for j in range(1, 4): | |
if state[i] != state[i+j]: | |
return False | |
return True | |
def _solve(state, depth, moves, memo): | |
if solved(state): | |
return list(moves) | |
if depth <= 0: | |
return | |
if memo.get(state, -1) >= depth: | |
return | |
memo[state] = depth | |
for i, move in enumerate(MOVES): | |
new_state = do_move(state, move) | |
moves.append(i) | |
result = _solve(new_state, depth - 1, moves, memo) | |
moves.pop() | |
if result: | |
return result | |
def solve(state): | |
memo = {} | |
state = tuple(state) | |
for depth in range(100): | |
print(depth) | |
moves = _solve(state, depth, [], memo) | |
if moves: | |
return moves | |
def main(): | |
args = sys.argv[1:] | |
if len(args) != 1: | |
print('Usage: python rubix.py STATE') | |
return | |
state = args[0] | |
print(state) | |
moves = solve(state) | |
print(', '.join(MOVE_NAMES[i] for i in moves)) | |
if __name__ == '__main__': | |
main() |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment