Converse accessibility of standard configurations

Determine whether every standard configuration of the countable edgeless cube is accessible from the solved configuration.

Background

The paper proves that every accessible configuration is standard and that a substantial subclass of standard configurations is accessible. It explicitly identifies the converse—accessibility of every standard configuration—as a natural unresolved question, equivalent in the paper’s framework to whether every solvable configuration is accessible.