Fish and Chips

From Speedsolving.com Wiki
Revision as of 10:04, 1 January 2022 by Athefre (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Fish and Chips
Fish and Chips.png
Information
Proposer: Anthony Snyder, Kenneth Gustavsson
Proposed: 1982
No. Algs: Varies depending upon system
Purpose: Speedsolving

Fish and Chips is an LL method originally proposed by Anthony Snyder in 1982 and re-proposed and named by Kenneth Gustavsson in 2005. The first step solves all four edges on the U layer along with a single corner. The second step solves the last three corners.

This LL method is thought to be very move efficient and the second step of solving three corners is often regarded as a great final step. There have been a few systems developed to solve the four edges and one corner. However, none so far have been regarded well enough for Fish and Chips to be considered competitive with the most popular LL methods. There is difficulty in developing a system for Fish and Chips because there are four corners to choose from and the user only wants to solve one of them. Typical systems involve the user choosing a single corner or corner position to be solved. This allows for easy recognition. But often at the expense of requiring the user to memorize a larger number of algorithms than should be necessary. There is also a system called SIMPLE, which solves the first step of Fish and Chips using 27 algorithms. However, it hasn't yet been shown to be viable in speedsolves due to unknown recognition speed and decision making. Using unions of algorithms, as in the system used in CLL+1, is another possible system. This system would allow the user to solve any of the four corners while using the shortest and fewest possible number of algorithms. This system has yet to be applied to Fish and Chips.

See Also

External links