View source for Nautilus (FTO)

{| border="1" class="infobox-template" style="float: right; border-collapse:collapse; width: 22em; font-size: 90%; margin: 0 0 10px 10px;"
|
{| border="0" cellpadding="3" bgcolor="#F0F0F0" cellspacing="2" style="color:black; text-align:center; width: 100%"
|-
| bgcolor="#D0DFEE" colspan="2" style="font-size: 125%;" | '''{{{name|}}} Nautilus (FTO)'''
|-
| colspan="2" style="font-size:90%;"| [[Image:NautilusLL-2.png|200px]]
|-	
| bgcolor="#E0E8EF" colspan="2" | '''Information'''
|-
| bgcolor="#F0F0F0"  align="right" | '''Proposer:'''
| align="left" | {{{proposers|[[James Straughan]]}}}
|-
| bgcolor="#F0F0F0"  align="right" | '''Developers:'''
| align="left" | {{{proposers|[[James Straughan]], [[Liam Highducheck]], [[Vincent Trang]], [[Malte Ihlefeld]], [[Ryan Hudgens]]}}}
|-
| bgcolor="#F0F0F0"  align="right" | '''Proposed:'''
| align="left" | {{{year|2024}}}
|-
| bgcolor="#F0F0F0"  align="right" | '''No. Steps:'''
| align="left" | {{{steps|varies}}}
|-
| bgcolor="#F0F0F0"  align="right" | '''No. Algs:'''
| align="left" | {{{algs|varies}}}
|-
| bgcolor="#F0F0F0"  align="right" | '''Purpose:'''
| align="left" | {{{purpose|[[Speedsolving]]}}}
|-
|}
|}

'''Nautilus''' is a [[Face Turning Octahedron]] speedsolving method developed by James Straughan with assistance from Liam Highducheck and Vincent Trang. The method has a focus on simple, automatic, and algorithm based solving similar to [[CFOP]] for 3x3.

== Steps ==

'''1. First Block:''' Solve the BL layer minus the corner and two small triangle centers of the U layer. This step is typically solved by first building the large center on BL then adding two triples (a corner and two attached triangles). Another good start is an arrow block, which is the large center plus a triple, then adding the final triple.
[[image:NautilusFTOFB-2.png|300px|center]]
'''2. Centers:''' Solve the U, F and BR large centers. Solving any two of these automatically solves the third.
[[image:NautilusCenters-2.png|300px|center]]
'''3. Last Triple:''' Complete the F2L by solving the final corner and two triangles. This step can be solved in a single step using algorithms or broken down into two or three steps for more basic solving.
[[image:NautilusLastTriple-2.png|300px|center]]
'''4. Last Layer:''' Solve the last layer. The standard steps are to solve the side triangles in one step then solve the corners in the second step. Or, 1LLL can be used, which consists of 377 cases. The advantage to ending with a last layer is that recognition is simple. Only the sides of the layer need to be checked to determine a case, similar to 2 sided PLL recognition. There is no need to check the U face or any other pieces around the FTO.
[[image:NautilusLL-2.png|300px|center]]

== Pros ==

* Simple, automatic steps.
* Algorithm based solving may be faster than intuitive based methods.
* Last layer recognition is simple, requiring only checking the sides of the last layer.

== Cons ==

* Large number of algorithms to learn if learning 1LLL.

== Advancements ==

=== 1LLL ===

At just 377 algorithms, 1LLL in combination with a one step last F2L triple provides a very fast two step finish to the method.

=== Advanced Last Slot ===

An alternate ending to solving the first two layers is to solve to the F2L-1 equivalent. This leaves a large F2L "pair" that can be solved in a single step. This creates a more advanced two step ending of solving the large pair then 1LLL. The large pair consists of everything except for the right two triangles of the F layer, the edge, the bottom right side triangle, and the corner.

=== Early Corner Orientation ===

The ZBLS equivalent would be to orient the last layer corners during a previous step. This can be accomplished during the last triple step or integrated into the advanced last slot.

=== Four Triples ===

Another possible advancement is to construct four triples at the last triple step. Then solve the four triples. [[Vincent Trang]] developed an intuitive technique for building the triples, but the technique hasn't been perfected. There is also the possibility of building the triples using algorithms, maybe even through integrating a technique similar to [[CLL+1]]. However, the recognition and execution speed hasn't been tested to compare it to the more automated and algorithm based steps currently used.

== Last Layer Variants ==

Other last layer ideas have been proposed:

* Orient the last layer corners then use PLL.
* Solve the three corners then the last six triangles.
* Form the three triples on the last layer in any orientation then solve the triples.
* Orient the last layer corners while solving the last six triangles relative to the corners. This forms three triples that can then be permuted using one of two algorithms. This idea was proposed by Vincent Trang.
* Leave out the bottom right corner and solve all triangles. Then solve the final four corners in a single step.
* Solve one triple in one algorithm then solve the other two corners and four triangles of the last layer in one algorithm.
* Solve two triangles of the last layer then solve the remaining pieces.

== External Links ==
* [https://www.nautilusfto.com/ Official Website]
* [https://discord.gg/GJB2ER2Q3M Discord Server]
* [https://docs.google.com/spreadsheets/d/1NSa4MMV10ma4nNJKRfET_M1OwxULN_oSWUkThwLcTh0/edit?gid=323120253#gid=323120253 Last Triple Algorithms]
* [https://docs.google.com/spreadsheets/d/1Dh4MEQzpCuTylqnkn09UxBEvEq9MNYMqMiWQgFsBuYE/edit?gid=2102380954#gid=2102380954 2 Look Last Layer Algorithms]
* [https://docs.google.com/spreadsheets/d/15v0A0PipO8RcEeS7TFAaAv3dI1zBykaopkXQK_WnLo0/edit?gid=1497905026#gid=1497905026 1LLL Algorithms]

[[Category:Acronyms]]