Simple speedmethod solver

[edward_9x]

Hello! I wanted to post this project here before but never got around to it.
It's a pretty plainly implemented solver: No pruning tables or MITM or whatever. It uses human methods and threads instead.
The methods implemented are ZZ, Petrus, 2GR, CFOP and Roux. ZZ is the default because it's what I use, CFOP gives very bad solutions for some reason, and Petrus is the fastest on avg and its movecount is not bad either (truly the greatest method of all time)

GitHub - Edd12321/cubeterm: Reasonably fast twisty puzzle solver

Reasonably fast twisty puzzle solver. Contribute to Edd12321/cubeterm development by creating an account on GitHub.

github.com

Have fun! And maybe the pros on this forum can give me some tips to make it slightly faster. I don't wanna use very advanced stuff partially because I wanna keep it simple and self-contained as one binary.

 

[SpeedCubingLord]

By simple do you mean comprehensible or low move count?

 

[edward_9x]

Finally, I made CFOP not suck as much in this anymore.
It now uses pseudo F2L and ZBLL whenever possible, similarly to a human solver (greedily). It also accounts for any accidental XCross.

Also:

By simple do you mean comprehensible or low move count?

It means the code is small. That's all

 

[edward_9x]

Scramble: F2 D U2 F L' U D2 R' F R' D B' U B' D R' B D2 F R F2 D' B2 D L' F2 L2 B' F U2
D2 F R' B' D B' // Cross (6/6)
y' D' U2 L' U' L2 U2 L' // Pseudo F2L1&2 (8/14)
D' U' R U R' // Pseudo F2L3 (5/19)
L' U L U2 L' U L // F2L4 (7/26)
D2 // ADF (1/27)
U' r U' r2 U r2 U r2 U' r U // OLL (11/38)
U R U R' F' R U R' U' R' F R2 U' R' // PLL (14/52)

Scramble: B' R D U R2 B' R D2 B2 D B F' L' F L' B2 F D' L B' F2 U' F2 B' U' B L' R U R2
R' F2 D L D // Cross (5/5)
D2 U' L U' L' R' U R // Pseudo F2L1 (8/13)
L' U' L // F2L2 (3/16)
l U' F2 U l' // F2L3 (5/21)
D R' U R U R' U2 R // Pseudo F2L4 (8/29)
D // ADF (1/30)
U2 R U R D R' U' R D' R' U2 R' U' R U' R' U' // ZBLL (17/47)

Scramble: D' B2 D' U2 B F2 R2 L2 R B R' L2 B' R L2 B2 L' D R2 U2
B2 R L2 F // Cross (4/4)
F R' U' R F' // F2L1 (5/9)
y' U' R' U R U2 F' r U r' // F2L2 (10/19)
f R' f' // F2L3 (3/22)
R U R' // F2L4 (3/25)
R' U' R' F R F' U R U // OLL (9/34)
R U R' U' R' F R2 U' R' U' R U R' F' U' // PLL (15/49)


Okay, buffed CFOP a bit more. Yesterday's approach only picked the best current pair but this looks ahead a bit more. My program is now just a Tymon simulator. Petrus still finds better solutions and faster though lol

 

[edward_9x]

Added Mehta-TDR. The solver does a bunch of unnecessary AUF, might fix that later