shadowslice e
Member
So nowadays it's generally accepted that on 3x3, most "human developable" methods have been found and either are used or have been tossed out. So as an experiment, I made a genetic algorithm in python which works using a modified version of ksolve++ which generates methods for 2x2.
Consider this mostly a proof of concept because 2x2 is easy. I would be interested in any feedback or suggestions on how this could be applied to bigger cubes (since computing time becomes an issue)
Consider this mostly a proof of concept because 2x2 is easy. I would be interested in any feedback or suggestions on how this could be applied to bigger cubes (since computing time becomes an issue)
Last edited: