« Apple bans modular programming | Main | Geometry and topology at SODA 2011 »

June 28, 2010


Forrest Iandola

Hi Jeff,

I notice that Chris Hardwick's article (linked from this blog post) suggests that there is a linear correlation between number of pieces in a given Rubik's Cube and the time to solve that cube. Is there a good theoretical explanation for why, at least for a good human Cube solver, the "time per piece" to solve is roughly constant when we vary the size of the cube?

Perhaps it's not too useful to model human Cube performance algorithmically--I'm just curious why Hardwick's time increase is much less severe than polynomial complexity would suggest.


The comments to this entry are closed.