# Gaussian elimination step by step

It’s easy to make small stupid mistakes when you do matrix calculations manually. I put together a simple tool in javascript that performs Gaussian elimination step by step.

http://g.bonds.nu/gauss/

Enjoy 🙂

Annonser

# Efficient recursive maze algorithm

I made a recursive bisecting maze algorithm in just eight lines of code. (click on above image to see it in action)

The efficiency of the algorithm comes at the cost of a fairly low entropy. It means that the randomness of the maze is limited. A high entropy algorithm could ideally produce a maze where you had to traverse every room in the labyrinth in order to move from the room in the bottom left corner to the room to it’s immediate right. This could never be the case with the above listed bisecting algorithm where internal access between rooms within the same bisection is always guarantied.

# Smoothest Possible Line

I lost myself in an equation last night. Didn’t get much sleep. What’s the smoothest possible line connecting four arbitrary points? Find out for yourself by dragging the points around in the javascript program I made. Click on the picture…

# Cthulhu Fhtagn Animation

I made an animation using javascript and html5 today. Click on the image above to see the result. I spent the whole morning sketching out how the tentacles should move. Below is my final sketch. I chopped it up into eight phases.

I’m using the animation now as an intro to g.bonds.nu