This is the small test page of a CS student in Germany called Andreas Kovalski
Feel free to check out my small hobby projects I made over the years.
Most if not all of them can be found at
my GitHub
Maybe I will take the time at some point to make the starting page pretty, but for now, this is mostly a testing page.
A semifinished webapp to visualize graphs and explain graph algorithms.
Currenlty, only DFS and BFS can be executed, which is the minimum of what I wanted to achieve.
It couldn't hurt to add some more algorithms though.
A generalization of
Conway's Game of Life.
You can define your own states and rules, and test them out on a small grid
(At this point, I have implemeted the GoL about 5 times. My obsession really needs to stop.)
I wanted to verify my exercises for my logic course in university.
Sadly there were no tools online to specifically verify the execution of
resolution.
Instead, I decided to make my own, which was suprisingly easy. I even added an explanation, mostly written shoddily at 4AM in the morning.
My friend once challanged me to write a solver for sudoku, so here is one using recursive backtracking
This was done in a few hours, and it really shows. I am sorry for using a slider to show every iteration, it truly is horribe to use.
(Small tip: Use the arrow keys to see the next or previous step)
Being inspired by a presentation I needed to do, I made a solver that creates a sequent calculus proof for a propositional formula.
I also wrote a parser to easily type in sequents. I also had a lot of fun just implementing random stuff for propositional formulas, that isn't even used.
Read more about it on
the GitHub page