TSAYAYYIYAR LAMBA TA 10⁴⁰ TA RAGU ZUWA 30.5 GA MANYAN RUBIK'S CUBE
Rubik’s Cube, wanda ya cika shekaru 50 yanzu-yanzu, watakila shi ne wasan wasa-ƙwaƙwalwa (puzzle) mafi shahara a duniya, kuma ɗaya daga cikin manyan tambayoyinsa mai sauƙin faɗi ce: a mafi munin yanayi (worst case), motsi nawa ake buƙata don warware shi? Ga cube na gargajiya na 3×3×3, an san amsar daidai: motsi 20, sakamakon da aka wallafa a 2014 daga wata ƙungiya wadda ta haɗa da Tomas Rokicki, ɗaya daga cikin marubutan wannan sabuwar takarda.
Ga manyan cubes, masu layuka n a kowane gefe, ainihin amsar ta fi ƙarfin a samu — warware wani n×n×n cube ta hanya mafi kyau (optimally) ma NP-complete ne. Amma a 2011, Erik Demaine da wasu abokan aiki sun nuna yadda mafi munin yanayi ke girma: gwargwadon n² / lg n, inda lg shi ne logarithm mai tushe 2 (base-2 logarithm). Wannan ya fi hanyoyin da aka saba kyau da ma’aunin logarithm (logarithmic factor), waɗanda ke warware guntayen kusan ɗaya bayan ɗaya.
Hujja mai tsayayyiyar lamba mara ma’ana
Akwai wata matsala. Sakamakon 2011 ya tabbatar da saurin girma, ba lambar da ke gabansa ba. Ta hanyar bin wannan algorithm dalla-dalla, marubutan sun gano cewa tsayayyiyar lambarsa kusan 1.01 × 10⁴⁰ ce. Mai laifin wani bincike ne na kwamfuta da ya tabbatar cewa wasu motsi za su iya kaiwa ga kowane tsari (arrangement) na wani rukuni na guntaye 24, ba tare da faɗin da wane sauri ba. Iyaka ɗaya tilo mai aminci a kan wannan tsawon ita ce girman wannan rukunin tsare-tsare, kusan matakai 3.1 × 10²³, kuma dabarar (formula) ta ƙare da amfani da babbar lambar nan 24! (1 × 2 × … × 24, kusan 6.2 × 10²³) a wurare biyu. Akasin haka, iyakar ƙasa (lower bound) — adadin motsin da kusan kowane cube da aka cakuɗa ke buƙata — tana da ƙaramar tsayayyiyar lamba ta kusan 12.88. Saboda haka, da yawa a cikin al’ummar masu wannan fanni sun yi imani cewa irin wannan algorithm ba zai taɓa zama mai amfani a aikace ba ga girma masu ma’ana.
Jeremy Mrzyglocki, Tomas Rokicki, Maxine Perroni-Scharf da Erik Demaine, daga MIT, TU Munich da Palo Alto, yanzu sun bayyana wannan tsayayyiyar lamba a fili kuma sun mayar da ita ƙarama.
Hanyoyin sadarwa na jerawa ga guntayen cube
A kan babban cube, guntayen tsakiya (centre pieces) ne suka fi yawa: adadinsu yana girma kamar n², yayin da kusurwoyi da gefuna (edges) ke ƙara sassa ne kawai masu gwargwado da n. Guntayen tsakiya suna faɗawa cikin iyalai na 24 waɗanda za su iya musanya wurare a tsakaninsu kawai. Kayan aiki na asali shi ne commutator, jerin motsi mai siffar A B A′ B′ da ke barin kusan komai a wurinsa kuma yana sauya wurin guntaye uku kawai na iyali ɗaya. Ƙungiyar ta nemo jerin motsi ga dukan musaye 4,000 masu amfani na guntaye uku, kowanne bai fi motsi 12 tsawo ba.
Ra’ayoyi biyu ne ke sa adadin ya ragu. Na farko, za a iya amfani da commutator iri ɗaya a kan iyalai da yawa a lokaci guda, a kan dukkan rukunonin layuka da ginshiƙai (columns). Na biyu, maimakon warware kowane iyali shi kaɗai, kowane iyali yana bin jerin musaye na bai ɗaya (universal sequence) tsayayye guda, yana tsallake waɗanda ba ya buƙata kawai. Wata hujja ta tsaka-tsaki (lemma) tana haɗa komai: jerin bai ɗaya mai matakai (stages) L yana ba da tsayayyiyar lamba ta gaba (leading constant) ta L/2.
Gajarta wannan jeri yana aron kayan aiki daga hanyoyin sadarwa na jerawa (sorting networks) na kimiyyar kwamfuta, tsayayyun tsare-tsaren kwatance (comparisons) da ke jera kowace shigarwa (input). Hanyar sadarwa ta jerawa mafi kyau mai shigarwa shida tana ba da matakai 96, saboda haka tsayayyiyar lamba ta 48. Hanyoyin sadarwa da ke raba wurare 24 zuwa rukunoni na 12, sannan na 4, waɗanda aka nemo ta binciken kwamfuta, suna kawo ta zuwa matakai 72 (36). A ƙarshe, ba da damar motsi da ke cakuɗa fiye da guntaye uku a lokaci guda da raba wuraren ta wata hanya daban yana kawo ta zuwa matakai 61.
Talatin da rabi
Ka’idar (theorem): kowane n×n×n cube za a iya warware shi cikin motsi 30.5 n²/lg n a mafi yawa, tare da sassan da ke zama marasa muhimmanci ga n mai girma. Tsayayyiyar lambar ta inganta da ninki fiye da 3.30 × 10³⁸, kuma ba ta wuce ninki 2.37 na iyakar ƙasa ba (30.5 / 12.88). Ga sigar n×n×1 mai faɗi (flat), wadda aka yi amfani da ita a matsayin gwajin share fage (warm-up), tsayayyiyar lambar ta sauka daga 12 ko 18 zuwa 1.5.

Firam takwas masu tazara daidai na warware cube mai layuka 256 a kowane gefe: fuskokin da aka cakuɗa suna komawa launuka ɗaya-ɗaya. — Hoto na 1.1, Mrzyglocki et al. (2026), arXiv:2611.11018.
Algorithm ɗin yana aiki a lokaci mai gwargwado da adadin guntaye, kuma marubutan sun samar da na’urar warwarewa ta buɗaɗɗen tushe (open-source solver), tare da rubutattun umarni (scripts) da ke duba kowace hanyar sadarwa da ta dogara da ita gaba ɗaya, ba tare da barin komai ba. Kwatancen da suka yi da kansu ya nuna tana gaba da na’urorin warwarewa da ake da su daga kusan n = 840; sun samar da hotunan warware cubes masu layuka 256 da 65,536 a kowane gefe.
2.37 ɗin bayani ne na asymptotic (asymptotic statement): ba a ƙayyade ƙananan sassan dabarar ba, don haka ba ta ba da ainihin adadi ga wani takamaiman cube ba. Ci gaba na gaba, a cewar marubutan, zai iya fitowa daga wasu hanyoyin haɗa guntaye zuwa hanyoyin sadarwa na jerawa da kuma daga ingantattun musaye na guntaye uku — kuma irin wannan kayan aiki zai iya magance wasu manyan wasannin wasa-ƙwaƙwalwa, ko hypercubes masu girma huɗu da biyar (four- and five-dimensional).
