Speedsolving.com Wiki - User contributions [en]

Maritan method

2019-05-09T17:49:29Z

Giulisnow:

{{Method Infobox
|name=Maritan
|image=Layer_by_layer.gif
|proposers=[[Giuliano Maritan]]
|year=2018
|steps=4
|algs=Total: 4 CLL: 2 All Edges: 2
|moves=~150 to 200
|purpose=
* [[Beginner Method]]
}}

This method uses algorithms that allow you to proceed with a layer by layer or corner first approach independently.
It does not aim to be a fast method of resolution, but since it is intuitive and equipped with few algorithms to memorize, it is more suitable for beginners who want to understand the dynamics of rotation and operation of the few algorithms used.

== Steps ==

* '''First Step''' - Position and orient the corners of the first layer.
* '''Second step''' - Arrange and orient edges of first and second layer.
* '''Third step''' - Position and orient the corners of the last layer.
* '''Fourth Step''' - Finish the cube with last four edges of the last layer.

===First Step===
[[File:First layer corner.jpg]]
No special algorithms are provided. The corners will be inserted intuitively.

===Second Step===
[[File:First layer edges.jpg]]
It starts from the edges of the first layer. Hold the first layer (white face) either in R or in L

* Algorithm used for turning edges counterclockwise (From now, we will call it B1):

'''R’ D R E''' (or E’ or E2)* '''R’ D’ R E’''' (or E or E2)**
[[File:B1.jpg|500px]]

* Algorithm used for turning edges clockwise (From now, we will call it B2):

'''L D’ L’ E’''' (or E or E2)* '''L D L’ E''' (or E’ or E2)**
[[File:B2.jpg|500px]]

Notes: * We move the middle layer to the right or left according to the nearest wrong edge. ** Obviously the move will be opposite to the one chosen in the previous point.

It is not excluded that it may be necessary to apply conjugates to have the edge to be inserted in one of the indicated positions.

[[File:Second layer edges.jpg]]
For the positioning of the edges of the second layer we will hold the first layer (white face) in U and we will always use the same algorithms (named B1 and B2) used in the second step.
Also in this case it may be useful to use the technique of conjugates in combination with the algorithms.

The last edge of the second layer, having finished the wrong edges useful for the execution of the two algorithms, it will be move (by turning the face to which it belongs) bringing it to the third layer. Execute one of the two algorithms B1 or B2, so arrange the edge and carry it back into the second layer by reverse rotation of the previously rotated face (conjugates).

===Third Step===
[[File:Last layer corner1.jpg]]
Now we want to place the corners in the correct position as shown in the image. From now the last layer (yellow face) must be in F position.

* Algorithm used for permuting two corners in L position (From now, we will call it A1):

'''Dw’ L D F L F’ L’ E'''

* Algorithm used for permuting two corners in R position (From now, we will call it A2):

'''Dw R’ D’ F' R’ F R E’'''

Then orienting the corner [[File:Last layer corner.jpg]] applying the algorithm twice, as shown in the table below:

*Position n.1 [[File:Pos.1.gif]] Solve state
----
*Position n.2 [[File:Pos.2.gif]] A1 x 2 times -> POS. 1
----
*Position n.3 [[File:Pos.3.gif]] A1 x 2 times -> POS. 2
Alternatively, this can be done: x' A2 x 2 times -> POS. 1
----
*Position n.4 [[File:Pos.4.gif]] A1 x 2 times -> POS. 2
----
*Position n.5 [[File:Pos.5.gif]] A1 x 2 times -> POS. 2
----
*Position n.6 [[File:Pos.6.gif]] A1 x 2 times -> POS. 3
----
*Position n.7 [[File:Pos.7.gif]] A1 x 2 times -> POS. 3
----
*Position n.8 [[File:Pos.8.gif]] A1 x 2 times -> POS. 3

===Fourth Step===

The cube is concluded by permuting and orienting the edges of the last layer. Immediately we solve the first edge with one of the two algorithms B1 or B2.
Now for the 3 remaining edges, the situation will be the following:

[[File:ELL.jpg]]

There is 12 cases of this situation all resolvable through the execution of the algorithms B1, B2 or both:

*Position n.1 [[File:SS 1.jpg|120px]] Solve state
----
*Position n.2 [[File:SS 2.jpg|120px]] B1 D y B2 D’
----
*Position n.3 [[File:SS 3.jpg|120px]] B2 D’ y’ B1 D
----
*Position n.4 [[File:SS 4.jpg|120px]] D’ y’ B1 D
----
*Position n.5 [[File:SS 5.jpg|120px]] D y B2 D’
----
*Position n.6 [[File:SS 6.jpg|120px]] B1 D y B2 D’ y’ B1
----
*Position n.7 [[File:SS 7.jpg|120px]] B2
----
*Position n.8 [[File:SS 8.jpg|120px]] B1 B2
----
*Position n.9 [[File:SS 9.jpg|120px]] D’ y’ B1 D y B2
----
*Position n.10 [[File:SS 10.jpg|120px]] B1
----
*Position n.11 [[File:SS 11.jpg|120px]] B2 B1
----
*Position n.12 [[File:SS 12.jpg|120px]] D y B2 D’ y’ B1

Once the dynamics of the two algorithms B1 and B2 are understood, it will not be necessary to memorize any of the possible positions.

== Extras for 4x4x4 ==

* Algorithm B1.1

'''R’ D R u''' (or u’ or u2) '''R’ D’ R u’''' (or u or u2)

* Algorithm B1.2

'''R’ D R d''' (or d’ or d2) '''R’ D’ R d’''' (or d or d2)

