bef93-runner blogpost

www/statics/blog/js_befrunner.md

@@ -0,0 +1,41 @@
+Primarily for my [project euler solutions](/blog/1/Project_Euler_with_Befunge) I wrote a small
+javascript befunge-93 runner (without befunge93 size restrictions, as with most stuff on this site).
+
+The code is note really optimized and will only run on newer browsers, but it's good enough to play a bit around.
+
+Press **[Start]** to run the code, **[Edit]** to change the code and change the interpreter speed with the button on the right side of the **[Start]** button.
+
+
+~~~befungerunner__speed-2
+0".omed s"v
+          "                       >v
+          i                        8
+                                   4
+          s             >       > ^*
+          i    >99+0g1+#^_77+0g#^_188+0p099+0p>  v
+          h    ^        <          #            <
+          T    >88+0g1+#^_66+0g#^_088+0p01-99+0p^
+          "    ^        <         <#             #<
+>         v    >99+0g1-#^_77+0g8-#^_01-88+0p099+0p^
+|   >#:>#,<    ^        <         <#            <2
+               >88+0g1-#^_66+0g8-#^_088+0p199+0p^2
+>0>:"#"\0p:5 v ^                   $             g
+v_^#!\+1\!`+4< ^p0+77+g0+99g0+77<  >66+0g1+v     v
+>1-:"#"\v      >66+0g88+0g+66+0p^  v+1g0+77<     8
+|`0:p+19<      ^                   g             4
+>:"#"\0\p:v>   ^<                  -             *
+|\+1\!`+45<^p0+<               v" "_"@"v         -
+>1-:"#"\ v>p099^^     <        >66+v+66<         #
+|`0:p\+19<^0+88<^      p+1g0+77+1g0<       >" " #< v
+$>-66+0p077+0p1^ vp+2g0+67+2g0+56 < pp0+67:0+560<|#<
+01               :    #    v    p0 +76+1g< >"#" #< ^
+>^               >65+0g6- #v_01-65+0p67+0^
+                      ^ $ <>76+0gv#
+                          ^     <> 7-v
+                                ^_v#!<
+                                  #
+                           >+56+0p^
+                           ^1g0+56<
+~~~
+
+You can find the code either directly by looking at the file *blogpost_bef93runner.js* on this site, or on [github](https://github.com/Mikescher/www.mikescher.com).

www/statics/euler/Euler_Problem-008_explanation.md

@@ -1 +1,3 @@
-These kinds of problems are fun in Befunge because you can just copy the input into your program and it becomes a part of your source code.
+These kinds of problems are fun in Befunge because you can just copy the input into your program and it becomes a part of your source code.
+
+The rest is just walking through all possible values and printing the largest