Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions

fix broken links

Browse Source
This commit is contained in:
Mike Schwörer 2018-02-03 18:45:51 +01:00
parent 77a879294a
commit 1ee2563efc
Signed by: Mikescher
GPG Key ID: D3C7172E0A70F8CF
12 changed files with 15 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
www/data/images/blog/p086.gif Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 2.5 KiB

2
www/fragments/blogview_euler_single.php
View File

@ -72,7 +72,7 @@ $max = ceil($max / 20) * 20;
<td><?php echo number_format($problem['steps'], 0, null, ' '); ?></td>
</tr>
<tr>
<td><b>Execution time</b> (<a href="/programs/view/BefunGen">BefunExec</a>):</td>
<td><b>Execution time</b> (<a href="/programs/view/BefunUtils">BefunExec</a>):</td>
<td><?php echo formatMilliseconds($problem['time']) . ' <i>(' . (($problem['time']===0) ? '?' : number_format(($problem['steps']/$problem['time'])/1000, 2, '.', '')) . ' MHz)</i>'; ?></td>
</tr>
<tr>

2
www/statics/blog/bfjoust.md
View File

@ -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:

4
www/statics/blog/bsod.md
View File

@ -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
[1]: /data/images/log/bsod_1.jpg
[2]: /data/images/log/bsod_2.jpg

6
www/statics/blog/initial.md
View File

@ -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
[1]: /data/images/log/ms_de_v1.jpg
[2]: /data/images/log/ms_de_v2.jpg
[3]: /data/images/log/ms_de_v3.jpg

2
www/statics/blog/v4.md
View File

@ -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`:

2
www/statics/euler/Euler_Problem-044_explanation.md
View File

@ -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...

2
www/statics/euler/Euler_Problem-058_explanation.md
View File

@ -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<all`

2
www/statics/euler/Euler_Problem-100_explanation.md
View File

@ -24,7 +24,7 @@ b = 1/2 ( sqrt(2n^2 - 2n + 1) + 1 )
For the last formula we search for integer solutions.
We can now either solve this manually with diophantine equations,
or we ask [Wolfram|Alpha](www.wolframalpha.com/input/?i=2*b*b-2b+%3D+n*n-n).
or we ask [Wolfram|Alpha](https://www.wolframalpha.com/input/?i=2*b*b-2b+%3D+n*n-n).
Which gives us the following two formulas:
~~~

2
www/statics/programs/ExtendedGitGraph_description.md
View File

@ -5,7 +5,7 @@ Displays a Commit Table for every of your github-years.
This is practically a copy of githubs Commit-Graph functionality.
But with the extra feature of showing commits older than a year, from private repositories abd from other git remotes.
*See it live in action [here](https://www.mikescher.de/about)*
*See it live in action [here](https://www.mikescher.com/about)*
### How to use:

2
www/statics/programs/HexSolver_description.md
View File

@ -1,4 +1,4 @@
An automatic solver for [Hexcells](http://www.matthewbrowngames.com/hexcells.html), [Hexcells Plus](http://www.matthewbrowngames.com/hexcellsplus.html) and [Hexcells Infinite](http://www.matthewbrowngames.com/hexcellsinfinite.html).
An automatic solver for [Hexcells](http://www.matthewbrowngames.com), [Hexcells Plus](http://www.matthewbrowngames.com) and [Hexcells Infinite](http://www.matthewbrowngames.com).
The idea is to automatically parse the game state, find the next (valid) step and execute it.
*(Rinse and Repeat until everything is solved)*

4
www/statics/programs/jClipCorn_description.md
View File

@ -8,7 +8,7 @@ jClipCorn
> 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