B1 always acts on the right side, but in particular: B1.1 on the layer above and B1.2 on the layer below.

* Algorithm B2.1

'''L D’ L’ u’''' (or u or u2) '''L D L’ u''' (or u’ or u2)

* Algorithm B2.2

'''L D’ L’ d’''' (or d or d2) '''L D L’ d''' (or d’ or d2)

B2 always acts on the left side, but in particular: B2.1 on the layer above and B1.2 on the layer below.

User:Giulisnow

2019-05-09T15:21:17Z

Giulisnow: Blanked the page

Maritan method

2019-05-09T15:20:09Z

Giulisnow:

{{Method Infobox
|name=Maritan
|image=Layer_by_layer.gif
|proposers=[[Giuliano Maritan]]
|year=2018
|steps=4
|algs=Total: 4 CLL: 2 All Edges: 2
|moves=~150 to 200
|purpose=
* [[Beginner Method]]
}}

This method uses algorithms that allow you to proceed with a layer by layer or corner first approach independently.
It does not aim to be a fast method of resolution, but since it is intuitive and equipped with few algorithms to memorize, it is more suitable for beginners who want to understand the dynamics of rotation and operation of the few algorithms used.

== Steps ==

* '''First Step''' - Position and orient the corners of the first layer.
* '''Second step''' - Arrange and orient edges of first and second layer.
* '''Third step''' - Position and orient the corners of the last layer.
* '''Fourth Step''' - Finish the cube with last four edges of the last layer.

===First Step===
[[File:First layer corner.jpg]]
No special algorithms are provided. The corners will be inserted intuitively.

===Second Step===
[[File:First layer edges.jpg]]
It starts from the edges of the first layer. Hold the first layer (white face) either in R or in L

* Algorithm used for turning corners counterclockwise (From now, we will call it B1):

'''R’ D R E''' (or E’ or E2)* '''R’ D’ R E’''' (or E or E2)**
[[File:B1.jpg|500px]]

* Algorithm used for turning corners clockwise (From now, we will call it B2):

'''L D’ L’ E’''' (or E or E2)* '''L D L’ E''' (or E’ or E2)**
[[File:B2.jpg|500px]]

Notes: * We move the middle layer to the right or left according to the nearest wrong edge. ** Obviously the move will be opposite to the one chosen in the previous point.

It is not excluded that it may be necessary to apply conjugates to have the edge to be inserted in one of the indicated positions.

[[File:Second layer edges.jpg]]
For the positioning of the edges of the second layer we will hold the first layer (white face) in U and we will always use the same algorithms (named B1 and B2) used in the second step.
Also in this case it may be useful to use the technique of conjugates in combination with the algorithms.

The last edge of the second layer, having finished the wrong edges useful for the execution of the two algorithms, it will be move (by turning the face to which it belongs) bringing it to the third layer. Execute one of the two algorithms B1 or B2, so arrange the edge and carry it back into the second layer by reverse rotation of the previously rotated face (conjugates).

===Third Step===
[[File:Last layer corner1.jpg]]
Now we want to place the corners in the correct position as shown in the image. From now the last layer (yellow face) must be in F position.

* Algorithm used for permuting two corners in L position (From now, we will call it A1):

'''Dw’ L D F L F’ L’ E'''

* Algorithm used for permuting two corners in R position (From now, we will call it A2):

'''Dw R’ D’ F' R’ F R E’'''

Then orienting the corner [[File:Last layer corner.jpg]] applying the algorithm twice, as shown in the table below:

*Position n.1 [[File:Pos.1.gif]] Solve state
----
*Position n.2 [[File:Pos.2.gif]] A1 x 2 times -> POS. 1
----
*Position n.3 [[File:Pos.3.gif]] A1 x 2 times -> POS. 2
Alternatively, this can be done: x' A2 x 2 times -> POS. 1
----
*Position n.4 [[File:Pos.4.gif]] A1 x 2 times -> POS. 2
----
*Position n.5 [[File:Pos.5.gif]] A1 x 2 times -> POS. 2
----
*Position n.6 [[File:Pos.6.gif]] A1 x 2 times -> POS. 3
----
*Position n.7 [[File:Pos.7.gif]] A1 x 2 times -> POS. 3
----
*Position n.8 [[File:Pos.8.gif]] A1 x 2 times -> POS. 3

===Fourth Step===

The cube is concluded by permuting and orienting the edges of the last layer. Immediately we solve the first edge with one of the two algorithms B1 or B2.
Now for the 3 remaining edges, the situation will be the following:

[[File:ELL.jpg]]

There is 12 cases of this situation all resolvable through the execution of the algorithms B1, B2 or both:

*Position n.1 [[File:SS 1.jpg|120px]] Solve state
----
*Position n.2 [[File:SS 2.jpg|120px]] B1 D y B2 D’
----
*Position n.3 [[File:SS 3.jpg|120px]] B2 D’ y’ B1 D
----
*Position n.4 [[File:SS 4.jpg|120px]] D’ y’ B1 D
----
*Position n.5 [[File:SS 5.jpg|120px]] D y B2 D’
----
*Position n.6 [[File:SS 6.jpg|120px]] B1 D y B2 D’ y’ B1
----
*Position n.7 [[File:SS 7.jpg|120px]] B2
----
*Position n.8 [[File:SS 8.jpg|120px]] B1 B2
----
*Position n.9 [[File:SS 9.jpg|120px]] D’ y’ B1 D y B2
----
*Position n.10 [[File:SS 10.jpg|120px]] B1
----
*Position n.11 [[File:SS 11.jpg|120px]] B2 B1
----
*Position n.12 [[File:SS 12.jpg|120px]] D y B2 D’ y’ B1

