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.