• Welcome to the Speedsolving.com, home of the web's largest puzzle community!
    You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

    Registration is fast, simple and absolutely free so please, join our community of 35,000+ people from around the world today!

    If you are already a member, simply login to hide this message and begin participating in the community!

4x4x4 FMC (computer and human)

leeo

Member
Joined
Oct 6, 2014
Messages
69
Likes
13
Location
Spokane, WA
WCA
2016ODEG01
#81
By following the patterns of the BH 3-cycle blindfold method, I can generate all 1760 edge 3-cycles from any origin (buffer), and all 1009 corner 3-cycle from any origin (buffer). On this vein, I've been experimenting with a different approach: Permit a startup time of one CPU second (3 GHz Dual-Core) with no file load permitted. Then budget 5 seconds solution time for each challenge scramble to find the fewest moves possible in that time constraint. I think that emulating the (unassisted) FMC techniques with these internal catalogs could have promise: What results are possible? I'm currently attempting to generate all 3'548'160 edge 5-cycles in that budget.
 
Joined
Mar 2, 2014
Messages
566
Likes
9
Location
Doylestown, PA
#82
By following the patterns of the BH 3-cycle blindfold method, I can generate all 1760 edge 3-cycles from any origin (buffer), and all 1009 corner 3-cycle from any origin (buffer). On this vein, I've been experimenting with a different approach: Permit a startup time of one CPU second (3 GHz Dual-Core) with no file load permitted. Then budget 5 seconds solution time for each challenge scramble to find the fewest moves possible in that time constraint. I think that emulating the (unassisted) FMC techniques with these internal catalogs could have promise: What results are possible? I'm currently attempting to generate all 3'548'160 edge 5-cycles in that budget.
So, basically, you want a contest specifically tailored to something you have already written, without allowing any other program to use their own strengths. Does that about sum it up?
 
Joined
Sep 19, 2007
Messages
74
Likes
0
WCA
2004GALL02
#83
Hello
Here are my solutions for BTM only. My solver cannot solve using double layer moves, so solutions are not optimised for OBTM metric.
1. F U 2R2 B2 L' B' L Fw' R2 Rw' 2U2 B' 2L' 2F2 2L2 2R' 2B' 2D' B' 2U2 B2 D2 (L2 R2) D2 2D Lw2 F' R2 B' 2B2 2L2 B' Lw2 D2 B2 L2 2F2 (37)
2. U 2F' 2D F D' 2R2 U' 2R F' L D' F2 2D' B2 U 2R' B2 2R' L2 2F R2 B2 2B' R2 2D2 2B' 2F2 R2 2D2 B2 D' F2 2R2 2B2 D' F2 U2 2B2 L2 U2 L2 (41)
3. 2U R B2 2B Lw 2B' U' 2R' B' R' 2D2 2L2 2F' 2U' B2 2R R2 F2 2F R2 2D2 2F2 R 2D2 2B 2R2 U2 R2 2B2 L2 D2 L' B2 R U2 2R2 B2 2U2 2B2 R2 (40)
4. U2 F2 2B2 U' 2F2 L U' L' 2D2 F R U2 2D2 2F2 L' 2D' 2F 2R' F2 R' 2B2 L 2R2 2F' L 2F U2 F2 2L2 2D2 R' U2 2B2 D2 R 2U2 B2 D2 R2 B2 L2 B2 (42)
5. 2B2 2D2 F2 U' L' U B R' U 2B2 L 2L' 2U L2 2D B2 2R 2F 2D2 L 2F' R2 2F' D2 2F' U2 F2 R U2 2D2 B2 2R2 2B2 L' B2 R2 Bw2 2D2 2R2 2F2 (40)
 
Top