Once the dynamics of the two algorithms B1 and B2 are understood, it will not be necessary to memorize any of the possible positions.

== Extras for 4x4x4 ==

* Algorithm B1.1

'''R’ D R u''' (or u’ or u2) '''R’ D’ R u’''' (or u or u2)

* Algorithm B1.2

'''R’ D R d''' (or d’ or d2) '''R’ D’ R d’''' (or d or d2)

B1 always acts on the right side, but in particular: B1.1 on the layer above and B1.2 on the layer below.

* Algorithm B2.1

'''L D’ L’ u’''' (or u or u2) '''L D L’ u''' (or u’ or u2)

* Algorithm B2.2

'''L D’ L’ d’''' (or d or d2) '''L D L’ d''' (or d’ or d2)

B2 always acts on the left side, but in particular: B2.1 on the layer above and B1.2 on the layer below.

Maritan method

2019-05-09T15:01:09Z

Giulisnow:

{{Method Infobox
|name=Maritan
|image=Layer_by_layer.gif
|proposers=[[Giuliano Maritan]]
|year=2018
|steps=4
|algs=Total: 4 CLL: 2 All Edges: 2
|moves=~150 to 200
|purpose=
* [[Beginner Method]]
}}

This method uses algorithms that allow you to proceed with a layer by layer or corner first approach independently.
It does not aim to be a fast method of resolution, but since it is intuitive and equipped with few algorithms to memorize, it is more suitable for beginners who want to understand the dynamics of rotation and operation of the few algorithms used.

== Steps ==

* '''First Step''' - Position and orient the corners of the first layer.
* '''Second step''' - Arrange and orient edges of first and second layer.
* '''Third step''' - Position and orient the corners of the last layer.
* '''Fourth Step''' - Finish the cube with last four edges of the last layer.

===First Step===
[[File:First layer corner.jpg]]
No special algorithms are provided. The corners will be inserted intuitively.

===Second Step===
[[File:First layer edges.jpg]]
It starts from the edges of the first layer. Hold the first layer (white face) either in R or in L

* Algorithm used for turning corners counterclockwise (From now, we will call it B1):

'''R’ D R E''' (or E’ or E2)* '''R’ D’ R E’''' (or E or E2)**
[[File:B1.jpg|500px]]

* Algorithm used for turning corners clockwise (From now, we will call it B2):

'''L D’ L’ E’''' (or E or E2)* '''L D L’ E''' (or E’ or E2)**
[[File:B2.jpg|500px]]

Notes: * We move the middle layer to the right or left according to the nearest wrong edge. ** Obviously the move will be opposite to the one chosen in the previous point.

It is not excluded that it may be necessary to apply conjugates to have the edge to be inserted in one of the indicated positions.

[[File:Second layer edges.jpg]]
For the positioning of the edges of the second layer we will hold the first layer (white face) in U and we will always use the same algorithms (named B1 and B2) used in the second step.
Also in this case it may be useful to use the technique of conjugates in combination with the algorithms.

The last edge of the second layer, having finished the wrong edges useful for the execution of the two algorithms, it will be move (by turning the face to which it belongs) bringing it to the third layer. Execute one of the two algorithms B1 or B2, so arrange the edge and carry it back into the second layer by reverse rotation of the previously rotated face (conjugates).

===Third Step===
[[File:Last layer corner1.jpg]]
Now we want to place the corners in the correct position as shown in the image. From now the last layer (yellow face) must be in F position.

* Algorithm used for permuting two corners in L position (From now, we will call it A1):

'''Dw’ L D F L F’ L’ E'''

* Algorithm used for permuting two corners in R position (From now, we will call it A2):

'''Dw R’ D’ F' R’ F R E’'''

Then orienting the corner [[File:Last layer corner.jpg]] applying the algorithm twice, as shown in the table below:

*Position n.1 [[File:Pos.1.gif]] Solve state
----
*Position n.2 [[File:Pos.2.gif]] A1 x 2 times -> POS. 1
----
*Position n.3 [[File:Pos.3.gif]] A1 x 2 times -> POS. 2
Alternatively, this can be done: x' A2 x 2 times -> POS. 1
----
*Position n.4 [[File:Pos.4.gif]] A1 x 2 times -> POS. 2
----
*Position n.5 [[File:Pos.5.gif]] A1 x 2 times -> POS. 2
----
*Position n.6 [[File:Pos.6.gif]] A1 x 2 times -> POS. 3
----
*Position n.7 [[File:Pos.7.gif]] A1 x 2 times -> POS. 3
----
*Position n.8 [[File:Pos.8.gif]] A1 x 2 times -> POS. 3

===Fourth Step===

The cube is concluded by permuting and orienting the edges of the last layer. Immediately we solve the first edge with one of the two algorithms B1 or B2.
Now for the 3 remaining edges, the situation will be the following:

[[File:ELL.jpg]]

There is 12 cases of this situation all resolvable through the execution of the algorithms B1, B2 or both:

*Position n.1 [[File:SS 1.jpg|120px]] Solve state
----
*Position n.2 [[File:SS 2.jpg|120px]] B1 D y B2 D’
----
*Position n.3 [[File:SS 3.jpg|120px]] B2 D’ y’ B1 D
----
*Position n.4 [[File:SS 4.jpg|120px]] D’ y’ B1 D
----
*Position n.5 [[File:SS 5.jpg|120px]] D y B2 D’
----
*Position n.6 [[File:SS 6.jpg|120px]] B1 D y B2 D’ y’ B1
----
*Position n.7 [[File:SS 7.jpg|120px]] B2
----
*Position n.8 [[File:SS 8.jpg|120px]] B1 B2
----
*Position n.9 [[File:SS 9.jpg|120px]] D’ y’ B1 D y B2
----
*Position n.10 [[File:SS 10.jpg|120px]] B1
----
*Position n.11 [[File:SS 11.jpg|120px]] B2 B1
----
*Position n.12 [[File:SS 12.jpg|120px]] D y B2 D’ y’ B1

