kubesolver
Premium Member
- Joined
- Nov 15, 2019
- Messages
- 446
General
Second edition of my previous competition
The Kompetition starts now and will last until Monday 20th of April 13:00 Central Europe Summer Time. I reserve the right to finish it earlier if there is no new or updated submission nor a thread bump for more than 48 hours.
Prize for the winner 100$ cubicle gift card or similar.
Edit: Generation problem slighlty changed (only subproblems 4.3 and 4.3A left).
Edit: Removed problem 3
Edit: Removed problem 1.MEGA
Edit: Added example for problem 4
Second edition of my previous competition
The Kompetition starts now and will last until Monday 20th of April 13:00 Central Europe Summer Time. I reserve the right to finish it earlier if there is no new or updated submission nor a thread bump for more than 48 hours.
Prize for the winner 100$ cubicle gift card or similar.
New scoring rules. For each problem where the higher the better your score is 100 * (your result) / (best result).In a problem where the lower is better we take do the reverse calculation so 100 * best result / your result.
For example:
In a problem 2 people got answers with a score of 8, 7, or 6 and once person gave incorrect answer.
The scores will be
8 => 100
7 => 100 * 7 / 8 = 87.56
6 => 100 * 6 / 8 = 75
wrong answer => 0
For example:
In a problem 2 people got answers with a score of 8, 7, or 6 and once person gave incorrect answer.
The scores will be
8 => 100
7 => 100 * 7 / 8 = 87.56
6 => 100 * 6 / 8 = 75
wrong answer => 0
Definition: Recursion Number (RN) of a sequence is the number of repetitions it takes to come back to starting position. E.g. R U R' U' has Recursion number 6 on nxnxn.
Design a sequence (or equivalent cube state) that has the highest RN.The answer sequence can be either in a regular notation or in some other description that tells how to construct this scramble. (e.g. you can draw the scrambled cube in paint or describe all stickers colors with some algorithm etc.) No rotations are allowed.
Note: You are expected to calculate the number yourself. I will only verify if it's correct if you're about to win a prize. If you miscalculate the number for your scramble it's considered incorrect answer and 0 points.
Score for each subproblem is a logarithm of a recursion number (no need to do FMC).
1.3) On a 3x3.
1.2) On a 2x2
1.Mega) REMOVED
1.INF) Infinite cube recursion:
What is the biggest possible number for any nxnxn cube? If you think it can be arbitrarily large please write Infinity.If it's not infinite please provide Score = sequence Recursion number / n (size of the cube),
Design a sequence (or equivalent cube state) that has the highest RN.The answer sequence can be either in a regular notation or in some other description that tells how to construct this scramble. (e.g. you can draw the scrambled cube in paint or describe all stickers colors with some algorithm etc.) No rotations are allowed.
Note: You are expected to calculate the number yourself. I will only verify if it's correct if you're about to win a prize. If you miscalculate the number for your scramble it's considered incorrect answer and 0 points.
Score for each subproblem is a logarithm of a recursion number (no need to do FMC).
1.3) On a 3x3.
1.2) On a 2x2
1.Mega) REMOVED
1.INF) Infinite cube recursion:
What is the biggest possible number for any nxnxn cube? If you think it can be arbitrarily large please write Infinity.If it's not infinite please provide Score = sequence Recursion number / n (size of the cube),
In these nemesis problems we only focus on 2x2x2 or cross on a D layer (yellow in WCA orientation).
2A) CFOP vs Petrus. Design a scramble that has a solved cross but has the toughest possible 2x2x2.
2B) Petrus vs CFOP. Design a scramble that has a solved 2x2x2, but has the toughest possible cross.
Score is a number of moves required to solve cross / 2x2x2. No need to find the shortest sequences
2A) CFOP vs Petrus. Design a scramble that has a solved cross but has the toughest possible 2x2x2.
2B) Petrus vs CFOP. Design a scramble that has a solved 2x2x2, but has the toughest possible cross.
Score is a number of moves required to solve cross / 2x2x2. No need to find the shortest sequences
Removed
Definition generation: We will call a group of sequences a Cube-Generator if any scramble can be solved using only those sequences.
4.3) Design a smallest set of generators for the whole cube
4.3A) Design a smallest set of generators for the whole cube without allowing the use of rotations (only RLUFDB)
Score for each subproblem is the number of sequences + (total length of all sequences in HTM) / 100.
So for example the score for sequence (R2, x y U) is 2.04
If all your sequences are longer than 25 then your score is X.25 (so it's always better to come up with very complicated 3 sequences than 4 easy ones)
Four sequences (A,B,C,D) is a Cube-Generator if any scramble can be solved with only A, B, C, D e.g. AABCCDABCDCBACDBADCABDCABD.
The most obvious Cube-Generator is (R,L,F,B,D,U).
Another popular example comes from the common "The cube can be solved by Jperms"
The solution to 4.3 could be
(JpermA, JpermB, x, y, z) for a score of 5.03 + 0.01 * 2 * Jperm
The most obvious Cube-Generator is (R,L,F,B,D,U).
Another popular example comes from the common "The cube can be solved by Jperms"
The solution to 4.3 could be
(JpermA, JpermB, x, y, z) for a score of 5.03 + 0.01 * 2 * Jperm
4.3) Design a smallest set of generators for the whole cube
4.3A) Design a smallest set of generators for the whole cube without allowing the use of rotations (only RLUFDB)
Score for each subproblem is the number of sequences + (total length of all sequences in HTM) / 100.
So for example the score for sequence (R2, x y U) is 2.04
If all your sequences are longer than 25 then your score is X.25 (so it's always better to come up with very complicated 3 sequences than 4 easy ones)
Solve the following scrambles with the fewest moves using only RLUDF moves. Score is the length of a sequence in HTM metric.
5.B) B
5.B2) B2
5.B) B
5.B2) B2
Please post your submissions as a DM to me with a title Kompetition 2 and bump this thread.
1.3: 6
R U R' F'
1.2: 2
R2
1.INF: 11999191293921839123
Here is how to get it on 121x121x121 blablabla.
2A: R U R' U'
2B: R U R' U'
3: Removed
4.3: 5.05
(R, U, F, D, x)
4.3A: 5.07
(R, U, F, L, D x y)
5.B: 4
R F2 U R
5.B2: 4
R F2 R' U
R U R' F'
1.2: 2
R2
1.INF: 11999191293921839123
Here is how to get it on 121x121x121 blablabla.
2A: R U R' U'
2B: R U R' U'
3: Removed
4.3: 5.05
(R, U, F, D, x)
4.3A: 5.07
(R, U, F, L, D x y)
5.B: 4
R F2 U R
5.B2: 4
R F2 R' U
Mentioning previous participatns
@WoowyBaby @CuberStache @xyzzy @GenTheThief @TipsterTrickster @brododragon
@WoowyBaby @CuberStache @xyzzy @GenTheThief @TipsterTrickster @brododragon
Edit: Generation problem slighlty changed (only subproblems 4.3 and 4.3A left).
Edit: Removed problem 3
Edit: Removed problem 1.MEGA
Edit: Added example for problem 4
Last edited: