Tyson Mao

Tyson Mao (born May 8, 1984 in San Francisco, California), is one of the world's top competitive Rubik's Cube solvers. He is known especially for his prominence in the 3x3x3 blindfold Rubik's Cube category where, as of September 29th, 2008, he ranks 26th in the world. cite web|url=http://www.worldcubeassociation.org/results/events.php?eventId=333bf |title=World Cube Association Results for 3x3x3 Blindfolded |accessdate=2008-9-29 |publisher=World Cube Association ] In 2004, with Ron van Bruchem, he formed the World Cube Association, the organization that holds competitive events for the Rubik's Cube. On January 12, 2006, he appeared on the CW Television Network's "Beauty and the Geek" as one of the participants of the second incarnation of the reality television show.cite news | first=Tarra | last=Merrin | coauthors= | title='Beauty and the Geek' returns to TV | date=2006-01-12 | publisher= | url =http://jam.canoe.ca/Television/2006/01/12/1389865.html | work =Canoe.ca | pages = | accessdate = 2007-12-12 | language = ]

Rubik's Cube

peed solving

The Rubik's Cube first reached a high level of prominence in the world soon after the toy was released in 1980. Tyson began solving the cube during the puzzle's second emergence in 2003.

After approximately one month of practice with his brother's beginner solution, on August 31, 2003, Tyson recorded a best average of 1 minute 22.26 seconds and a best time of 1 minute 06.33 seconds. Soon after his brother decided to switch to a method developed by Lars Petrus, and on September 10, Tyson recorded a best average of 59.26 seconds and a best time of 45.39 seconds. Improvement has been very rapid since 2003.

Tyson currently uses the method developed by Jessica Fridrich. On September 3, 2004, Tyson broke the 20-second barrier on the Rubik's Cube. Also, on the same day, he recorded a best time of 14.15 seconds.

Blindfold solving

Tyson began solving the Rubik's Cube blindfolded under the guidance of Leyan Lo and Shotaro Makisumi in April 2005. On May 31, 2005, Tyson completed his first successful solve. The Rubik's Cube was scrambled with the algorithm F B' U F2 R2 D' R2 L2 D' B' R2 F2 D' B2 L F2 U' R2 F2 L2 U F' R' D' L ( [http://www.vanderblonk.com/cube/cubeapplet.asp?alg=FB'UF2R2D'R2L2D'B'R2F2D'B2LF2U'R2F2L2UF'R'D'L&inline=true&bgcolor=white&size=400&width=500&height=500&type=Generator view animation] ) and was completed in 6 minutes 14.97 seconds. His first solve is one of the fastest first blindfold solves in the world. On June 6, 2005, Tyson completed his sixth solve by solving the Rubik's Cube blindfolded in 4 minutes 20.56 seconds. By July 2005, Tyson was regularly completing solves in under 2 minutes and 30 seconds. As of September 2006, his fastest achieved time is 1 minute 20.18 seconds. However, this solve was not achieved in competition and did not count as the world record.

Tyson is credited for developing a three "diagonal" corner permutation for blindfold solving. In the case where one must permute three corners where two of them lie diagonally across from each other in one layer and the third corner is in the other layer, it can be very difficult to perform and manipulate the setup moves. During an explanation by Leyan Lo, Tyson misinterpreted Leyan's method and came up with the now more commonly used method, the basic algorithm for which is [(R' F R F')x3 U2] x2 ( [http://www.vanderblonk.com/cube/cubeapplet.asp?alg=(R'FRF')*3U2x2&inline=true&bgcolor=white&size=400&width=500&height=500&type=Solver view animation] ).

Tyson Mao's beginner method

Tyson Mao's unofficial beginner method has been popularized by a set of 8 videos which can be viewed at [http://www.rubiks.com Rubiks.com] . This method is most famous for being used by Will Smith in his recent film "The Pursuit of Happyness". The method is basically a simplified layer-by-layer approach which works much the same way as the Fridrich method. The difference is that the cross is first built around the opposite side to simplify the permutation foresight required, the first two layers are permuted individually, the last layer requires an algorithm to construct a cross, and then repetition of Lars Petrus' Sune algorithm to orient, and finally permutation requires the use of two algorithms, one for the corners and one for the edges. These algorithms may have to be executed multiple times.

Media appearances

*Beauty and the Geek 2
*Chung Yi Da Ge Da (Taiwanese TV show)
*CNN's Anderson Cooper 360 (Air date: December 15, 2006)
*Identity
*The Tonight Show with Jay Leno (Air date: January 27, 2006)
*TWINS
*USA Network: Show Us Your Character

References

External links

* [http://www.tbo.com/entertainment/tv/includes/MGB2UORTKIE.html Brain Trust Behind 'Beauty And The Geek' Says More Stereotype Breaking In Works, TBO.com]
* [http://www.sfgate.com/cgi-bin/article.cgi?f=/c/a/2006/01/13/BAG3DGMRAV1.DTL Brothers square off in cubing contest, San Francisco Chronicle]
* [http://www.imdb.com/name/nm2106065/ Tyson Mao] , entry on The Internet Movie Database
* [http://www.xanga.com/fiddletfm/ Tyson's Blog]