Once the dynamics of the two algorithms B1 and B2 are understood, it will not be necessary to memorize any of the possible positions.

Maritan method

2019-05-09T14:54:28Z

Giulisnow: Created page with "{{Method Infobox |name=Maritan |image=Layer_by_layer.gif |proposers=Giuliano Maritan |year=2018 |steps=4 |algs=Total: 4 CLL: 2 All Edges: 2 |moves=~150 to 200 |p..."

{{Method Infobox
|name=Maritan
|image=Layer_by_layer.gif
|proposers=[[Giuliano Maritan]]
|year=2018
|steps=4
|algs=Total: 4 CLL: 2 All Edges: 2
|moves=~150 to 200
|purpose=
* [[Beginner Method]]
}}

This method uses algorithms that allow you to proceed with a layer by layer or corner first approach independently.
It does not aim to be a fast method of resolution, but since it is intuitive and equipped with few algorithms to memorize, it is more suitable for beginners who want to understand the dynamics of rotation and operation of the few algorithms used.

== Steps ==

* '''First Step''' - Position and orient the corners of the first layer.
* '''Second step''' - Arrange and orient edges of first and second layer.
* '''Third step''' - Position and orient the corners of the last layer.
* '''Fourth Step''' - Finish the cube with last four edges of the last layer.

===First Step===
[[File:First layer corner.jpg]]
No special algorithms are provided. The corners will be inserted intuitively.

===Second Step===
[[File:First layer edges.jpg]]
It starts from the edges of the first layer. Hold the first layer (white face) either in R or in L

* Algorithm used for turning corners counterclockwise (From now, we will call it B1):

'''R’ D R E''' (or E’ or E2)* '''R’ D’ R E’''' (or E or E2)**
[[File:B1.jpg]]

* Algorithm used for turning corners clockwise (From now, we will call it B2):

'''L D’ L’ E’''' (or E or E2)* '''L D L’ E''' (or E’ or E2)**
[[File:B2.jpg]]

Notes: * We move the middle layer to the right or left according to the nearest wrong edge. ** Obviously the move will be opposite to the one chosen in the previous point.

It is not excluded that it may be necessary to apply conjugates to have the edge to be inserted in one of the indicated positions.

[[File:Second layer edges.jpg]]
For the positioning of the edges of the second layer we will hold the first layer (white face) in U and we will always use the same algorithms (named B1 and B2) used in the second step.
Also in this case it may be useful to use the technique of conjugates in combination with the algorithms.

The last edge of the second layer, having finished the wrong edges useful for the execution of the two algorithms, it will be move (by turning the face to which it belongs) bringing it to the third layer. Execute one of the two algorithms B1 or B2, so arrange the edge and carry it back into the second layer by reverse rotation of the previously rotated face (conjugates).

===Third Step===
[[File:Last layer corner1.jpg]]
Now we want to place the corners in the correct position as shown in the image. From now the last layer (yellow face) must be in F position.

* Algorithm used for permuting two corners in L position (From now, we will call it A1):

'''Dw’ L D F L F’ L’ E'''

* Algorithm used for permuting two corners in R position (From now, we will call it A2):

'''Dw R’ D’ F' R’ F R E’'''

Then orienting the corner [[File:Last layer corner.jpg]] applying the algorithm twice, as shown in the table below:

*Position n.1 [[File:Pos.1.gif]] Solve state
----
*Position n.2 [[File:Pos.2.gif]] A1 x 2 times -> POS. 1
----
*Position n.3 [[File:Pos.3.gif]] A1 x 2 times -> POS. 2
Alternatively, this can be done: x' A2 x 2 times -> POS. 1
----
*Position n.4 [[File:Pos.4.gif]] A1 x 2 times -> POS. 2
----
*Position n.5 [[File:Pos.5.gif]] A1 x 2 times -> POS. 2
----
*Position n.6 [[File:Pos.6.gif]] A1 x 2 times -> POS. 3
----
*Position n.7 [[File:Pos.7.gif]] A1 x 2 times -> POS. 3
----
*Position n.8 [[File:Pos.8.gif]] A1 x 2 times -> POS. 3

===Fourth Step===

The cube is concluded by permuting and orienting the edges of the last layer. Immediately we solve the first edge with one of the two algorithms B1 or B2.
Now for the 3 remaining edges, the situation will be the following:

[[File:ELL.jpg]]

There is 12 cases of this situation all resolvable through the execution of the algorithms B1, B2 or both:

*Position n.1 [[File:SS 1.jpg|120px]] Solve state
----
*Position n.2 [[File:SS 2.jpg|120px]] B1 D y B2 D’
----
*Position n.3 [[File:SS 3.jpg|120px]] B2 D’ y’ B1 D
----
*Position n.4 [[File:SS 4.jpg|120px]] D’ y’ B1 D
----
*Position n.5 [[File:SS 5.jpg|120px]] D y B2 D’
----
*Position n.6 [[File:SS 6.jpg|120px]] B1 D y B2 D’ y’ B1
----
*Position n.7 [[File:SS 7.jpg|120px]] B2
----
*Position n.8 [[File:SS 8.jpg|120px]] B1 B2
----
*Position n.9 [[File:SS 9.jpg|120px]] D’ y’ B1 D y B2
----
*Position n.10 [[File:SS 10.jpg|120px]] B1
----
*Position n.11 [[File:SS 11.jpg|120px]] B2 B1
----
*Position n.12 [[File:SS 12.jpg|120px]] D y B2 D’ y’ B1

Once the dynamics of the two algorithms B1 and B2 are understood, it will not be necessary to memorize any of the possible positions.

User:Giulisnow

2019-05-09T14:47:54Z

Giulisnow:

{{Method Infobox
|name=Maritan
|image=Layer_by_layer.gif
|proposers=[[Giuliano Maritan]]
|year=2018
|steps=4
|algs=Total: 4 CLL: 2 All Edges: 2
|moves=~150 to 200
|purpose=
* [[Beginner Method]]
}}

This method uses algorithms that allow you to proceed with a layer by layer or corner first approach independently.
It does not aim to be a fast method of resolution, but since it is intuitive and equipped with few algorithms to memorize, it is more suitable for beginners who want to understand the dynamics of rotation and operation of the few algorithms used.

== Steps ==

* '''First Step''' - Position and orient the corners of the first layer.
* '''Second step''' - Arrange and orient edges of first and second layer.
* '''Third step''' - Position and orient the corners of the last layer.
* '''Fourth Step''' - Finish the cube with last four edges of the last layer.

===First Step===
[[File:First layer corner.jpg]]
No special algorithms are provided. The corners will be inserted intuitively.

===Second Step===
[[File:First layer edges.jpg]]
It starts from the edges of the first layer. Hold the first layer (white face) either in R or in L

* Algorithm used for turning corners counterclockwise (From now, we will call it B1):

'''R’ D R E''' (or E’ or E2)* '''R’ D’ R E’''' (or E or E2)**
[[File:B1.jpg]]

* Algorithm used for turning corners clockwise (From now, we will call it B2):

'''L D’ L’ E’''' (or E or E2)* '''L D L’ E''' (or E’ or E2)**
[[File:B2.jpg]]

Notes: * We move the middle layer to the right or left according to the nearest wrong edge. ** Obviously the move will be opposite to the one chosen in the previous point.

It is not excluded that it may be necessary to apply conjugates to have the edge to be inserted in one of the indicated positions.

[[File:Second layer edges.jpg]]
For the positioning of the edges of the second layer we will hold the first layer (white face) in U and we will always use the same algorithms (named B1 and B2) used in the second step.
Also in this case it may be useful to use the technique of conjugates in combination with the algorithms.

The last edge of the second layer, having finished the wrong edges useful for the execution of the two algorithms, it will be move (by turning the face to which it belongs) bringing it to the third layer. Execute one of the two algorithms B1 or B2, so arrange the edge and carry it back into the second layer by reverse rotation of the previously rotated face (conjugates).

===Third Step===
[[File:Last layer corner1.jpg]]
Now we want to place the corners in the correct position as shown in the image. From now the last layer (yellow face) must be in F position.

* Algorithm used for permuting two corners in L position (From now, we will call it A1):

'''Dw’ L D F L F’ L’ E'''

* Algorithm used for permuting two corners in R position (From now, we will call it A2):

'''Dw R’ D’ F' R’ F R E’'''

Then orienting the corner [[File:Last layer corner.jpg]] applying the algorithm twice, as shown in the table below:

*Position n.1 [[File:Pos.1.gif]] Solve state
----
*Position n.2 [[File:Pos.2.gif]] A1 x 2 times -> POS. 1
----
*Position n.3 [[File:Pos.3.gif]] A1 x 2 times -> POS. 2
Alternatively, this can be done: x' A2 x 2 times -> POS. 1
----
*Position n.4 [[File:Pos.4.gif]] A1 x 2 times -> POS. 2
----
*Position n.5 [[File:Pos.5.gif]] A1 x 2 times -> POS. 2
----
*Position n.6 [[File:Pos.6.gif]] A1 x 2 times -> POS. 3
----
*Position n.7 [[File:Pos.7.gif]] A1 x 2 times -> POS. 3
----
*Position n.8 [[File:Pos.8.gif]] A1 x 2 times -> POS. 3

===Fourth Step===

The cube is concluded by permuting and orienting the edges of the last layer. Immediately we solve the first edge with one of the two algorithms B1 or B2.
Now for the 3 remaining edges, the situation will be the following:

[[File:ELL.jpg]]

There is 12 cases of this situation all resolvable through the execution of the algorithms B1, B2 or both:

*Position n.1 [[File:SS 1.jpg|120px]] Solve state
----
*Position n.2 [[File:SS 2.jpg|120px]] B1 D y B2 D’
----
*Position n.3 [[File:SS 3.jpg|120px]] B2 D’ y’ B1 D
----
*Position n.4 [[File:SS 4.jpg|120px]] D’ y’ B1 D
----
*Position n.5 [[File:SS 5.jpg|120px]] D y B2 D’
----
*Position n.6 [[File:SS 6.jpg|120px]] B1 D y B2 D’ y’ B1
----
*Position n.7 [[File:SS 7.jpg|120px]] B2
----
*Position n.8 [[File:SS 8.jpg|120px]] B1 B2
----
*Position n.9 [[File:SS 9.jpg|120px]] D’ y’ B1 D y B2
----
*Position n.10 [[File:SS 10.jpg|120px]] B1
----
*Position n.11 [[File:SS 11.jpg|120px]] B2 B1
----
*Position n.12 [[File:SS 12.jpg|120px]] D y B2 D’ y’ B1

Once the dynamics of the two algorithms B1 and B2 are understood, it will not be necessary to memorize any of the possible positions.

User:Giulisnow

2019-05-09T14:43:08Z

Giulisnow:

