{"id":14876,"date":"2023-03-07T22:35:52","date_gmt":"2023-03-07T21:35:52","guid":{"rendered":"https:\/\/blogg.ngn.nu\/?p=14876"},"modified":"2023-03-07T22:38:29","modified_gmt":"2023-03-07T21:38:29","slug":"tisdag-inne-hela-dagen","status":"publish","type":"post","link":"https:\/\/blogg.ngn.nu\/index.php\/2023\/03\/07\/tisdag-inne-hela-dagen\/","title":{"rendered":"Tisdag – Inne hela dagen…"},"content":{"rendered":"

Sn\u00f6ig dag…<\/p>\n

Vila<\/b>
\nTr\u00f6tt. Inte riktigt s\u00e5 tr\u00f6tt som ig\u00e5r.<\/p>\n

Programmering (HTML & JavaScript)<\/b>
\n[x] Funktion[er] som h\u00e5ller koll p\u00e5 h\u00f6rnbitarna (kantbitarna \u00e4r redan fixade). Nu s\u00e5 attans! Ser det ut som att jag fixat till det \ud83d\ude00<\/p>\n

H\u00e4rn\u00e4st<\/u>:
\n[] Funktion som kontrollerar om det finns n\u00e5gon l\u00e4mplig 2 look PLL sekvens \/ algoritm.
\nSka s\u00e4tta ig\u00e5ng med att analysera vilka olika situationer som kan upptr\u00e4da n\u00e4r F2L \u00e4r klart samt OLL.
\nT.ex. (enligt en guide p\u00e5 cuboss.se):
\nH\u00f6rnbitarna:
\nA-perm;
\nOm tv\u00e5 h\u00f6rnbitar av samma f\u00e4rg \u00e4r v\u00e4nda \u00e5t samma sida (4 situationer) –
\ns\u00e5 kan f\u00f6ljande sekvens utf\u00f6ras, efter att man v\u00e4nt det \u00f6vre lagret fr\u00e5n sig;
\nLw’ (U R’ D2( (R U’ R’) (D2 R2)<\/p>\n

E-perm;
\nOm h\u00f6rnbitar ska byta plats ’rakt \u00f6ver’ – alla fyra –\u00a0 ser ut som att det endast skulle kunna uppst\u00e5 vid en situation – (fram\u00e5t-bak\u00e5t-r\u00f6relse, ska skiftet g\u00f6ras fr\u00e5n sida till sida s\u00e5 v\u00e4nds kuben s\u00e5 att r\u00f6relse sker ’fram\u00e5t-bak\u00e5t’);
\nx’ (R U’ R’ D) (R U R’ D’) (R U R’ D) (R U’ R’ D’)<\/p>\n

och:
\n[] En funktion som uppm\u00e4rksammar p\u00e5 ’om\u00f6jliga’ val (kantbitarna) – om det beh\u00f6vs.<\/p>\n

Testa (betan) f\u00f6r 2 look OLL H\u00c4R<\/a>.<\/p>\n

Kuben \"[Bild:<\/a><\/b>
\n20 F2L[1]<\/sup>-l\u00f6sta<\/p>\n

Sista lagret l\u00f6ser jag genom att;
\n1. fixa till det gula korset, 1-2 steg.
\n2. v\u00e4nda kantbitarna r\u00e4tt 1-2 steg.
\n3. Placera h\u00f6rbitarna r\u00e4tt 2-steg (oftast).
\nB\u00f6rjar ’irritera’ mig p\u00e5 att det nu g\u00e5r snabbare ett fixa Cross + F2L j\u00e4mf\u00f6rt med\u00a0 ’Gola Korset’ + kantbitarna + h\u00f6rnbitarna.<\/p>\n

F\u00e5r samla lite mental kraft \u00e5 tag tag i programmerandet av min hj\u00e4lpreda f\u00f6r 2 look PLL (2 look OLL \u00e4r ju klar).<\/p>\n

[1]<\/sup> F2L: F<\/b>irst 2<\/b> L<\/b>ayer – man l\u00f6ser dem liksom ’samtidigt’ – efter att ha fixat hela ’vita korset’[2]<\/sup>. Det g\u00f6r jag mer p\u00e5 intuition och ’erfarenhet’ \u00e4n att jag f\u00f6ljer specifika algoritmer \/ sekvenser.
\n[2]<\/sup> De vita kantbitarna ska allts\u00e5 st\u00e4mma \u00f6verens med centrumbitarna.<\/p>\n","protected":false},"excerpt":{"rendered":"

Sn\u00f6ig dag… Vila Tr\u00f6tt. Inte riktigt s\u00e5 tr\u00f6tt som ig\u00e5r. Programmering (HTML & JavaScript) [x] Funktion[er] som h\u00e5ller koll p\u00e5 h\u00f6rnbitarna (kantbitarna \u00e4r redan fixade). Nu s\u00e5 attans! Ser det ut som att jag fixat till det \ud83d\ude00 H\u00e4rn\u00e4st: [] … Forts\u00e4tt l\u00e4sa →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1258,1037,448,392,1034,4],"tags":[747,311,1023,215],"class_list":["post-14876","post","type-post","status-publish","format-standard","hentry","category-diverse","category-hobby","category-halsa","category-programmering","category-trott","category-vardag","tag-html","tag-javascript","tag-rubiks-kub","tag-vila"],"_links":{"self":[{"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/posts\/14876","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/comments?post=14876"}],"version-history":[{"count":3,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/posts\/14876\/revisions"}],"predecessor-version":[{"id":14879,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/posts\/14876\/revisions\/14879"}],"wp:attachment":[{"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/media?parent=14876"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/categories?post=14876"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/tags?post=14876"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}