Carykh's Loopover 5x5 No Regrips 16:34.271

Channel:

Orucs-Oraihc

Subscribers:

223

Published on January 26, 2019 8:18:50 AM ● Video Link: https://www.youtube.com/watch?v=s7iApK-mxG8

Game:

Counter-Strike: Source (2004)

Duration: 18:09

388 views

6

There's a lot going on here, so let's start with the algorithms:
I only use variations of 2 different algorithms to solve the puzzle; the remainder is intuitive. I have tentatively called these algorithms "Staircase" and "PSJ" because of the way they looked to me when I found them. I will be using WASD notation because these are the keys I use while solving the puzzle; W is up, A is left, S is down, and D is right.

"STAIRCASE" is an 88-move 3-piece permutator that has the effect of moving a center-corner and the opposing two center-edges in a cycle. There are 8 different variations of "Staircase", which I call (Staircase) Red, Red'[prime], Blue, Blue', Yellow, Yellow', Green, and Green' (color based on the color of the corner next to which the corner edge is and prime whether they move in a clockwise or counterclockwise direction). They are all rotations and reflections of the first.
STAIRCASE RED: [ASDWDWAS] * 11
STAIRCASE RED': [WDSASAWD] * 11
STAIRCASE BLUE: [WASDSDWA] * 11
STAIRCASE BLUE': [DSAWAWDS] * 11
STAIRCASE YELLOW: [SDWAWASD] * 11
STAIRCASE YELLOW': [AWDSDSAW] * 11
STAIRCASE GREEN: [DWASASDW] * 11
STAIRCASE GREEN': [SAWDWDSA] * 11

"PSJ" is a 84-move double-swap permutator which swaps two center pieces for those diagonally opposing in a rectangle on the far side of the puzzle. This is used extensively during the second phase of the solve to solve pieces on the puzzle edge. There are 8 different variations, again all rotations and reflections of the first. It is named "PSJ" because the center piece (M) moves in the shape of the letters P, S, and J, in order, when in the downward unflipped variation. Only the downward and unflipped variation is given; as they are unnamed, the rest would be too tedious to type out.
PSJ: [DSASDWAWDSSAWW] * 6
This particular variation swaps L with T and Q with O.

The method:
First I want to intuitively solve as much as can be done simply and will not be destroyed by other steps; for me this amounts to the 2x2 box of AEUY and the two squares B and F; it is possible, however, to use Cary's method of solving a 3x3 box ABEFGJUVY instead, but the G piece will likely be forced to move later in the solve. After this, I use a combination of PSJs and Staircases to move edge pieces C+D and K+P into the center and to line them up where they can be swapped into the right places; from there, I use PSJ to complete the edge. I also want to move ONE OF (V,X) and (J,T) EACH into the correct place at this time. From there I line up the remaining pieces on the edge using more PSJ's and Staircases. At this point only the 3x3 area at the center of the board is left unsolved and we will use exclusively Staircases for the rest of the solve. First, get the center corners into the correct places while trying to solve as many center edges as possible. Finally, if there remain unsolved center edges, they will be in either a 3-cycle or a double-swap, both of which can be solved using 3-cycle methods. The composite algorithm for these 3-cycles uses 5 Staircases; one case is given below, from which the rest can be derived.
CENTER EDGE 3-CYCLE: Staircase Yellow, Staircase Green, Staircase Yellow, Staircase Green', Staircase Yellow'
This composite algorithm will, from a solved position, move H, N, and L in a clockwise cycle.

One key point at which time could be saved was when I paused for a full minute near the end of the solve; I couldn't figure out how to start the final 3-cycle algorithm and had to look at my notes for an extended time. If anyone can beat this time or find more useful and short algorithms for solving the center, or algorithms for moving a single piece to the edge, please let me know! Thank you! -- Watch live at https://www.twitch.tv/orucsoraihc

Other Statistics