{"id":14993,"date":"2023-04-04T23:59:25","date_gmt":"2023-04-04T22:59:25","guid":{"rendered":"https:\/\/blogg.ngn.nu\/?p=14993"},"modified":"2023-04-05T20:02:18","modified_gmt":"2023-04-05T19:02:18","slug":"tisdag-grunddatafunderande","status":"publish","type":"post","link":"https:\/\/blogg.ngn.nu\/index.php\/2023\/04\/04\/tisdag-grunddatafunderande\/","title":{"rendered":"Tisdag &#8211; Grunddatafunderande"},"content":{"rendered":"<p><span style=\"font-size: 10px;\">[not: publicerad: 230405]<\/span><\/p>\n<p> Sn\u00f6n kvar. Soligt. Kyligt p\u00e5 morgonen.<\/p>\n<p><b>Damma<\/b><br \/>\nSt\u00e5r det p\u00e5 schemat idag.<br \/>\nF\u00e4rdigdammat p\u00e5 rekordtid, 2tim \ud83d\ude42<\/p>\n<p><b>Utem\u00f6bler<\/b><br \/>\nEnligt &#8217;chefen&#8217; s\u00e5 \u00e4r det idag dags f\u00f6r utem\u00f6blerna att komma p\u00e5<br \/>\nplats.<br \/>\nFixade det ocks\u00e5. bara det vita lilla bordet p\u00e5 framsidan kvar (st\u00e5r<br \/>\ni f\u00f6rr\u00e5det).<\/p>\n<p><b>Film<\/b><br \/>\nEnola Holmes 2 (2022)<\/span><\/span>. Trevlig film \ud83d\ude42<\/p>\n<p><b>Programmering (HTML &amp; JavaScript)<\/b><br \/>\n<a id=\"Programmering\" style=\"background-color: #ffffcc; cursor: pointer\" onclick=\"expand(this.id+'_230405_200424', this);\">[Visa mer&#8230;]<\/a><\/p>\n<div id=\"Programmering_230405_200424\" style=\"border: 1px solid grey; display: none\">\n<p>[x] Har kommit p\u00e5 hur jag ska ber\u00e4kna h\u00f6rnbitarnas orientering och f\u00e4rger \ud83d\ude42<br \/>\n[] \u00c5terst\u00e5r att knappa in en massa kodrader (om det nu inte g\u00e5r att f\u00f6renkla via en funktion \u2753<br \/>\n[] Funderar p\u00e5 om jag ska via utseendet p\u00e5 det gula (inf\u00f6r OLL) f\u00f6r att klura ut hur 4:e h\u00f6rbiten ska orienteras.<br \/>\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.<br \/>\n[] Testa med en fast f\u00e4rgtabell d\u00e4r man klickar och sedan fyller i det &#8217;bitf\u00e4lt&#8217; som ska ha den f\u00e4rgen (d\u00e4r det g\u00e5r).<br \/>\n[] Funderar ocks\u00e5 mycket (i samband med ovan) hur r\u00f6r sig h\u00f6rnen n\u00e4r tre positioner \u00e4r inblandade?<br \/>\n[x] Har lagt in algoritmerna f\u00f6r COLL<br \/>\n[] L\u00e4gga in sekvenserna f\u00f6r COLL.<br \/>\n[] Har b\u00f6rjat l\u00e4gga in algoritmerna f\u00f6r ZZLL.<br \/>\n[] L\u00e4gga in sekvenser f\u00f6r ZZLL<br \/>\n[] Har ocks\u00e5 kikat p\u00e5 ZBLL<br \/>\n[\/] Hur r\u00f6r sig bitarna f\u00f6r respektive algoritm OLL &gt; PLL (COLL)<br \/>\n&nbsp;&nbsp;&nbsp; Har b\u00f6rjat kolla men har ingen riktigt bra smart ide om hur funktionen ska vara konstruerad?<br \/>\n&gt;: Funderar fortfarande<br \/>\n[x] Definiera &#8217;sekvenser&#8217; (ID fr\u00e5n &#8217;bitarna&#8217;). Klart.<br \/>\n[] Kombinera funktionerna f\u00f6r 2 look OLL &amp; 2 look PLL f\u00f6r att f\u00e5 funktioner f\u00f6r;<br \/>\n[] A. s\u00f6ka igenom sekvenser f\u00f6r att hitta OLL-algoritm<br \/>\n[] B. utifr\u00e5n ber\u00e4knat resultat f\u00e5r en ny sekvens och hitta PLL-algoritm.<br \/>\n[] Presentera resultat. Har inte best\u00e4mt om det ska ske &#8217;bredvid&#8217; varandra eller under varandra.<br \/>\n[] Fundera p\u00e5 om det \u00e4r m\u00f6dan v\u00e4rt att \u00e4ven ta med COLL<br \/>\n[] funktion f\u00f6r att visa hur kuben ska h\u00e5llas inf\u00f6r algoritmerna.<\/p>\n<\/div>\n<p><!-- Slut Programmering --><b>Kuben <\/b><a><img title=\"Rubriks Kub\"\nsrc=\"http:\/\/ngn.nu\/Pict\/2023\/230108-Rubriks_Kub.png\" alt=\"[Bild:\nRubriks kub]\" border=\"0\" width=\"15\" height=\"15\"><\/a><br \/>\n<a id=\"Kuben\" style=\"background-color: #ffffcc; cursor: pointer\" onclick=\"expand(this.id+'_230405_210425', this);\">[Visa mer&#8230;]<\/a><\/p>\n<div id=\"Kuben_230405_210425\" style=\"border: 1px solid grey; display: none\">\n<p>10 F2L<sup>[1]<\/sup>-l\u00f6st<br \/>\n0 CFOP<sup>[2]<\/sup>-l\u00f6sta<sup>[3]<\/sup><\/p>\n<p>Sista lagret l\u00f6ser jag genom att;<br \/>\n1. fixa till det gula korset.<br \/>\n2. v\u00e4nda kantbitarna r\u00e4tt 1-2 steg.<br \/>\n3. Placera h\u00f6rbitarna r\u00e4tt 2-steg (oftast).<\/p>\n<p><sup>[1]<\/sup> F2L: <b>F<\/b>irst <b>2<\/b> <b>L<\/b>ayer &#8211; man l\u00f6ser dem liksom &#8217;samtidigt&#8217; &#8211; efter att ha fixat hela &#8217;vita korset&#8217;<sup>[4]<\/sup>.<br \/>\nDet g\u00f6r jag mer p\u00e5 intuition och &#8217;erfarenhet&#8217; \u00e4n att jag f\u00f6ljer specifika algoritmer \/ sekvenser.<br \/>\n<sup>[2]<\/sup> CFOP: Cross, F2L, OLL &amp; PLL<br \/>\n<sup>[3]<\/sup> OLL &amp; PLL gjorde jag via mina program (som jag testar (HTML \/ JavaScript)):<br \/>\n&#8217;NGN &#8211; 2 look OLL&#8217; &amp; &#8217;NGN &#8211; 2 look PLL&#8217;<sup>[5]<\/sup>.<br \/>\n<sup>[4]<\/sup> De vita kantbitarna ska allts\u00e5 st\u00e4mma \u00f6verens med centrumbitarna.<\/p>\n<\/div>\n<p><!-- Slut Kuben --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>[not: publicerad: 230405] Sn\u00f6n kvar. Soligt. Kyligt p\u00e5 morgonen. Damma St\u00e5r det p\u00e5 schemat idag. F\u00e4rdigdammat p\u00e5 rekordtid, 2tim \ud83d\ude42 Utem\u00f6bler Enligt &#8217;chefen&#8217; s\u00e5 \u00e4r det idag dags f\u00f6r utem\u00f6blerna att komma p\u00e5 plats. Fixade det ocks\u00e5. bara det vita &hellip; <a href=\"https:\/\/blogg.ngn.nu\/index.php\/2023\/04\/04\/tisdag-grunddatafunderande\/\">Forts\u00e4tt l\u00e4sa <span class=\"meta-nav\">&rarr;<\/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-14993","post","type-post","status-publish","format-standard","hentry","category-vardag"],"_links":{"self":[{"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/posts\/14993","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=14993"}],"version-history":[{"count":2,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/posts\/14993\/revisions"}],"predecessor-version":[{"id":14995,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/posts\/14993\/revisions\/14995"}],"wp:attachment":[{"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/media?parent=14993"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/categories?post=14993"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogg.ngn.nu\/index.php\/wp-json\/wp\/v2\/tags?post=14993"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}