I recently came upon yet another great little puzzle: 0h h1: The rules are quite simple: you have to fill each cell with either a red or a blue value each row and each column must have the same number … Weiterlesen →

A few days pack I posted the prisoners puzzle and I think it’s time to give the solution. solution Obviously the prisioners can only use the both switches to communicate with one another after the planning phase so we have … Weiterlesen →

Today I stumpled upon a very nice and concise (but quite hard to understand) point-free implementation of Pascals-Triangle in Haskell: let’s first confirm that this really works (…magic): Seems to work. But how … Of course I know how to … Weiterlesen →

Toda I saw this puzzle I’ve not seen for a long time: A warden meets with 23 newly arrived prisoners. He tells them, “You may meet today and plan a strategy. But after today, you will be in isolated cells … Weiterlesen →

I assume you installed mono (I got mono-complete) and git already. This should be easy using apt-get, synaptic or the software-store. This is just my write-down of the things I had to do while following the documentation on github, as … Weiterlesen →