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 # # # # # # #