Re: MrRubix's Riddle Thread
For the cubes problem I built off an initial chain N and considered all cases 2<=x<=N
Assume you have a maximum N cubes, with an initial chain X cubes long, and leftover cubes L=N-X. The number of unique available areas to attach the L cubes to the initial chain would be represented by A=round(X/2), so if your initial chain is even, you can attach unique sub-structures to half the available faces, and if it's odd, you don't neglect the middle of the initial chain.
A given available side (denoted as A) here has to be taken care of recursively for all attached substructures, where each recursion also needs accounting for all unique non-isomorphic permutations of additional cubes attached to other faces. Also, substructures forming sub-X contiguous chains outside of the initial chain also need accounting for to avoid overlapping with earlier cases (since it would have been considered as another initial chain case prior). This isn't so much a problem when N=5, but it would be absolutely disgusting later on and I'd probably need to write a program to crunch to crunch the recursions for me.
For N=5, if X=5, L=0, and there is only one arrangement for this chain.
For N=5, if X=4, L=1, then A=round(4/2)=2, and there are two arrangements here.
For N=5, if X=3, L=2, then A=round(3/2)=2, and there are seventeen arrangements here.
For N=5, if X=2, L=3, then A=round(2/2)=1, and there are nine arrangements here.
1+2+17+9=29
For the cubes problem I built off an initial chain N and considered all cases 2<=x<=N
Assume you have a maximum N cubes, with an initial chain X cubes long, and leftover cubes L=N-X. The number of unique available areas to attach the L cubes to the initial chain would be represented by A=round(X/2), so if your initial chain is even, you can attach unique sub-structures to half the available faces, and if it's odd, you don't neglect the middle of the initial chain.
A given available side (denoted as A) here has to be taken care of recursively for all attached substructures, where each recursion also needs accounting for all unique non-isomorphic permutations of additional cubes attached to other faces. Also, substructures forming sub-X contiguous chains outside of the initial chain also need accounting for to avoid overlapping with earlier cases (since it would have been considered as another initial chain case prior). This isn't so much a problem when N=5, but it would be absolutely disgusting later on and I'd probably need to write a program to crunch to crunch the recursions for me.
For N=5, if X=5, L=0, and there is only one arrangement for this chain.
For N=5, if X=4, L=1, then A=round(4/2)=2, and there are two arrangements here.
For N=5, if X=3, L=2, then A=round(3/2)=2, and there are seventeen arrangements here.
For N=5, if X=2, L=3, then A=round(2/2)=1, and there are nine arrangements here.
1+2+17+9=29



Comment