From 1ee2563efcfeb6cdc9f4069b9dcf391b71fecf72 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Mike=20Schw=C3=B6rer?= Date: Sat, 3 Feb 2018 18:45:51 +0100 Subject: [PATCH] fix broken links --- www/data/images/blog/p086.gif | Bin 0 -> 2548 bytes www/fragments/blogview_euler_single.php | 2 +- www/statics/blog/bfjoust.md | 2 +- www/statics/blog/bsod.md | 4 ++-- www/statics/blog/initial.md | 6 +++--- www/statics/blog/v4.md | 2 +- .../euler/Euler_Problem-044_explanation.md | 2 +- .../euler/Euler_Problem-058_explanation.md | 2 +- .../euler/Euler_Problem-100_explanation.md | 2 +- .../programs/ExtendedGitGraph_description.md | 2 +- www/statics/programs/HexSolver_description.md | 2 +- www/statics/programs/jClipCorn_description.md | 4 ++-- 12 files changed, 15 insertions(+), 15 deletions(-) create mode 100644 www/data/images/blog/p086.gif diff --git a/www/data/images/blog/p086.gif b/www/data/images/blog/p086.gif new file mode 100644 index 0000000000000000000000000000000000000000..ad730545549bd6c73dd23243c75b449fe243b786 GIT binary patch literal 2548 zcmdUsi9geg1AxCfY-W??YP`~n%d_9NXx1#LFBnQeM+rue|lP_xJu8zvnM_p3igi7}?s!Zx(nCER%r$F*i4tl$3Pu z-aUapu(7d0p-_yBj6@=lxw$zSjn2r(AQFia6B8H==EaK_t*xz!ii%V!b!%&@q@={% z-Tl_BTPrIo`T6-^Fxb=6)5pi>*|TS7&YZ#Fa9AuB27_@p9BXT91Oh=OlT}ny)YR1A za5x^1_x1HpK@y8p>X!VyxDXSSkQY z1CSW{4FEI{tDstaocgh%Q(*%z5C3t4=n5$3+VEaCRf$T7Or_n<%`40Rv`iAIKEEuu zq!7F>%0RD@i5M{O^gI;hl~ACWNis*rUp?&z@pmR_ezu=#N|u}34RYf^bY*mQkVb&! zAJ`pYbJDB%>QX{q|UgSt?s zZhfs!&C%`$QZM={waD%3?su*vgrqp>{$1tP8Y?xtkxu(>gDoMvpa=Jfq#Mxl4zFt`B zmxEa}5rxi=LBRgJ5IYqV&#{74#9xd~Xy!AJBb{h4s`-O}#X!IM%N4AKqWC5J(ly2~ zg={ff{Ew!=9=_71HjK~9O;t>!N$QU)@w$r>Ls^@J<0&DURWa_ysXG!`bhby(W(nz zkfox19}*CAou9Ul1A44{l|Gu>%l-7(y`~yd6zX6ekw4K0$NC(*sM{}PBY$#5hIJ}8 z0K+|vp;r+NRa_Ia1KJ1%$V-`>w-GNNP1;)6XMoW^zW9Fl9I|Bur_OgT(JV7-t?R}` z2%#D>t;B|QB+w@xS+E!eHrHIi3TWJw*FT6Dmc1lAa(0jtt|J_B-Ri3VgVf6+-cWj1 zREY1dO^jlXUdMgLyKD`4bkqKDQG9c8kR54A^C*{D^{fq98AgS9)0LeR_I;7Y@0uM` zzCNbxGNVH?+N=x$e8=uB{$}Ur7JIw1kT>xs?9y}mQcF*ZS%`xo?P>w+ERVl(!%Mv?a!k; zIuI#itMJ(|AM`Ia+@SJchh%Z+6L6Kgf@I}bENuWS9p*|P3&S32M{4)r)o{ZuSS_WlR3 zu=`%{3(NDpIx+i`E!7jzzm%s#OrRse)1kL6HsO04&bnHRjh?bXM=JK$kYCU zIshTO!@<5BOd0EvrR4I6n$ep8!iRm{VgO-mcaThU?`5}%rM8Yl5SGKZ77-a>z+oX3 zgQfD_JNR+9pR|&X9NM4BtaAcj^`t-yKgGPlQQu>G06D%8&pkJ9`gh*3v!U7PP1SmX zH5RYVej3h|=fq=aUsBAv7a`=KMAKjKsZFFt4UZFxR+FoQAmg#CZJFBm(_Vm5c!M^4 z^3wh~#NZXOe_15878F`h>Z*ho=ZAI(326V)OUM}r(Ol#g*Z*hBL(%qs>b@9oPm;ymvFxbm>*W>X!%xEEHo)$W*URI znDLkk75hcXu+ys3r=nQ=PK<@i&7>X;%EuOMC9x@mmwf?@WW<9%;pGQ_cJ-%AyD+=x z2nFaiGxOA?3YwRY9%lhEv|+|oDTI+_5-Qbbm-ZeE5YoZOKz?PoZ+O-O2rd1o0|djd z92B6NgX(aU4N%-Iz1+DA7dkOMw)-53$vuQ9x`nXMh)%Fd`b8EJ9eKW=4ASHSFfL(8 zP))jh3C-Bjbbt|ooq-ZlMH}C8%-DH2Cl39@RXG_pitDF=JRwe!!gGmEiToK?TKAHs zhS}tq@=_#lMBl;h4kr?QMT)}uv|~bzRRfD=?yrLQaQ66yE!b^EtDf5>!6jNLnXxo8 zQ{T|CdLkpb2D@YP3OV0{0~0n?jQyr2TV)^s<+WS?z{dJS-{jdR9%+}wjM{OqNr8C) zabL)^Hc*&u+4jcooImk>M_Of^O8+|J1o9HBEVQ+9#cd;I`s?hMk=E|5;f=drzs> - Execution time (BefunExec): + Execution time (BefunExec): (' . (($problem['time']===0) ? '?' : number_format(($problem['steps']/$problem['time'])/1000, 2, '.', '')) . ' MHz)'; ?> diff --git a/www/statics/blog/bfjoust.md b/www/statics/blog/bfjoust.md index 860d4a9..cfa9358 100644 --- a/www/statics/blog/bfjoust.md +++ b/www/statics/blog/bfjoust.md @@ -4,7 +4,7 @@ The board consist of 10 to 30 fields, one player starts left and one player righ Your goal is to zero the enemy flag for two consecutive cycles and you loose if you either leave the board or the enemy zeroes your flag first. Of course the bots are written in brainfuck, which adds a whole lot of interesting limitations due to brainfucks minimalistic (7) set of operations. -The thing that surprised me the most is the [strategically depth](https://esolangs.org/wiki/BF_Joust_strategies) of the game (despite the simple rules and language) and the fact that there are [extremely efficient and complex programs](https://codu.org/eso/bfjoust/in_egobot/) out there. +The thing that surprised me the most is the [strategically depth](https://esolangs.org/wiki/BF_Joust_strategies) of the game (despite the simple rules and language) and the fact that there are [extremely efficient and complex programs](http://codu.org/eso/bfjoust/in_egobot/) out there. So here is my own bot *(originally made for [stackexchange](https://codegolf.stackexchange.com/questions/36645/brainfedbotsforbattling-a-brainf-tournament))*, it can't really keep up with the big ones from egojoust but I'm fairly proud of it: diff --git a/www/statics/blog/bsod.md b/www/statics/blog/bsod.md index 6319273..7b93be5 100644 --- a/www/statics/blog/bsod.md +++ b/www/statics/blog/bsod.md @@ -6,5 +6,5 @@ Some people say flying gets safer and safer ... But see for your self: I think I will use the train :D - [1]: /images/log/bsod_1.jpg - [2]: /images/log/bsod_2.jpg \ No newline at end of file + [1]: /data/images/log/bsod_1.jpg + [2]: /data/images/log/bsod_2.jpg \ No newline at end of file diff --git a/www/statics/blog/initial.md b/www/statics/blog/initial.md index e0b73a9..3f3cb01 100644 --- a/www/statics/blog/initial.md +++ b/www/statics/blog/initial.md @@ -10,6 +10,6 @@ Here is a little overview over the past versions: **v3.0:** ![version 3][3] - [1]: /images/log/ms_de_v1.jpg - [2]: /images/log/ms_de_v2.jpg - [3]: /images/log/ms_de_v3.jpg \ No newline at end of file + [1]: /data/images/log/ms_de_v1.jpg + [2]: /data/images/log/ms_de_v2.jpg + [3]: /data/images/log/ms_de_v3.jpg \ No newline at end of file diff --git a/www/statics/blog/v4.md b/www/statics/blog/v4.md index 6a0de3f..0b45b05 100644 --- a/www/statics/blog/v4.md +++ b/www/statics/blog/v4.md @@ -1,6 +1,6 @@ When you see this Log you probably notice that this site looks a whole lot different than a few days before. And you you can probably guess it **I rewrote this website completely from scratch**. -Finally there is a *real* PHP Framework behind this all ([Yii](https://www.yiiframework.com/) with [Yiistrap](https://www.getyiistrap.com/)) and my code looks kinda good and is [version controlled](https://github.com/Mikescher/www.mikescher.de). +Finally there is a *real* PHP Framework behind this all ([Yii](http://www.yiiframework.com/) with [Yiistrap](http://www.getyiistrap.com/)) and my code looks kinda good and is [version controlled](https://github.com/Mikescher/www.mikescher.de). My hopes are that I can now easier add new programs and that the whole page looks a bit more professional. If you want to see how this page has evolved over the years - here are the thumbnails of mikescher.de version `1`, `2`, `3` and the current `4`: diff --git a/www/statics/euler/Euler_Problem-044_explanation.md b/www/statics/euler/Euler_Problem-044_explanation.md index ccba3cf..2acf217 100644 --- a/www/statics/euler/Euler_Problem-044_explanation.md +++ b/www/statics/euler/Euler_Problem-044_explanation.md @@ -4,5 +4,5 @@ The problem is that you need a square root to inverse the pentagonal formula and So I needed to implement my own version of integer square roots in Befunge (see [wikipedia](https://en.wikipedia.org/wiki/Methods_of_computing_square_roots)). The program is still not really fast but it's good that I managed to speed it up to a time where you can execute it without waiting the whole night. -Also this program is nicely compact, by the time I'm writing this my Befunge interpreter [BefunExec](https://www.mikescher.de/programs/view/BefunGen) has gotten a display of all possible paths a program can take. +Also this program is nicely compact, by the time I'm writing this my Befunge interpreter [BefunExec](https://www.mikescher.de/programs/view/BefunUtils) has gotten a display of all possible paths a program can take. And if you look at the graph of this program, it looks pretty interesting... \ No newline at end of file diff --git a/www/statics/euler/Euler_Problem-058_explanation.md b/www/statics/euler/Euler_Problem-058_explanation.md index 670a234..16dc7ee 100644 --- a/www/statics/euler/Euler_Problem-058_explanation.md +++ b/www/statics/euler/Euler_Problem-058_explanation.md @@ -1,4 +1,4 @@ It's obvious that the bottleneck of this program is the primality test. The numbers become here too big to create a sieve and "normal" prime testing takes too long. -So we use the [Miller-Rabin primality test](https://en.wikipedia.org/wiki/Miller-Rabin_primality_test) that I implemented a while ago (thank [mathblog.dk](https://http://www.mathblog.dk)). +So we use the [Miller-Rabin primality test](https://en.wikipedia.org/wiki/Miller-Rabin_primality_test) that I implemented a while ago (thank [mathblog.dk](http://www.mathblog.dk)). The rest is just enumerating all the diagonals until `primes*10 Use this software only in a country which allows for private copies of your bought DVD's. > Use this software only to manage copies of movies which you own. -![main-view](README-FILES/main-view.png) +![main-view](https://raw.githubusercontent.com/Mikescher/jClipCorn/master/README-FILES/main-view.png) ### Main Features @@ -25,7 +25,7 @@ jClipCorn #[> DOWNLOAD](https://www.github.com/Mikescher/jClipCorn/releases) ###[> HOMEPAGE](https://www.mikescher.com/programs/view/jClipCorn) ###[> GITHUB WIKI](https://github.com/Mikescher/jClipCorn/wiki) -###[> CHANGELOG](https://raw.githubusercontent.com/Mikescher/jClipCorn/master/changelog.txt) +###[> CHANGELOG](https://raw.githubusercontent.com/Mikescher/jClipCorn/master/CHANGELOG.txt) ### Organization