{{Method Infobox
|name=Maritan
|image=Layer_by_layer.gif
|proposers=[[Giuliano Maritan]]
|year=2018
|steps=4
|algs=Total: 4 CLL: 2 All Edges: 2
|moves=~150 to 200
|purpose=
* [[Beginner Method]]
}}

This method uses algorithms that allow you to proceed with a layer by layer or corner first approach independently.
It does not aim to be a fast method of resolution, but since it is intuitive and equipped with few algorithms to memorize, it is more suitable for beginners who want to understand the dynamics of rotation and operation of the few algorithms used.

== Steps ==

* '''First Step''' - Position and orient the corners of the first layer.
* '''Second step''' - Arrange and orient edges of first and second layer.
* '''Third step''' - Position and orient the corners of the last layer.
* '''Fourth Step''' - Finish the cube with last four edges of the last layer.

===First Step===
[[File:First layer corner.jpg]]
No special algorithms are provided. The corners will be inserted intuitively.

===Second Step===
[[File:First layer edges.jpg]]
It starts from the edges of the first layer. Hold the first layer (white face) either in R or in L

* Algorithm used for turning corners counterclockwise (From now, we will call it B1):

'''R’ D R E''' (or E’ or E2)* '''R’ D’ R E’''' (or E or E2)**
[[File:B1.jpg]]

* Algorithm used for turning corners clockwise (From now, we will call it B2):

'''L D’ L’ E’''' (or E or E2)* '''L D L’ E''' (or E’ or E2)**
[[File:B2.jpg]]

Notes: * We move the middle layer to the right or left according to the nearest wrong edge. ** Obviously the move will be opposite to the one chosen in the previous point.

It is not excluded that it may be necessary to apply conjugates to have the edge to be inserted in one of the indicated positions.

[[File:Second layer edges.jpg]]
For the positioning of the edges of the second layer we will hold the first layer (white face) in U and we will always use the same algorithms (named B1 and B2) used in the second step.
Also in this case it may be useful to use the technique of conjugates in combination with the algorithms.

The last edge of the second layer, having finished the wrong edges useful for the execution of the two algorithms, ity will be move (by turning the face to which it belongs) bringing it to the third layer. Execute one of the two algorithms B1 or B2, so I arrange the edge and carry it back into the second layer by reverse rotation of the previously rotated face (conjugates).

===Third Step===
[[File:Last layer corner1.jpg]]
Now we want to place the corners in the correct position as shown in the image. From now the last layer (yellow face) must be in F position.

* Algorithm used for permuting two corners in L position (From now, we will call it A1):

'''Dw’ L D F L F’ L’ E'''

* Algorithm used for permuting two corners in R position (From now, we will call it A2):

'''Dw R’ D’ F' R’ F R E’'''

Then orienting the corner [[File:Last layer corner.jpg]] applying the algorithm twice, as shown in the table below:

*Position n.1 [[File:Pos.1.gif]] Solve state
----
*Position n.2 [[File:Pos.2.gif]] A1 x 2 times -> POS. 1
----
*Position n.3 [[File:Pos.3.gif]] A1 x 2 times -> POS. 2
Alternatively, this can be done: x' A2 x 2 times -> POS. 1
----
*Position n.4 [[File:Pos.4.gif]] A1 x 2 times -> POS. 2
----
*Position n.5 [[File:Pos.5.gif]] A1 x 2 times -> POS. 2
----
*Position n.6 [[File:Pos.6.gif]] A1 x 2 times -> POS. 3
----
*Position n.7 [[File:Pos.7.gif]] A1 x 2 times -> POS. 3
----
*Position n.8 [[File:Pos.8.gif]] A1 x 2 times -> POS. 3

===Fourth Step===

The cube is concluded by permuting and orienting the edges of the last layer. Immediately we solve the first edge with one of the two algorithms B1 or B2.
Now for the 3 remaining edges, the situation will be the following:

[[File:ELL.jpg]]

There is 12 cases of this situation all resolvable through the execution of the algorithms B1, B2 or both:

*Position n.1 [[File:SS 1.jpg|120px]] Solve state
----
*Position n.2 [[File:SS 2.jpg|120px]] B1 D y B2 D’
----
*Position n.3 [[File:SS 3.jpg|120px]] B2 D’ y’ B1 D
----
*Position n.4 [[File:SS 4.jpg|120px]] D’ y’ B1 D
----
*Position n.5 [[File:SS 5.jpg|120px]] D y B2 D’
----
*Position n.6 [[File:SS 6.jpg|120px]] B1 D y B2 D’ y’ B1
----
*Position n.7 [[File:SS 7.jpg|120px]] B2
----
*Position n.8 [[File:SS 8.jpg|120px]] B1 B2
----
*Position n.9 [[File:SS 9.jpg|120px]] D’ y’ B1 D y B2
----
*Position n.10 [[File:SS 10.jpg|120px]] B1
----
*Position n.11 [[File:SS 11.jpg|120px]] B2 B1
----
*Position n.12 [[File:SS 12.jpg|120px]] D y B2 D’ y’ B1

Once the dynamics of the two algorithms B1 and B2 are understood, it will not be necessary to memorize any of the possible positions.

User:Giulisnow

2019-05-09T14:32:23Z

Giulisnow:

{{Method Infobox
|name=Maritan
|image=Layer_by_layer.gif
|proposers=[[Giuliano Maritan]]
|year=2018
|steps=4
|algs=Total: 4 CLL: 2 All Edges: 2
|moves=~150 to 200
|purpose=
* [[Beginner Method]]
}}

