Pocket Cube

{{Short description|2x2x2 combination puzzle}}

{{About|the 2×2×2 rotatable puzzle|the satellite specification|PocketQube}}

File:Pocket cube scrambled.jpg

The Pocket Cube (also known as the Mini Cube and Twizzle) is a 2×2×2 combination puzzle invented in 1970 by American puzzle designer Larry D. Nichols.{{Cite web |title=All About The Rubik's Cube - Cubelo |url=https://www.cubelelo.com/blogs/cubing/all-about-rubik-s-cube#ruffruff-table-of-contents-item-11 |website=Cubelo}} The cube consists of 8 pieces, which are all corners.

History

File:Pocket Cube size comparison.jpg

In February 1970, Larry D. Nichols invented a 2×2×2 "Puzzle with Pieces Rotatable in Groups" and filed a Canadian patent application for it. Nichols's cube was held together with magnets. Nichols was granted {{US patent|3655201}} on April 11, 1972, two years before Rubik invented the 3×3×3 cube.

Nichols assigned his patent to his employer Moleculon Research Corp., which sued Ideal in 1982. In 1984, Ideal lost the patent infringement suit and appealed. In 1986, the appeals court affirmed the judgment that Rubik's 2×2×2 Pocket Cube infringed Nichols's patent, but overturned the judgment on Rubik's 3×3×3 Cube.{{cite web|url=http://digital-law-online.info/cases/229PQ805.htm |title=Moleculon Research Corporation v. CBS, Inc |publisher=Digital-law-online.info |access-date=2012-06-20}}

Group Theory

File:Pocket cube twisted.jpgThe group theory of the 3×3×3 cube can be transferred to the 2×2×2 cube.{{citation |author=Pina Kolling |date=2021 |language=de |location=Dortmund |url=https://www.researchgate.net/publication/368732507 |title=Gruppentheorie des 2×2×2 Zauberwürfels und dessen Lösungsalgorithmen}} The elements of the group are typically the moves of that can be executed on the cube (both individual rotations of layers and composite moves from several rotations) and the group operator is a concatenation of the moves.

To analyse the group of the 2×2×2 cube, the cube configuration has to be determined. This can be represented as a 2-tuple, which is made up of the following parameters:

Two moves M_1and M_2 from the set A_Mof all moves are considered equal if they produce the same configuration with the same initial configuration of the cube. With the 2×2×2 cube, it must also be considered that there is no fixed orientation or top side of the cube, because the 2×2×2 cube has no fixed center pieces. Therefore, the equivalence relation \sim

is introduced with M_1 \sim M_2 := M_1 and M_2 result in the same cube configuration (with optional rotation of the cube). This relation is reflexive, as two identical moves transform the cube into the same final configuration with the same initial configuration. In addition, the relation is symmetrical and transitive, as it is similar to the mathematical relation of equality.

With this equivalence relation, equivalence classes can be formed that are defined with [ M ] := \{ M' \in A_M | M' \sim M \} \subseteq A_M on the set of all moves A_M. Accordingly, each equivalence class [M] contains all moves of the set A_M that are equivalent to the move with the equivalence relation. [M] is a subset of A_M. All equivalent elements of an equivalence class [M] are the representatives of its equivalence class.

The quotient set A_M / \sim can be formed using these equivalence classes. It contains the equivalence classes of all cube moves without containing the same moves twice. The elements of A_M / \sim are all equivalence classes with regard to the equivalence relation \sim

. The following therefore applies: A_M / \sim := \{ [M] | M \in A_M \}. This quotient set is the set of the group of the cube.

The 2×2×2 Rubik's cube, has eight permutation objects (corner pieces), three possible orientations of the eight corner pieces and 24 possible rotations of the cube, as there is no unique top side.

Any permutation of the eight corners is possible (8! positions), and seven of them can be independently rotated with three possible orientations (37 positions). There is nothing identifying the orientation of the cube in space, reducing the positions by a factor of 24. This is because all 24 possible positions and orientations of the first corner are equivalent due to the lack of fixed centers (similar to what happens in circular permutations). This factor does not appear when calculating the permutations of N×N×N cubes where N is odd, since those puzzles have fixed centers which identify the cube's spatial orientation. The number of possible positions of the cube is

:\frac{8! \times 3^7}{24}=7! \times 3^6=3,674,160. This is the order of the group as well.

The largest order of an element in this group is 45. For example, one such element of order 45 is

:(UR^2L').

Any cube configuration can be solved in up to 14 turns (when making only quarter turns) or in up to 11 turns (when making half turns in addition to quarter turns).[http://www.jaapsch.net/puzzles/cube2.htm Jaapsch.net: Pocket Cube]

The number a of positions that require n any (half or quarter) turns and number q of positions that require n quarter turns only are:

class="wikitable" style="margin: 1em auto; text-align:right;"
style="text-align:center;"

!n

!a

!q

!a(%)

!q(%)

0

|1

|1

|0.000027%

|0.000027%

1

|9

|6

|0.00024%

|0.00016%

2

|54

|27

|0.0015%

|0.00073%

3

|321

|120

|0.0087%

|0.0033%

4

|1847

|534

|0.050%

|0.015%

5

|9992

|2256

|0.27%

|0.061%

6

|50136

|8969

|1.36%

|0.24%

7

|227536

|33058

|6.19%

|0.90%

8

|870072

|114149

|23.68%

|3.11%

9

|1887748

|360508

|51.38%

|9.81%

10

|623800

|930588

|16.98%

|25.33%

11

|2644

|1350852

|0.072%

|36.77%

12

|0

|782536

|0%

|21.3%

13

|0

|90280

|0%

|2.46%

14

|0

|276

|0%

|0.0075%

The two-generator subgroup (the number of positions generated just by rotations of two adjacent faces) is of order 29,160.

{{ cite web

| url=http://sporadic.stanford.edu/bump/match/morepolished.pdf

| title=Unravelling the (miniature) Rubik's Cube through its Cayley Graph

| date=13 October 2006

}}

Code that generates these results can be found here.{{cite web | url=https://medium.com/@bradenripple/enumerating-all-possible-combinations-of-a-pocket-cube-using-golang-ad80d7af23b | title=Enumerating all permutations of a Pocket Cube using Golang | date=21 July 2022 }}

Methods

A pocket cube can be solved with the same methods as a 3x3x3 Rubik's cube, simply by treating it as a 3x3x3 with solved (invisible) centers and edges. More advanced methods combine multiple steps and require more algorithms. These algorithms designed for solving a 2×2×2 cube are often significantly shorter and faster than the algorithms one would use for solving a 3×3×3 cube.

The Ortega method,[http://www.cubewhiz.com/ortega.php Ortega method tutorial] by Bob Burton also called the Varasano method,[http://www.cyotheking.com/ortega/ What is Varasano?] is an intermediate method. First a face is built (but the pieces may be permuted incorrectly), then the last layer is oriented (OLL) and lastly both layers are permuted (PBL). The Ortega method requires a total of 12 algorithms.

The CLL method[http://www.cyotheking.com/cll2-2/ What is CLL?] first builds a layer (with correct permutation) and then solves the second layer in one step by using one of 42 algorithms.[http://www.cyotheking.com/cll2-2/ CLL tutorial] by Christopher Olson A more advanced version of CLL is the TCLL Method also known as Twisty CLL. One layer is built with correct permutation similarly to normal CLL, however one corner piece can be incorrectly oriented. The rest of the cube is solved, and the incorrect corner orientated in one step. There are 83 cases for TCLL.[http://www.cyotheking.com/tcll What is Twisty CLL?]

One of the more advanced methods is the EG method.[https://www.speedsolving.com/wiki/index.php/EG_Method Description of the EG method] It starts by building a face like in the Ortega method, but then solves the rest of the puzzle in one step. It requires knowing 128 algorithms, 42 of which are the CLL algorithms.

Top-level speedcubers may also 1-look the puzzle,

{{ cite web

|url=https://jperm.net/2x2/faster

|title=2x2: How To Get Faster

}}

which involves inspecting the entire cube and planning out the entire solution in the 15 seconds of inspection allotted to the solver before the solve, with the best solvers being able to plan more than one solution, considering movecount and ergonomics of each.

Notation

Notation is based on 3×3×3 notation but some moves are redundant (All moves are 90°, moves ending with ‘2’ are 180° turns):

  • R represents a clockwise turn of the right face of the cube
  • U represents a clockwise turn of the top face of the cube
  • F represents a clockwise turn of the front face of the cube
  • R' represents an anti-clockwise turn of the right face of the cube
  • U' represents an anti-clockwise turn of the top face of the cube
  • F' represents an anti-clockwise turn of the front face of the cube

{{Cite web|url=https://speedcubing.org/pages/2x2x2-written-tutorial|title = How to solve the 2×2×2 pocket cube speedcube puzzle}}

World records

The world record for the fastest single solve time is 0.43 seconds, set by Teodor Zajder of Poland at Warsaw Cube Masters 2023.{{Cite web |title=Rankings {{!}} World Cube Association |url=https://www.worldcubeassociation.org/results/rankings/222/single |access-date=2023-11-07 |website=www.worldcubeassociation.org}}

The world record average of 5 solves (excluding fastest and slowest) is 0.88 seconds set by Yiheng Wang (王艺衡) of China at Hangzhou Open 2024 with the times of (1.26), (0.84), 0.91 0.89, and 0.85 seconds.World Cube Association [https://www.worldcubeassociation.org/results/rankings/222/average Official Results – 2×2×2 Cube]. An average of 0.78 seconds was set by Wang previously with times of 0.74, (0.70), (0.97), 0.78, and 0.81 seconds, but frame-by-frame analysis revealed his use of 'sliding,' a technique breaking several of the World Cubing Association's (WCA) regulations. Yiheng Wang also set a record of 0.86 seconds but got penalized for the same reason After deliberation between the WCA's Board of Directors and WCA Regulations Committee, Wang was retroactively penalized with additional seconds added to four of his solves.{{Cite web |date=2024-10-26 |title=WRC Decisions with Frame by Frame Analysis | World Cube Association |url=https://www.worldcubeassociation.org/posts/wrc-decisions-with-frame-by-frame-analysis |access-date=2024-10-26 |website=www.worldcubeassociation.org}}

= Top 5 solvers by single solve =

class="wikitable"

!Rank!!Name{{Cite web |title=Rankings {{!}} World Cube Association |url=https://www.worldcubeassociation.org/results/rankings/222/single |access-date=2023-10-01 |website=www.worldcubeassociation.org}} !! Result !! Competition

1{{flagicon|POL}} Teodor Zajder0.43s{{flagicon|POL}} Warsaw Cube Masters 2023
2{{flagicon|GEO}} Vako Marchilashvili (ვაკო მარჩილაშვილი)0.44s{{flagicon|GEO}} Tbilisi April Open 2024
rowspan="2"|3{{flagicon|NZL}} Connor Johnsonrowspan="2"|0.47s{{flagicon|NZL}} Queenspark O'Clock 2025
{{flagicon|CHN}} Guanbo Wang (王冠博){{flagicon|AUS}} Northside Spring Saturday 2022
rowspan="2"|5{{flagicon|POL}} Maciej Czapiewskirowspan="2"|0.49s{{flagicon|POL}} Grudiądz Open 2016
{{flagicon|AUS}} Sebastian Lee{{flagicon|AUS}} NSW State Championship 2025

= Top 5 solvers by [[Olympic average]] of 5 solves=

class="wikitable"

!Rank!! Name !! Result !! Competition !! Times

1{{flagicon|CHN}} Yiheng Wang (王艺衡)0.88s{{flagicon|CHN}} Hangzhou Open 2024(1.26), (0.84), 0.91 0.89, 0.85
2{{flagicon|SGP}} Nigel Phang0.90s{{flagicon|SGP}} Singapore Skewby March 20250.80, 1.05. (1.17), 0.85, (0.72)
3{{flagicon|USA}} Zayn Khanani0.92s{{flagicon|USA}} New-Cumberland County 20240.84, (2.69), (0.71), 1.04, 0.88
4{{flagicon|USA}} Sujan Feist0.94s{{flagicon|USA}} Somerset September 20241.08, (2.17), 0.89, (0.58), 0.85
rowspan="2"|5{{flagicon|NLD}} Antonie Paterakisrowspan="2| 0.97s{{flagicon|ESP}} Warm Up Portugalete 20240.93, 1.05, (0.66), (1.43), 0.92
{{flagicon|POL}} Teodor Zajder{{flagicon|POL}} Energy Cube Białołęka 20240.96, (1.16), 0.78, (2.30), 0.77

See also

References

{{Reflist}}