{"id":14989,"date":"2023-04-02T23:59:20","date_gmt":"2023-04-02T22:59:20","guid":{"rendered":"https:\/\/blogg.ngn.nu\/?p=14989"},"modified":"2023-04-05T19:48:56","modified_gmt":"2023-04-05T18:48:56","slug":"traffat-smabarna","status":"publish","type":"post","link":"https:\/\/blogg.ngn.nu\/index.php\/2023\/04\/02\/traffat-smabarna\/","title":{"rendered":"Tr\u00e4ffat sm\u00e5barna :)"},"content":{"rendered":"

[not: publicerad: 230405]<\/span><\/p>\n

Sn\u00f6n kvar. Soligt. Bl\u00e5ser kallt. Lite mildare dock.<\/p>\n

Barnbarn<\/b>
\nDet blev en kort f\u00f6rmiddag och kort lunch sedan bar det norrut till
\nDalsland.
\nPassade sm\u00e5barna i m\u00e5nga timmar – full fart.<\/p>\n

Film<\/b>
\niFABLE The Killer Who Doesn’t Kill (2019). Tyckte den hade l\u00e5nga
\npartier med l\u00e5ngtr\u00e5kighet. Och ’Fable’ (Sato), han d\u00f6dade ju hur
\nm\u00e5nga som helst…<\/p>\n

Programmering (HTML & JavaScript)<\/b>
\n[Visa mer…]<\/a><\/p>\n

\n

[] har best\u00e4mt mig f\u00f6r att f\u00f6rst l\u00f6sa hur f\u00e4rgvalet ska g\u00e5 till. \u00c4r inte 100% n\u00f6jd med nuvarande PopUp.
\n[] Testa med en fast f\u00e4rgtabell d\u00e4r man klickar och sedan fyller i det ’bitf\u00e4lt’ som ska ha den f\u00e4rgen (d\u00e4r det g\u00e5r).
\n[] Funderar ocks\u00e5 mycket (i samband med ovan) hur r\u00f6r sig h\u00f6rnen n\u00e4r tre positioner \u00e4r inblandade?
\n[x] Har lagt in algoritmerna f\u00f6r COLL
\n[] L\u00e4gga in sekvenserna f\u00f6r COLL.
\n[] Har b\u00f6rjat l\u00e4gga in algoritmerna f\u00f6r ZZLL.
\n[] L\u00e4gga in sekvenser f\u00f6r ZZLL
\n[] Har ocks\u00e5 kikat p\u00e5 ZBLL
\n[\/] Hur r\u00f6r sig bitarna f\u00f6r respektive algoritm OLL > PLL (COLL)
\n    Har b\u00f6rjat kolla men har ingen riktigt bra smart ide om hur funktionen ska vara konstruerad?
\n>: Funderar fortfarande
\n[x] Definiera ’sekvenser’ (ID fr\u00e5n ’bitarna’). Klart.
\n[] Kombinera funktionerna f\u00f6r 2 look OLL & 2 look PLL f\u00f6r att f\u00e5 funktioner f\u00f6r;
\n[] A. s\u00f6ka igenom sekvenser f\u00f6r att hitta OLL-algoritm
\n[] B. utifr\u00e5n ber\u00e4knat resultat f\u00e5r en ny sekvens och hitta PLL-algoritm.
\n[] Presentera resultat. Har inte best\u00e4mt om det ska ske ’bredvid’ varandra eller under varandra.
\n[] Fundera p\u00e5 om det \u00e4r m\u00f6dan v\u00e4rt att \u00e4ven ta med COLL
\n[] funktion f\u00f6r att visa hur kuben ska h\u00e5llas inf\u00f6r algoritmerna.\n<\/p>\n<\/div>\n

Kuben <\/b>\"[Bild:\nRubriks<\/a>
\n[Visa mer…]<\/a><\/p>\n

\n

10 F2L[1]<\/sup>-l\u00f6st
\n0 CFOP[2]<\/sup>-l\u00f6sta[3]<\/sup><\/p>\n

Sista lagret l\u00f6ser jag genom att;
\n1. fixa till det gula korset.
\n2. v\u00e4nda kantbitarna r\u00e4tt 1-2 steg.
\n3. Placera h\u00f6rbitarna r\u00e4tt 2-steg (oftast).<\/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’[4]<\/sup>.
\nDet g\u00f6r jag mer p\u00e5 intuition och ’erfarenhet’ \u00e4n att jag f\u00f6ljer specifika algoritmer \/ sekvenser.
\n[2]<\/sup> CFOP: Cross, F2L, OLL & PLL
\n[3]<\/sup> OLL & PLL gjorde jag via mina program (som jag testar (HTML \/ JavaScript)):
\n’NGN – 2 look OLL’ & ’NGN – 2 look PLL’[5]<\/sup>.
\n[4]<\/sup> De vita kantbitarna ska allts\u00e5 st\u00e4mma \u00f6verens med centrumbitarna.<\/p>\n<\/div>\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

[not: publicerad: 230405] Sn\u00f6n kvar. Soligt. Bl\u00e5ser kallt. Lite mildare dock. Barnbarn Det blev en kort f\u00f6rmiddag och kort lunch sedan bar det norrut till Dalsland. Passade sm\u00e5barna i m\u00e5nga timmar – full fart. Film iFABLE The Killer Who Doesn’t … 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":[4],"tags":[],"class_list":["post-14989","post","type-post","status-publish","format-standard","hentry","category-vardag"],"_links":{"self":[{"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/posts\/14989","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=14989"}],"version-history":[{"count":1,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/posts\/14989\/revisions"}],"predecessor-version":[{"id":14990,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/posts\/14989\/revisions\/14990"}],"wp:attachment":[{"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/media?parent=14989"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/categories?post=14989"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/tags?post=14989"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}