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

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