[seqfan] Number of squares that can be obscured on Rubiks's cube n × n × n without making any states indistinguishable
v.reshetnikov at gmail.com
Tue Mar 15 20:19:51 CET 2016
I asked a question at M.SE several days ago:
What maximal number of squares in Rubik's cube n × n × n can be obscured
without making any states indistinguishable?
Apparently, the answer depends on n and could be made into a (hopefully)
interesting sequence. I'm asking for your help in solving this problem.
More information about the SeqFan