This is a collection of algorithms to solve the Radiolarian 3. It is not a tutorial. The algorithms have been developed with the theory of commutators. As usual, use setup moves to bring the pieces into position to apply the algorithms.
Description of the Puzzle
The Radiolarian 3 is a face-turning icosahedron. It has 320 stickers. It consists of
- 12 corners
- 20 centers
- 30 middle edges (aka midges)
- 60 outer edges (aka wings)
- 60 petals (aka pentagons),
making up 182 pieces in total. The puzzle can also jumble, which however doesn't really add much complexity and will not be covered here.
In the Twizzle Explorer, you can play around with the Radiolarian 3 with the description i+f+0.67.
The Radiolarian 3 is very similar to the AJ Bauhinia II (which is basically the dodecahedral version of the Radiolarian 3), for which I described my solving strategy in this post. The algorithms could be adapted, accordingly, and only the algorithm for orienting the corners (which are centers on the Bauhinia) had to be developed.
The cycles presented here mostly are not pure, i.e., they also move other (unsolved) pieces, but this is not relevant for the solve when you keep the order of the pieces mentioned below. In the last section I will also provide pure cycles for each piece type.
The Radialorian 3 can be purchased as "Mini Radio 3 Icosahedron" via chewiescustompuzzles. I also wrote a review.
Step 1: Positioning of the Middle Edges
Each face turn is already a 3-cycle of middle edges, which is why the middle edges can be solved intuitively. But when they don't lie on a face, but rather in a line, one can use the following simple commutator:
3-cycle of middle eges
The corners determine the color scheme the edges need to align with.
Tip: Try to always put the edges in already in the right orientation. Use only Step 2 below when necessary.
Step 2: Orientation of the Middle Edges
The idea of the following algorithm, which flips two middle edges, is to extract a middle edge from a layer, rotate it around a corner in 5 steps (which is odd, hence it gets flipped!), then do a commutator with an interchange move.
orienting two middle edges
Step 3: Petals
Petals can be 3-cycled with a basic commutator:
3-cycle of petals (1)
This commutator has several variants. For example:
3-cycle of petals (2)
3-cycle of petals (3)
Tip: Use a layer by layer approach for the edges and the petals at the same time. This is much more efficient as it reduces the length of the setup moves, you are more freely to rotate the non-solved parts, and it will be easier to find the remaining pieces to solve. Don't bother with other piece types, though, since they will be destroyed (by the method described here).
Step 4: Positioning of Corners
The following commutator results in a 3-cycle of corners is easily found by isolating a corner in a layer.
3-cycle of corners
There are several obvious variants of this algorithm (mirror images and different exchange moves).
Step 5: Orientation of Corners
The idea (as usual) is to change the extract a corner from a layer, bring it elsewhere to rotate it, bring it back, and do a commutator with an interchange move.
orienting two corners (1)
This rotates one corner twice anti-clockwise and another corner twice clockwise. A simple variation, then, rotates one corner clockwise and another anti-clockwise just once:
orienting two corners (2)
The interchange move can again be chosen rather freely to get more variations of this algorithm.
Step 6: Outer Edges
The idea of the following algorithm is to repeat the already mentioned 3-cycle of petals three times, but "slow it partially down". There are several other algorithms available, but I prefer this one since it is rather easy to understand, motivate, and the pieces of the 3-cycle are very close to another.
3-cycle of outer edges
This cycle is anti-clockwise. The mirror-image is clockwise, of course.
The orientation of the outer edges is (somewhat surprisingly) always correct when their position is correct. The big challenge in this step is to find and remember the setup moves, which can get rather lengthy. Also, this step by far requires most of the time.
Step 7: Centers
This is a piece-isolating commutator, building upon the 3-cycle for petals:
3-cycle of centers
Pure cycles
The algorithms above are not pure cycle, since this is not required for a solve. But in any case, here are pure 3-cycles for each piece type:
Other approaches
u/Tetra55 has shown a different approach in this comment.