This method uses algorithms so that you can proceed with a layer by layer or corner first approach independently.
It does not aim to be a fast method of resolution, but since it is intuitive and equipped with few algorithms to memorize, it is more suitable for beginners who want to understand the dynamics of rotation and operation of the few algorithms used.

== Steps ==

* '''First Step''' - Position and orient the corners of the first layer.
* '''Second step''' - Arrange and orient edges of first and second layer.
* '''Third step''' - Position and orient the corners of the last layer.
* '''Fourth Step''' - Finish the cube with last four edges of the last layer.

===First Step===
[[File:First layer corner.jpg]]
No special algorithms are provided. The corners will be inserted intuitively.

===Second Step===
[[File:First layer edges.jpg]]
It starts from the edges of the first layer. Hold the first layer (white face) either in R or in L

* Algorithm used for turning corners counterclockwise (From now, we will call it B1):

'''R’ D R E''' (or E’ or E2)* '''R’ D’ R E’''' (or E or E2)**
[[File:B1.jpg]]

* Algorithm used for turning corners clockwise (From now, we will call it B2):

'''L D’ L’ E’''' (or E or E2)* '''L D L’ E''' (or E’ or E2)**
[[File:B2.jpg]]

Notes: * We move the middle layer to the right or left according to the nearest wrong edge. ** Obviously the move will be opposite to the one chosen in the previous point.

It is not excluded that it may be necessary to apply conjugates to have the edge to be inserted in one of the indicated positions.

[[File:Second layer edges.jpg]]
For the positioning of the edges of the second layer we will hold the first layer (white face) in U and we will always use the same algorithms (named B1 and B2) used in the second step.
Also in this case it may be useful to use the technique of conjugates in combination with the algorithms.

The last edge of the second layer, having finished the wrong edges useful for the execution of the two algorithms, ity will be move (by turning the face to which it belongs) bringing it to the third layer. Execute one of the two algorithms B1 or B2, so I arrange the edge and carry it back into the second layer by reverse rotation of the previously rotated face (conjugates).

===Third Step===
[[File:Last layer corner1.jpg]]
Now we want to place the corners in the correct position as shown in the image. From now the last layer (yellow face) must be in F position.

* Algorithm used for permuting two corners in L position (From now, we will call it A1):

'''Dw’ L D F L F’ L’ E'''

* Algorithm used for permuting two corners in R position (From now, we will call it A2):

'''Dw R’ D’ F' R’ F R E’'''

Then orienting the corner [[File:Last layer corner.jpg]] applying the algorithm twice, as shown in the table below:

*Position n.1 [[File:Pos.1.gif]] Solve state
----
*Position n.2 [[File:Pos.2.gif]] A1 x 2 times -> POS. 1
----
*Position n.3 [[File:Pos.3.gif]] A1 x 2 times -> POS. 2
Alternatively, this can be done: x' A2 x 2 times -> POS. 1
----
*Position n.4 [[File:Pos.4.gif]] A1 x 2 times -> POS. 2
----
*Position n.5 [[File:Pos.5.gif]] A1 x 2 times -> POS. 2
----
*Position n.6 [[File:Pos.6.gif]] A1 x 2 times -> POS. 3
----
*Position n.7 [[File:Pos.7.gif]] A1 x 2 times -> POS. 3
----
*Position n.8 [[File:Pos.8.gif]] A1 x 2 times -> POS. 3

===Fourth Step===

The cube is concluded by permuting and orienting the edges of the last layer. Immediately we solve the first edge with one of the two algorithms B1 or B2.
Now for the 3 remaining edges, the situation will be the following:

[[File:ELL.jpg]]

There is 12 cases of this situation all resolvable through the execution of the algorithms B1, B2 or both:

*Position n.1 [[File:SS 1.jpg|120px]] Solve state
----
*Position n.2 [[File:SS 2.jpg|120px]] B1 D y B2 D’
----
*Position n.3 [[File:SS 3.jpg|120px]] B2 D’ y’ B1 D
----
*Position n.4 [[File:SS 4.jpg|120px]] D’ y’ B1 D
----
*Position n.5 [[File:SS 5.jpg|120px]] D y B2 D’
----
*Position n.6 [[File:SS 6.jpg|120px]] B1 D y B2 D’ y’ B1
----
*Position n.7 [[File:SS 7.jpg|120px]] B2
----
*Position n.8 [[File:SS 8.jpg|120px]] B1 B2
----
*Position n.9 [[File:SS 9.jpg|120px]] D’ y’ B1 D y B2
----
*Position n.10 [[File:SS 10.jpg|120px]] B1
----
*Position n.11 [[File:SS 11.jpg|120px]] B2 B1
----
*Position n.12 [[File:SS 12.jpg|120px]] D y B2 D’ y’ B1

Once the dynamics of the two algorithms B1 and B2 are understood, it will not be necessary to memorize any of the possible positions.

File:SS 5.jpg

2019-05-09T14:12:55Z

Giulisnow:

File:SS 12.jpg

2019-05-09T14:06:27Z

Giulisnow:

File:SS 11.jpg

2019-05-09T14:06:14Z

Giulisnow:

File:SS 10.jpg

2019-05-09T14:06:01Z

Giulisnow:

File:SS 9.jpg

2019-05-09T14:05:47Z

Giulisnow:

File:SS 8.jpg

2019-05-09T14:05:32Z

Giulisnow:

File:SS 7.jpg

2019-05-09T14:05:18Z

Giulisnow:

File:SS 6.jpg

2019-05-09T14:05:03Z

Giulisnow:

File:SS 4.jpg

2019-05-09T14:04:46Z

Giulisnow:

File:SS 3.jpg

2019-05-09T14:04:29Z

Giulisnow:

File:SS 2.jpg

