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

ParsedownCustom

Browse Source
This commit is contained in:
Mike Schwörer
2018-01-01 23:03:05 +01:00
parent 32f1e8437b
commit e56ca264a3
36 changed files with 939 additions and 277 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -9,7 +9,50 @@ The thing that surprised me the most is the [strategically depth](http://esolang
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:
```
{{CODE}}
> # Build 9 big decoys
(-)*4>(+)*4> # A few small ones
(>)*6
(<(-)*80<(+)*80)*3 # And more big ones
<(+)*76 # For Confusion :/
<(-)*76
<(-)*28 # Just for you, Wall E
(>)*10
( # Walk forwards and clear everything
([+ # clear pos decoys
{
(-)*16
(-[ # clear neg decoys
{
(-)*112 # Big decoy / flag clearen: 128~16=112
[+]
}
])%16
}
])%16
[-] # Counter DecoyBot ~_~
(+)*2 # Leave a small trail behind
>
([- # The same thing with reversed polarity
{
(+)*16
(+[
{
(+)*112
[-]
}
])%16
}
])%16
[+]
(-)*2
>
)*11
```
A few notes to the BFJoust extensions to the brainfuck language:
@@ -28,3 +71,53 @@ I wrote a little [BFJoust script](https://maximum-sonata.codio.io/index.html) wh
And at last a few words to the arena: In BFJoust there are 40 different settings, every board length two times. One time normal and one time with one bot inverted (`+` <-> `-`). This way you can eliminate luck and see which bot performs better.
```bfjoustrunner
> # Build 9 big decoys
(-)*4>(+)*4> # A few small ones
(>)*6
(<(-)*80<(+)*80)*3 # And more big ones
<(+)*76 # For Confusion :/
<(-)*76
<(-)*28 # Just for you, Wall E
(>)*10
( # Walk forwards and clear everything
([+ # clear pos decoys
{
(-)*16
(-[ # clear neg decoys
{
(-)*112 # Big decoy / flag clearen: 128~16=112
[+]
}
])%16
}
])%16
[-] # Counter DecoyBot ~_~
(+)*2 # Leave a small trail behind
>
([- # The same thing with reversed polarity
{
(+)*16
(+[
{
(+)*112
[-]
}
])%16
}
])%16
[+]
(-)*2
>
)*11
------------------------------------------------------------------------------------------------------------------------
#Patashu_lazy from #esoteric hill
>(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5(>(-.)*128)*21[-]((-)*2048(+)*2048.)*2
```

44
www/statics/blog/bfjoust_MultiVAC.bfjoust
View File

@@ -1,44 +0,0 @@
> # Build 9 big decoys
(-)*4>(+)*4> # A few small ones
(>)*6
(<(-)*80<(+)*80)*3 # And more big ones
<(+)*76 # For Confusion :/
<(-)*76
<(-)*28 # Just for you, Wall E
(>)*10
( # Walk forwards and clear everything
([+ # clear pos decoys
{
(-)*16
(-[ # clear neg decoys
{
(-)*112 # Big decoy / flag clearen: 128~16=112
[+]
}
])%16
}
])%16
[-] # Counter DecoyBot ~_~
(+)*2 # Leave a small trail behind
>
([- # The same thing with reversed polarity
{
(+)*16
(+[
{
(+)*112
[-]
}
])%16
}
])%16
[+]
(-)*2
>
)*11

3
www/statics/blog/bfjoust_Patashu_lazy.bfjoust
View File

@@ -1,3 +0,0 @@
#Patashu_lazy from #esoteric hill
>(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5(>(-.)*128)*21[-]((-)*2048(+)*2048.)*2

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

@@ -1,10 +1,10 @@
![rapla_logo](/data/blog/Rapscript/logo.png)
![rapla_logo](/data/images/blog/rapla_logo.png)
I don't think many of you know [rapla](https://code.google.com/p/rapla/). And you should probably be thankful about that. But if you happen to study at the DHBW-KA, or any other place that uses rapla you could be interested in my enhancement-script.
Rapla is a Resource scheduling and event planing software (mostly used for timetables), and my rapscript enhances the *(not very good)* online view.
![full_preview](/data/blog/Rapscript/preview.png)
![full_preview](/data/images/blog/rapla_preview.png)
It contains the following features:
@@ -18,5 +18,5 @@ It contains the following features:
The script works on [Greasemonkey](https://addons.mozilla.org/de/firefox/addon/greasemonkey/) for Firefox or [Tampermonkey](https://chrome.google.com/webstore/detail/tampermonkey/dhdgffkkebhmkfjojejmpbldmpobfkfo) for Google Chrome and can be downloaded from this Gist:
[Open Gist](https://gist.github.com/Mikescher/f3d51a40dd0c5228df86)
# [Open Gist](https://gist.github.com/Mikescher/f3d51a40dd0c5228df86)

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

@@ -1,4 +1,4 @@
![sudoku debug](/data/blog/SudokuSolver/sudoku.png)
![sudoku debug](/data/images/blog/sudoku.png)
Because of [this project euler puzzle](https://www.mikescher.com/blog/1/Project_Euler_with_Befunge/problem-096) I spend the last few days implementing a sudoku solver in befunge-93 (as always I ignored the 80x25 size restriction because otherwise befunge-93 would be not turing-complete and I'm pretty sure this problem impossible).
@@ -7,7 +7,7 @@ My solver is universal and can solve both ones. If there are no obvious cells it
Below i try to describe my general approach and a few caveats I stumbled across. You can look at the full up-to-date source code on [github](https://github.com/Mikescher/BefungePrograms).
~~~
~~~befungerunner
v XX ########### ########### ############################# #############################
C C #36 2 89# # # # # # #
PPPPP # 361 # # # # # # #

2
www/statics/euler/Euler_Problem-015_description.md
View File

@@ -1,5 +1,5 @@
Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
![Grid Image](/data/blog/Befunge/p015.gif)
![Grid Image](/data/images/blog/p015.gif)
How many such routes are there through a 20×20 grid?

4
www/statics/euler/Euler_Problem-068_description.md
View File

@@ -1,6 +1,6 @@
Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine.
![](https://projecteuler.net/project/images/p068_1.gif)
![](/data/images/blog/p068_1.gif)
Working clockwise, and starting from the group of three with the numerically lowest external node (4,3,2 in this example), each solution can be described uniquely.
For example, the above solution can be described by the set: `4,3,2; 6,2,1; 5,1,3`.
@@ -23,4 +23,4 @@ By concatenating each group it is possible to form 9-digit strings; the maximum
Using the numbers 1 to 10, and depending on arrangements, it is possible to form 16- and 17-digit strings.
What is the maximum 16-digit string for a "magic" 5-gon ring?
![](https://projecteuler.net/project/images/p068_2.gif)
![](/data/images/blog/p068_2.gif)

2
www/statics/euler/Euler_Problem-085_description.md
View File

@@ -1,6 +1,6 @@
By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:
![Grid Image](/data/blog/Befunge/p085.gif)
![Grid Image](/data/images/blog/p085.gif)
Although there exists no rectangular grid that contains exactly two million rectangles,
find the area of the grid with the nearest solution.

4
www/statics/euler/Euler_Problem-091_description.md
View File

@@ -1,7 +1,7 @@
The points `P(x1, y1)` and `Q(x2, y2)` are plotted at integer co-ordinates and are joined to the origin,
`O(0,0)`, to form `OPQ`.
![img](/data/blog/Befunge/p091_1.gif)
![img](/data/images/blog/p091_1.gif)
There are exactly fourteen triangles containing a right angle that can be formed when each co-ordinate
lies between 0 and 2 inclusive; that is,
@@ -10,6 +10,6 @@ lies between 0 and 2 inclusive; that is,
0 <= x1, y1, x2, y2 <= 2.
~~~
![img](/data/blog/Befunge/p091_2.gif)
![img](/data/images/blog/p091_2.gif)
Given that `0 <= x1, y1, x2, y2 <= 50`, how many right triangles can be formed?