Recent content by Kare

Sorry about being a bit late here, I forgot about the competition and got reminded during euros. My solver used an approach I have been thinking about for a few years and finaly got a reason to test. While it proved to be inefficient compared to the other methods used I find it a interesting...

Sorry it took so long to get started with the threading, work came in the way. I have changed the search to consider each initial move a different task. Eg "find a 12 move solution starting with R" is one task, "find a 12 move solution starting with U2" is another. Each core on the computer...

This is great to see. I have been avoiding any development as I felt a major rewrite was needed to clean up the mess and thanks to the magic of open source I won't have too do that :-) Something I have been experimenting with but never released is making the computations on multiple cores. A...

3x3: 18,67 (100/100) 3x3 blind: 2:40,85 (25/25)

3x3 (15.93), (26.27), 19.43, 16.16, 16.16 = 17.25 4x4 (1:20.81), 1:29.80, (1:41.40), 1:25.94, 1:29.36 = 1:28.37 5x5 (3:46.80), 3:08.30, 3:24.22, (2:37.38), 3:04.90 = 3:12.47 3x3 bld 2:11.44 DNF DNF = 2:11.44 Multi 4 of 7 = 1 in 39:55 FMC: 44 moves

I have now also searched for sequencens using only Rw U. Sadly those are 25 moves long (21 if one f2l pair is unsolved). Dumping long lists of algs in the forum seems to be a bit impractical, so Gunnar kindly provided some webspace for a simplistic list of my results...

I don't see why the move I posted, using only R Rw U would not be considered to be in the group just because it can be shortended when concidering a different restriction of the 4x4. But I do have a bunch of other algs for the same case: Rw U' R U2 R' U2 R' U' Rw U2 R Rw U2 Rw U' R' U2...

Here is the complete results, including the ones that mess up f2l corners. Solving the parity before the last pair is an interesting idea. I will have to do quite a few changes to the program but should be able to compute the algs for that too. Yes, this is Kåre Krig. As usual development...

After some serious computations I have found the following parity algs for 4x4 solved using the reduction method. The algs should be the shortest possible using only R, Rw & U while preserving the lower layers. The move count is higher than the well known parity alg, but this might still be...

R F U' F' U' R' F 5th scramble for one of the groups in the first round.

There where to major surprises in the finals, ending in a win by Simon Westlund. The final resutls can be found on http://rubiks.se/html/filnalresultat.html The first table contains the averages for the final round. The first link goes to an excel sheet with the times for all competitors in...

In Sweden we are at the moment running a school championship. This is a (inofficial) competition for kids in grades 7-12. In total we had 200 competitors in the qualification competitions organized by the schools. Of those the top 25 has qualified for the national final that will be held on...

I have built a somewhat general solver where the user may model puzzles in a text-file. The big things I have been missing myself are * Separation steps, ie top edges at the top and bottom edges at the bottom but not solved. * Multi-phase solving. For big puzzles the numbers of positions...

Its not really a problem as long as one of the pieces is in the top layer. Most F2L algs contain two phases, line up the pieces and then insert the pair. Example: Normal F2L: U' R U' R' U' R U2 R' Now if the needed edge is not in the FR-slot but in the BL I can still use the same idea. (I...

K?re Krig 3x3: 19,36 (16,10) 19,76 17,05 21,28+ (23,97) 3x3oh: 52,40 58,87 (60,65) (42,33) 49,69 48,66 4x4: 1:37,75 (1:55,07) 1:42,34 1:35,21 (1:34,51+) 1:35,70 5x5: 3:43,60 3:37,77 (4:10,73) 3:41,59 3:51,43 (3:29,26)