2019-05-09T14:04:13Z

Giulisnow:

File:SS 1.jpg

2019-05-09T14:03:57Z

Giulisnow:

User:Giulisnow

2019-05-09T13:45:58Z

Giulisnow:

{{Method Infobox
|name=Maritan
|image=Layer_by_layer.gif
|proposers=[[Giuliano Maritan]]
|year=2018
|steps=4
|algs=Total: 4 CLL: 2 All Edges: 2
|moves=~150 to 200
|purpose=
* [[Beginner Method]]
}}

This method uses algorithms so that you can proceed with a layer by layer or corner first approach independently.
It does not aim to be a fast method of resolution, but since it is intuitive and equipped with few algorithms to memorize, it is more suitable for beginners who want to understand the dynamics of rotation and operation of the few algorithms used.

== Steps ==

* '''First Step''' - Position and orient the corners of the first layer.
* '''Second step''' - Arrange and orient edges of first and second layer.
* '''Third step''' - Position and orient the corners of the last layer.
* '''Fourth Step''' - Finish the cube with last four edges of the last layer.

===First Step===
[[File:First layer corner.jpg]]
No special algorithms are provided. The corners will be inserted intuitively.

===Second Step===
[[File:First layer edges.jpg]]
It starts from the edges of the first layer. Hold the first layer (white face) either in R or in L

* Algorithm used for turning corners counterclockwise (From now, we will call it B1):

'''R’ D R E''' (or E’ or E2)* '''R’ D’ R E’''' (or E or E2)**
[[File:B1.jpg]]

* Algorithm used for turning corners clockwise (From now, we will call it B2):

'''L D’ L’ E’''' (or E or E2)* '''L D L’ E''' (or E’ or E2)**
[[File:B2.jpg]]

Notes: * We move the middle layer to the right or left according to the nearest wrong edge. ** Obviously the move will be opposite to the one chosen in the previous point.

It is not excluded that it may be necessary to apply conjugates to have the edge to be inserted in one of the indicated positions.

[[File:Second layer edges.jpg]]
For the positioning of the edges of the second layer we will hold the first layer (white face) in U and we will always use the same algorithms (named B1 and B2) used in the second step.
Also in this case it may be useful to use the technique of conjugates in combination with the algorithms.

The last edge of the second layer, having finished the wrong edges useful for the execution of the two algorithms, ity will be move (by turning the face to which it belongs) bringing it to the third layer. Execute one of the two algorithms B1 or B2, so I arrange the edge and carry it back into the second layer by reverse rotation of the previously rotated face (conjugates).

===Third Step===
[[File:Last layer corner1.jpg]]
Now we want to place the corners in the correct position as shown in the image. From now the last layer (yellow face) must be in F position.

* Algorithm used for permuting two corners in L position (From now, we will call it A1):

'''Dw’ L D F L F’ L’ E'''

* Algorithm used for permuting two corners in R position (From now, we will call it A2):

'''Dw R’ D’ F' R’ F R E’'''

Then orienting the corner [[File:Last layer corner.jpg]] applying the algorithm twice, as shown in the table below:

*Position n.1 [[File:Pos.1.gif]] Solve state
----
*Position n.2 [[File:Pos.2.gif]] A1 x 2 times -> POS. 1
----
*Position n.3 [[File:Pos.3.gif]] A1 x 2 times -> POS. 2
Alternatively, this can be done: x' A2 x 2 times -> POS. 1
----
*Position n.4 [[File:Pos.4.gif]] A1 x 2 times -> POS. 2
----
*Position n.5 [[File:Pos.5.gif]] A1 x 2 times -> POS. 2
----
*Position n.6 [[File:Pos.6.gif]] A1 x 2 times -> POS. 3
----
*Position n.7 [[File:Pos.7.gif]] A1 x 2 times -> POS. 3
----
*Position n.8 [[File:Pos.8.gif]] A1 x 2 times -> POS. 3

===Fourth Step===

The cube is concluded by permuting and orienting the edges of the last layer. Immediately we solve the first edge with one of the two algorithms B1 or B2.
Now for the 3 remaining edges, the situation will be the following:
[[File:ELL.jpg]]
There is 12 cases of this situation all resolvable through the execution of the algorithms B1, B2 or both

File:ELL.jpg

2019-05-09T13:39:03Z

Giulisnow:

File:Pos.8.gif

2019-05-09T13:15:42Z

Giulisnow:

File:Pos.7.gif

2019-05-09T13:15:20Z

Giulisnow:

File:Pos.6.gif

2019-05-09T13:15:06Z

Giulisnow:

File:Pos.5.gif

2019-05-09T13:14:53Z

Giulisnow:

File:Pos.4.gif

2019-05-09T13:14:38Z

Giulisnow:

File:Pos.3.gif

2019-05-09T13:14:20Z

Giulisnow:

File:Pos.1.gif

2019-05-09T13:13:53Z

Giulisnow:

File:Pos.2.gif

2019-05-09T13:12:54Z

Giulisnow:

File:Last layer corner1.jpg

2019-05-09T11:37:14Z

Giulisnow:

File:Last layer corner.jpg

2019-05-09T11:33:20Z

Giulisnow:

File:First layer corner.jpg

2019-05-09T11:32:58Z

Giulisnow:

User:Giulisnow

2019-05-09T10:49:05Z

File:Second layer edges.jpg

2019-05-09T10:32:52Z

Giulisnow:

File:B2.jpg

2019-05-09T10:13:59Z

Giulisnow:

File:B1.jpg

2019-05-09T10:13:39Z

Giulisnow:

File:First layer edges.jpg

2019-05-09T09:42:59Z

Giulisnow: