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

fix https links

Browse Source
This commit is contained in:
Mike Schwörer 2018-02-03 16:50:58 +01:00
parent f7111555a0
commit 2bb453132f
Signed by: Mikescher
GPG Key ID: D3C7172E0A70F8CF
30 changed files with 59 additions and 59 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
www/pages/admin.php
View File

@ -38,7 +38,7 @@ function dumpConsistency($c) {
<link rel="icon" type="image/png" href="/data/images/favicon.png"/> <link rel="icon" type="image/png" href="/data/images/favicon.png"/>
<link rel="canonical" href="https://www.mikescher.com/about"/> <link rel="canonical" href="https://www.mikescher.com/about"/>
<?php printCSS(); ?> <?php printCSS(); ?>
<?php includeScriptOnce("http://code.jquery.com/jquery-latest.min.js", true, '') ?> <?php includeScriptOnce("https://code.jquery.com/jquery-latest.min.js", true, '') ?>
<?php includeScriptOnce("/data/javascript/admin.js", true, 'defer') ?> <?php includeScriptOnce("/data/javascript/admin.js", true, 'defer') ?>
</head> </head>
<body> <body>

2
www/pages/books_list.php
View File

@ -27,7 +27,7 @@ $allbooks = Books::listAllNewestFirst();
<p> <p>
These are some books I read but that do not have an official print version.<br /> These are some books I read but that do not have an official print version.<br />
So I type-setted them myself (mostly in <a href="http://www.lyx.org/">LyX</a>) and printed them <a href="https://www.epubli.de/">online</a>.<br /> So I type-setted them myself (mostly in <a href="https://www.lyx.org/">LyX</a>) and printed them <a href="https://www.epubli.de/">online</a>.<br />
I do <b>not</b> own the rights of any of these books.<br /> I do <b>not</b> own the rights of any of these books.<br />
The LyX files and generated PDF's are public and everyone who wants can print them on his own. The LyX files and generated PDF's are public and everyone who wants can print them on his own.
</p> </p>

12
www/statics/blog/befunge93.md
View File

@ -474,9 +474,9 @@ Character | Name | Description
[^pfix]: Postfix = [Postfix notation][6] [^pfix]: Postfix = [Postfix notation][6]
[1]: http://i.imgur.com/Jkks7Uy.gif?1 [1]: https://i.imgur.com/Jkks7Uy.gif?1
[2]: http://i.imgur.com/Z5Ljr5Z.gif?1 [2]: https://i.imgur.com/Z5Ljr5Z.gif?1
[3]: http://i.imgur.com/82FKwkM.gif?1 [3]: https://i.imgur.com/82FKwkM.gif?1
[4]: http://i.imgur.com/AqpsPRW.gif?1 [4]: https://i.imgur.com/AqpsPRW.gif?1
[5]: http://i.imgur.com/rxqZhIJ.gif?1 [5]: https://i.imgur.com/rxqZhIJ.gif?1
[6]: http://en.wikipedia.org/wiki/Reverse_Polish_notation [6]: https://en.wikipedia.org/wiki/Reverse_Polish_notation

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

@ -1,12 +1,12 @@
[Brainfuck Joust](http://esolangs.org/wiki/BF_Joust) is a tournament for Bots written in [brainfuck](http://esolangs.org/wiki/Brainfuck) *(or at least in a brainfuck-like language)*. [Brainfuck Joust](https://esolangs.org/wiki/BF_Joust) is a tournament for Bots written in [brainfuck](https://esolangs.org/wiki/Brainfuck) *(or at least in a brainfuck-like language)*.
The board consist of 10 to 30 fields, one player starts left and one player right. The value of every field goes from `-127` to `128` and then wraps around, every field has a value of zero, except the two starting fields (the "flags"), they have a value of `128`. The board consist of 10 to 30 fields, one player starts left and one player right. The value of every field goes from `-127` to `128` and then wraps around, every field has a value of zero, except the two starting fields (the "flags"), they have a value of `128`.
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. 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](http://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. 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.
So here is my own bot *(originally made for [stackexchange](http://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: 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:
``` ```
> # Build 9 big decoys > # Build 9 big decoys

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

@ -66,7 +66,7 @@ Here my (growing) collection of C# format specifier, this is not a complete list
"{0:#,##0,,, bill}" // (number/1000/1000/1000) billion "{0:#,##0,,, bill}" // (number/1000/1000/1000) billion
``` ```
> **see: ** [stackoverflow.com](http://stackoverflow.com/questions/11731996/string-format-numbers-thousands-123k-millions-123m-billions-123b) > **see: ** [stackoverflow.com](https://stackoverflow.com/questions/11731996/string-format-numbers-thousands-123k-millions-123m-billions-123b)
###Right align currency ###Right align currency
@ -74,7 +74,7 @@ Here my (growing) collection of C# format specifier, this is not a complete list
"{0,10:#,##0.00}" // Right aligned & always 2 decimal places "{0,10:#,##0.00}" // Right aligned & always 2 decimal places
``` ```
> **see: ** [stackoverflow.com](http://stackoverflow.com/questions/7422625/right-align-currency-in-string-format) > **see: ** [stackoverflow.com](https://stackoverflow.com/questions/7422625/right-align-currency-in-string-format)
###Align strings ###Align strings

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

@ -1,14 +1,14 @@
When you see this Log you probably notice that this site looks a whole lot different than a few days before. 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**. 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](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). 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).
My hopes are that I can now easier add new programs and that the whole page looks a bit more professional. 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`: 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`:
![version 1](/images/log/ms_de_v1.jpg) ![version 1](/data/images/log/ms_de_v1.jpg)
![version 2](/images/log/ms_de_v2.jpg) ![version 2](/data/images/log/ms_de_v2.jpg)
![version 3](/images/log/ms_de_v3.jpg) ![version 3](/data/images/log/ms_de_v3.jpg)
![version 4](/images/log/ms_de_v4.jpg) ![version 4](/data/images/log/ms_de_v4.jpg)
Also look at the new [Blog section](/blog), for now there is not much content but perhaps that will change over te next few months. Also look at the new [Blog section](/blog), for now there is not much content but perhaps that will change over te next few months.

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

@ -1 +1 @@
Finally a opportunity to use my favorite algorithm: [The sieve of Eratosthenes.](http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes) Finally a opportunity to use my favorite algorithm: [The sieve of Eratosthenes.](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)

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

@ -1,2 +1,2 @@
The main thing here was sorting the list. I used [bubble sort](http://en.wikipedia.org/wiki/Bubble_sort), which is not the fastest algorithm but was pretty easy to implement in befunge. The main thing here was sorting the list. I used [bubble sort](https://en.wikipedia.org/wiki/Bubble_sort), which is not the fastest algorithm but was pretty easy to implement in befunge.
The rest is just calculating the single scores. The rest is just calculating the single scores.

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

@ -1,4 +1,4 @@
If you looked at the previous problems you probably know what comes now ... (Sieve of Eratosthenes)[http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes]. If you looked at the previous problems you probably know what comes now ... (Sieve of Eratosthenes)[https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes].
To lower the amount of A-B combinations we have to check here are 2 rules I found out: To lower the amount of A-B combinations we have to check here are 2 rules I found out:
- `B` must be a (positive) prime, otherwise n=0 wouldn't yield a prime number - `B` must be a (positive) prime, otherwise n=0 wouldn't yield a prime number

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

@ -2,5 +2,5 @@ This one was relaxing. You can simple iterate through all 8100 cases and test ea
Three notable things: Three notable things:
- You can test two fraction `a/b` and `c/d` simple of equality with the formula `a*d == b*c`. - You can test two fraction `a/b` and `c/d` simple of equality with the formula `a*d == b*c`.
- This is my compact [GCD algorithm](http://en.wikipedia.org/wiki/Euclidean_algorithm) in befunge (stack -> stack) - This is my compact [GCD algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm) in befunge (stack -> stack)
- This is one of the few *real* Befunge-93 programs in this series. (It doesn't violate the [80x25](https://github.com/catseye/Befunge-93/blob/master/doc/Befunge-93.markdown) size rule) - This is one of the few *real* Befunge-93 programs in this series. (It doesn't violate the [80x25](https://github.com/catseye/Befunge-93/blob/master/doc/Befunge-93.markdown) size rule)

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

@ -1,2 +1,2 @@
Thats one big [sieve](http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes), even though not as big as the on in problem 10. Thats one big [sieve](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes), even though not as big as the on in problem 10.
Here we needed a way to "rotate" a number: `value = value%10 * 10^digitcount + value/10`. The rest is standard befunge stuff and trying to optimize it. Here we needed a way to "rotate" a number: `value = value%10 * 10^digitcount + value/10`. The rest is standard befunge stuff and trying to optimize it.

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

@ -1,8 +1,8 @@
My first attempt at this problem took over 5 hours to compute and had a complexity of O(n^3). My first attempt at this problem took over 5 hours to compute and had a complexity of O(n^3).
The problem is that you need a square root to inverse the pentagonal formula and Befunge has no square root function. The problem is that you need a square root to inverse the pentagonal formula and Befunge has no square root function.
So I needed to implement my own version of integer square roots in Befunge (see [wikipedia](http://en.wikipedia.org/wiki/Methods_of_computing_square_roots)). 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. 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](http://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/BefunGen) 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... And if you look at the graph of this program, it looks pretty interesting...

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

@ -1,4 +1,4 @@
I really missed my [sieve of erastothenes](http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes). There were really a few problems without primes in a row. I really missed my [sieve of erastothenes](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes). There were really a few problems without primes in a row.
In this problem we go through all primes `i`, search through all smaller primes `j` were `(i-j)/2` is a quadratic number. If you can't find one, this falsifies the theorem. In this problem we go through all primes `i`, search through all smaller primes `j` were `(i-j)/2` is a quadratic number. If you can't find one, this falsifies the theorem.

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

@ -5,6 +5,6 @@ This is only an approximation, but a rather good one. In tested the numbers from
So now we've got the numbers where `digit_product(p) == digit_product(p+3330) == digit_product(p+6660)` (in fact there are only 40 of these). So now we've got the numbers where `digit_product(p) == digit_product(p+3330) == digit_product(p+6660)` (in fact there are only 40 of these).
We then use a simple primality test to check if all three numbers are prime. We then use a simple primality test to check if all three numbers are prime.
The primality test is basically a port of the [wikipedia](http://en.wikipedia.org/wiki/Primality_test) version to befunge. Wit it we only have to do `n/6` divisions to test a number `n` for primality. The primality test is basically a port of the [wikipedia](https://en.wikipedia.org/wiki/Primality_test) version to befunge. Wit it we only have to do `n/6` divisions to test a number `n` for primality.
All in all tis leads to a fast, small and not very grid-intensive program (Only one field is used, *and only as a temporary storage to swap three values*). All in all tis leads to a fast, small and not very grid-intensive program (Only one field is used, *and only as a temporary storage to swap three values*).

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

@ -2,7 +2,7 @@ This is effectively an optimized implementation of [this algorithm](http://www.m
You can see the ten patterns on the left side and beside them the area were we build our numbers. You can see the ten patterns on the left side and beside them the area were we build our numbers.
So what we do is iterate through the numbers from `100` to `1 000`, through the ten patterns and through the digits `0`, `1` and `2`. So what we do is iterate through the numbers from `100` to `1 000`, through the ten patterns and through the digits `0`, `1` and `2`.
In each iteration we generate the number (from value, pattern and digit) and test for it primeness (with a simple [primality test](http://en.wikipedia.org/wiki/Primality_test) - no prime sieve). In each iteration we generate the number (from value, pattern and digit) and test for it primeness (with a simple [primality test](https://en.wikipedia.org/wiki/Primality_test) - no prime sieve).
If we found a prime we count the number of primes in it's family and if this count is eight we print the generated number and exit. If we found a prime we count the number of primes in it's family and if this count is eight we print the generated number and exit.
This program is not the fastest, because I check all the primes "manually" and not with an prime sieve each iteration takes quite a time. This program is not the fastest, because I check all the primes "manually" and not with an prime sieve each iteration takes quite a time.

6
www/statics/euler/Euler_Problem-053_explanation.md
View File

@ -1,17 +1,17 @@
*That* is the kind of problem I really like. There is a lot of depth in the solution and a proper algorithm solves this in no time. *That* is the kind of problem I really like. There is a lot of depth in the solution and a proper algorithm solves this in no time.
The algorithm idea here is that we use the properties of [Pascal's Triangle](http://en.wikipedia.org/wiki/Pascal%27s_triangle). The algorithm idea here is that we use the properties of [Pascal's Triangle](https://en.wikipedia.org/wiki/Pascal%27s_triangle).
As you probably know this triangle starts at its top with a `1`. Then every cell is calculated as the sum of the two cells above it. As you probably know this triangle starts at its top with a `1`. Then every cell is calculated as the sum of the two cells above it.
~~~ ~~~
cell[y][x] = cell[y-1][x-1] + cell[y-1][x] cell[y][x] = cell[y-1][x-1] + cell[y-1][x]
~~~ ~~~
![Animated GIF of Pascals Triangle. (c) by Wikimedia Foundation](http://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif) ![Animated GIF of Pascals Triangle. (c) by Wikimedia Foundation](https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif)
When we calculate `C(n, r)` this is nothing more than the number at row *n* and column *r*. When we calculate `C(n, r)` this is nothing more than the number at row *n* and column *r*.
So what we do is build [Pascal's Triangle](http://en.wikipedia.org/wiki/Pascal%27s_triangle) up to a height of one-hundred and look at the cells with values greater than one million. So what we do is build [Pascal's Triangle](https://en.wikipedia.org/wiki/Pascal%27s_triangle) up to a height of one-hundred and look at the cells with values greater than one million.
The obvious problem is that the numbers grow extremely big, and sooner or later *(probably sooner)* the numbers will overflow. So what we do is use a little trick: The obvious problem is that the numbers grow extremely big, and sooner or later *(probably sooner)* the numbers will overflow. So what we do is use a little trick:
As soon as a cell is over `1 000 000` we mark her *(= put a zero in that cell)*. When we create a new cell out of its two parents we check if one of the parents has the mark *(= is zero)* and then the children gets also marked. Because if one of the parents (or both) is over one million then all of its children will also be over one million. As soon as a cell is over `1 000 000` we mark her *(= put a zero in that cell)*. When we create a new cell out of its two parents we check if one of the parents has the mark *(= is zero)* and then the children gets also marked. Because if one of the parents (or both) is over one million then all of its children will also be over one million.

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. 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. 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](http://en.wikipedia.org/wiki/Miller-Rabin_primality_test) that I implemented a while ago (thank [mathblog.dk](http://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](https://http://www.mathblog.dk)).
The rest is just enumerating all the diagonals until `primes*10<all` The rest is just enumerating all the diagonals until `primes*10<all`

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

@ -7,7 +7,7 @@ We generate primes from `1` to `3300` and save verified pairs in an Hashmap.
And when I say Hashmap I mean an *fucking* `3000x3000` array where every possible pair has an field (yay for befunge). And when I say Hashmap I mean an *fucking* `3000x3000` array where every possible pair has an field (yay for befunge).
I had to use quite a few codesnippets from older project: I had to use quite a few codesnippets from older project:
My standard [sieve of eratosthenes](http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes), an implementation of the [Miller-Rabin primality test](http://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test) and method to [concatenate two numbers](http://www.mathblog.dk/files/euler/Problem60.cs). My standard [sieve of eratosthenes](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes), an implementation of the [Miller-Rabin primality test](https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test) and method to [concatenate two numbers](http://www.mathblog.dk/files/euler/Problem60.cs).
In the end is to say that in befunge the program size is normally an good indicator for the runtime (not really, but its kinda correct for all my programs). In the end is to say that in befunge the program size is normally an good indicator for the runtime (not really, but its kinda correct for all my programs).
So as you probably guessed this program takes a pretty loooooong time to complete. So as you probably guessed this program takes a pretty loooooong time to complete.

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

@ -1,4 +1,4 @@
Luckily there is a simple formula to generate [Pythagorean triples](http://en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple). Luckily there is a simple formula to generate [Pythagorean triples](https://en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple).
~~~ ~~~
a = k * (m*m - n*n); a = k * (m*m - n*n);

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

@ -31,7 +31,7 @@ x % 3 == 2
**Sources:** **Sources:**
- [ask-math.com](http://www.ask-math.com/properties-of-square-numbers.html) - [ask-math.com](http://www.ask-math.com/properties-of-square-numbers.html)
- [johndcook.com](http://www.johndcook.com/blog/2008/11/17/fast-way-to-test-whether-a-number-is-a-square/) - [johndcook.com](http://www.johndcook.com/blog/2008/11/17/fast-way-to-test-whether-a-number-is-a-square/)
- [stackoverflow.com](http://stackoverflow.com/questions/295579/fastest-way-to-determine-if-an-integers-square-root-is-an-integer) - [stackoverflow.com](https://stackoverflow.com/questions/295579/fastest-way-to-determine-if-an-integers-square-root-is-an-integer)
If none of this pre-conditions is true we have to manually test the number. If none of this pre-conditions is true we have to manually test the number.
We use the same the same [integer-squareroot](https://en.wikipedia.org/wiki/Integer_square_root) algorithm as in previous problems. We use the same the same [integer-squareroot](https://en.wikipedia.org/wiki/Integer_square_root) algorithm as in previous problems.

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

@ -41,7 +41,7 @@ Linux version
## Special Features ## Special Features
- Fully featured [scintilla editor](http://www.scintilla.org/) for text display - Fully featured [scintilla editor](http://www.scintilla.org/) for text display
- In-editor markdown rendering (similar to [qownnotes](http://www.qownnotes.org/)) - In-editor markdown rendering (similar to [qownnotes](https://www.qownnotes.org/))
- Interactive highlighting of checkbox lists (e.g. TODO lists) - Interactive highlighting of checkbox lists (e.g. TODO lists)
- Clickable + highlighted links - Clickable + highlighted links
- Drop files/text directly into app to create notes - Drop files/text directly into app to create notes

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

@ -1,4 +1,4 @@
This is my collection of tools, libraries and transcompilers for the esoteric programming language [Befunge](http://esolangs.org/wiki/Befunge). This is my collection of tools, libraries and transcompilers for the esoteric programming language [Befunge](https://esolangs.org/wiki/Befunge).
It consists of the following core components: It consists of the following core components:
@ -30,7 +30,7 @@ It consists of the following core components:
Set up Set up
========== ==========
You can either download the binaries from [www.mikescher.com](http://www.mikescher.com/programs/view/BefunUtils). You can either download the binaries from [www.mikescher.com](https://www.mikescher.com/programs/view/BefunUtils).
Or you can setup the Solution by yourself: Or you can setup the Solution by yourself:

4
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. 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. 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](http://www.mikescher.de/about)* *See it live in action [here](https://www.mikescher.de/about)*
### How to use: ### How to use:
@ -114,7 +114,7 @@ Below a crappy example implementation with jQuerys Ajax calls:
<head> <head>
<meta charset="utf-8"> <meta charset="utf-8">
<script src="http://code.jquery.com/jquery-latest.min.js"></script> <script src="https://code.jquery.com/jquery-latest.min.js"></script>
<link rel="stylesheet" type="text/css" href="/style.css"> <link rel="stylesheet" type="text/css" href="/style.css">
<script type="text/javascript" language="JavaScript"> <script type="text/javascript" language="JavaScript">

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

@ -2,7 +2,7 @@ An automatic solver for [Hexcells](http://www.matthewbrowngames.com/hexcells.htm
The idea is to automatically parse the game state, find the next (valid) step and execute it. The idea is to automatically parse the game state, find the next (valid) step and execute it.
*(Rinse and Repeat until everything is solved)* *(Rinse and Repeat until everything is solved)*
### [> Animation](http://gfycat.com/GrotesqueRecklessAcornbarnacle) ### [> Animation](https://gfycat.com/GrotesqueRecklessAcornbarnacle)
##Usage ##Usage
@ -29,6 +29,6 @@ The idea is to automatically parse the game state, find the next (valid) step an
- Dynamically finding the hexagon layout - Dynamically finding the hexagon layout
- With an custom crafted OCR module recognition of the cell values - With an custom crafted OCR module recognition of the cell values
- 3-Step solving of the current configuration (tested on the original levels and many of the generated ones) - 3-Step solving of the current configuration (tested on the original levels and many of the generated ones)
- Finding the optimal execution path by solving the corresponding [TSP](http://en.wikipedia.org/wiki/Travelling_salesman_problem) - Finding the optimal execution path by solving the corresponding [TSP](https://en.wikipedia.org/wiki/Travelling_salesman_problem)
- Automatic execution by programmatically moving the mouse - Automatic execution by programmatically moving the mouse
- Saving the current (captured) state as an [*.hexcells](https://github.com/BlaXpirit/sixcells) file - Saving the current (captured) state as an [*.hexcells](https://github.com/BlaXpirit/sixcells) file

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

@ -1,6 +1,6 @@
SharkSim is my take on a Wa-Tor simulation ([wikipedia.org/wiki/Wator](wikipedia.org/wiki/Wator)) SharkSim is my take on a Wa-Tor simulation ([wikipedia.org/wiki/Wator](https://wikipedia.org/wiki/Wator))
The rules of this [cellular automaton](http://en.wikipedia.org/wiki/Cellular_automaton) are: The rules of this [cellular automaton](https://en.wikipedia.org/wiki/Cellular_automaton) are:
> Time passes in discrete jumps, which I shall call chronons. > Time passes in discrete jumps, which I shall call chronons.
> During each chronon a fish or shark may move north, east, south or west to an adjacent point, provided the point is not already occupied by a member of its own species. > During each chronon a fish or shark may move north, east, south or west to an adjacent point, provided the point is not already occupied by a member of its own species.

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

@ -1,3 +1,3 @@
The [Sive of Ersathothenes](http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes) algorithm is a good way to get all prime numbers up to a specific limit. The [Sive of Ersathothenes](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes) algorithm is a good way to get all prime numbers up to a specific limit.
This programm visualized the algorithm in an *hopefully* easy-to-understand way. This programm visualized the algorithm in an *hopefully* easy-to-understand way.

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

@ -1,4 +1,4 @@
The [Monty-Hall-Problem](http://en.wikipedia.org/wiki/Monty_Hall_problem) is an old mathematical riddle The [Monty-Hall-Problem](https://en.wikipedia.org/wiki/Monty_Hall_problem) is an old mathematical riddle
> Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? > Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice?

2
www/statics/programs/__all.php
View File

@ -278,7 +278,7 @@ return
'urls' => 'urls' =>
[ [
'download' => 'direct', 'download' => 'direct',
'sourceforge' => 'http://sourceforge.net/projects/jcircuits/', 'sourceforge' => 'https://sourceforge.net/projects/jcircuits/',
], ],
], ],

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

@ -14,7 +14,7 @@ jClipCorn
- Fully portable - leave the program, the database and the settings on the same *(external)* drive as your movies - Fully portable - leave the program, the database and the settings on the same *(external)* drive as your movies
- Multi language (German & English), if you want you can help me translate it into other languages. - Multi language (German & English), if you want you can help me translate it into other languages.
- Parse meta data from the [IMDB](http://www.imdb.com/) - Parse meta data from the [IMDB](https://www.imdb.com/)
- Filter your movies by many different criterias (date, genre, name, film series, quality, language, MPAA rating ...) - Filter your movies by many different criterias (date, genre, name, film series, quality, language, MPAA rating ...)
- Remember which movies you have watched and where you are in a series - Remember which movies you have watched and where you are in a series
- Automatically generate nice file names and folder structures for your movies and series - Automatically generate nice file names and folder structures for your movies and series
@ -22,8 +22,8 @@ jClipCorn
- Tag and rate your watched movies - Tag and rate your watched movies
- Works under Windows, Linux *(and probably OS X)* - Works under Windows, Linux *(and probably OS X)*
#[> DOWNLOAD](http://www.github.com/Mikescher/jClipCorn/releases) #[> DOWNLOAD](https://www.github.com/Mikescher/jClipCorn/releases)
###[> HOMEPAGE](http://www.mikescher.com/programs/view/jClipCorn) ###[> HOMEPAGE](https://www.mikescher.com/programs/view/jClipCorn)
###[> GITHUB WIKI](https://github.com/Mikescher/jClipCorn/wiki) ###[> 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)
@ -70,7 +70,7 @@ At first you should look into the settings and eventually change a few things, i
- UI Language - UI Language
- Look'n'Feel (It's recommended to either use *Windows* or *Metal*) - Look'n'Feel (It's recommended to either use *Windows* or *Metal*)
- VLC Path (path to *vlc.exe*, for playing. You can also use another player - but it works best with the [VLC player](http://www.videolan.org/vlc/)) - VLC Path (path to *vlc.exe*, for playing. You can also use another player - but it works best with the [VLC player](https://www.videolan.org/vlc/))
- The backup settings (I recommend to **enable** automatic backups *(like every 7 days or so)*) - The backup settings (I recommend to **enable** automatic backups *(like every 7 days or so)*)
- Automatic relative paths (this should really stay active - otherwise paths will be absolute and everything can go havoc if ClipCorn runs on an external drive) - Automatic relative paths (this should really stay active - otherwise paths will be absolute and everything can go havoc if ClipCorn runs on an external drive)

16
www/statics/updates/_all.php
View File

@ -2,13 +2,13 @@
return return
[ [
'H²O' => [ 'version' => '3.4', 'url' => 'http://www.mikescher.com/programs/view/H2O', ], 'H²O' => [ 'version' => '3.4', 'url' => 'https://www.mikescher.com/programs/view/H2O', ],
'LAN-Control' => [ 'version' => '2.0', 'url' => 'http://www.mikescher.com/programs/view/LAN-Control', ], 'LAN-Control' => [ 'version' => '2.0', 'url' => 'https://www.mikescher.com/programs/view/LAN-Control', ],
'WTG' => [ 'version' => '1.3.3', 'url' => 'http://www.mikescher.com/programs/view/Wikipedia - The Game', ], 'WTG' => [ 'version' => '1.3.3', 'url' => 'https://www.mikescher.com/programs/view/Wikipedia - The Game', ],
'ClipCorn' => [ 'version' => '1.5.6', 'url' => 'http://www.mikescher.com/programs/view/ClipCorn', ], 'ClipCorn' => [ 'version' => '1.5.6', 'url' => 'https://www.mikescher.com/programs/view/ClipCorn', ],
'DLF' => [ 'version' => '1.0.2', 'url' => 'http://www.mikescher.com/programs/view/Dynamic Link Fighters', ], 'DLF' => [ 'version' => '1.0.2', 'url' => 'https://www.mikescher.com/programs/view/Dynamic Link Fighters', ],
'InfinityTournament' => [ 'version' => '1.5', 'url' => 'http://www.mikescher.com/programs/view/Infinity Tournament', ], 'InfinityTournament' => [ 'version' => '1.5', 'url' => 'https://www.mikescher.com/programs/view/Infinity Tournament', ],
'absCanvas' => [ 'version' => '0.64', 'url' => 'http://www.mikescher.com/programs/view/absCanvas', ], 'absCanvas' => [ 'version' => '0.64', 'url' => 'https://www.mikescher.com/programs/view/absCanvas', ],
'CrystalGrid' => [ 'version' => '1.2', 'url' => 'http://www.mikescher.com/programs/view/Crystal Grid', ], 'CrystalGrid' => [ 'version' => '1.2', 'url' => 'https://www.mikescher.com/programs/view/Crystal Grid', ],
'jClipCorn' => [ 'version' => '1.10.3', 'url' => 'https://github.com/Mikescher/jClipCorn/releases', ], 'jClipCorn' => [ 'version' => '1.10.3', 'url' => 'https://github.com/Mikescher/jClipCorn/releases', ],
]; ];