deepSubDiver
Regular
A few optimal blocks. Note: Random-move scrambles, not random state!
So, nice blocks don't mean short blocks.
Average of 1,000 for the block was around 13 moves.
Average of 100 for optimal solutions was around 22 moves.
During that average I encounterd 6 positions which were not solvable in 25 moves - thus, 25 move scrambles don't do it for us.
When I implemented a more efficient algorithm (not even using transition or pruning tables... Ugh!) I will do a more detailed analysis.
Code:
U' r2 U2 r2 U2 r2 U r2 U' r2 U' r2 U2 r2 U2 r2 U' r2 U2 r2 U r2 U r2 U'
[False, [1, 3, 0, 5, 2, 6, 4], [4, 2, 3, 1, 5, 0]]
solving block
SOLUTION: r2 U2 r2 U2 r2 U' r2 U2 r2 U2 r2 U' r2 U r2
U' r2 U r2 U2 r2 U' r2 U2 r2 U2 r2 U r2 U r2 U2 r2 U r2 U2 r2 U2 r2 U'
[False, [1, 5, 6, 2, 0, 4, 3], [1, 4, 5, 0, 2, 3]]
solving block
SOLUTION: r2 U r2 U2 r2 U' r2 U r2 U r2 U' r2 U2 r2
SOLUTION: r2 U r2 U' r2 U' r2 U r2 U2 r2 U' r2 U2 r2
SOLUTION: r2 U2 r2 U r2 U2 r2 U2 r2 U r2 U2 r2 U2 r2
SOLUTION: r2 U2 r2 U' r2 U2 r2 U2 r2 U' r2 U2 r2 U2 r2
SOLUTION: r2 U' r2 U2 r2 U' r2 U2 r2 U r2 U' r2 U' r2
U r2 U' r2 U2 r2 U2 r2 U' r2 U' r2 U r2 U2 r2 U2 r2 U r2 U' r2 U r2 U'
[False, [6, 5, 0, 2, 1, 4, 3], [5, 2, 0, 1, 3, 4]]
solving block
SOLUTION: r2 U' r2 U r2 U2 r2 U r2 U r2
U' r2 U r2 U2 r2 U' r2 U2 r2 U' r2 U2 r2 U r2 U2 r2 U r2 U2 r2 U2 r2 U2
[False, [1, 0, 3, 2, 5, 6, 4], [3, 0, 2, 4, 5, 1]]
solving block
SOLUTION: U' r2 U r2 (wat?)
U r2 U r2 U2 r2 U' r2 U r2 U r2 U r2 U r2 U2 r2 U' r2 U2 r2 U r2 U
[False, [6, 3, 0, 2, 5, 1, 4], [1, 2, 0, 4, 5, 3]]
solving block
SOLUTION: U' r2 U' r2 U2 r2 U r2 U2 r2 U2 r2
U r2 U r2 U2 r2 U2 r2 U r2 U' r2 U' r2 U' r2 U' r2 U r2 U' r2 U' r2 U'
[False, [3, 5, 2, 4, 0, 1, 6], [1, 5, 4, 2, 0, 3]]
solving block
SOLUTION: U' r2 U2 r2 U2 r2 U' r2 U' r2 U' r2 U r2 U' r2
U r2 U2 r2 U2 r2 U r2 U2 r2 U2 r2 U' r2 U r2 U' r2 U2 r2 U' r2 U r2 U
[False, [2, 0, 1, 6, 3, 5, 4], [5, 1, 2, 4, 3, 0]]
solving block
SOLUTION: U r2 U' r2 U2 r2 U2 r2 U' r2 U' r2
U' r2 U r2 U r2 U2 r2 U' r2 U r2 U2 r2 U' r2 U r2 U2 r2 U2 r2 U' r2 U
[False, [1, 6, 0, 2, 3, 5, 4], [1, 0, 5, 4, 3, 2]]
solving block
SOLUTION: r2 U' r2 U' r2 U r2 U r2 U r2 U' r2 U' r2
Average of 1,000 for the block was around 13 moves.
Average of 100 for optimal solutions was around 22 moves.
During that average I encounterd 6 positions which were not solvable in 25 moves - thus, 25 move scrambles don't do it for us.
When I implemented a more efficient algorithm (not even using transition or pruning tables... Ugh!) I will do a more detailed analysis.
Last edited: