The Orchard Planting contest from infinite search space is over. So it is time for a quick write-up.
The rules are simple, on a grid of integers, place N points on the grid to get as much 4 points on a line and never more then 4 points on a line.
My big break-through [...]
A couple of days ago I first encountered “bytebeat”. This is a new hype revolving algorithmic music and sounds. The basic idea is this:
main(t) { for(t=0;;t++) putchar( t * (((t>>12) | (t>>8) ) & ( 63 & (t>>4)))); }
This simple loop has one variable, t (time). And every iteration we use t to [...]
Yes! Another new programming contest: Orchard Planting
The problem:
On a grid you have to place trees (dots). If there are four trees in a line, you’ll get a point. But: more then 4 trees in a line is illegal. What are the best solutions for N=11 to 60 trees?
Up to now [...]
This year I’ll be presenting at Devoxx in Antwerp, Belgium. In my opinion it currently is the best Java conference in the world. It’ll be my first talk in English.
The titel of the talk is: What Shazam doesn’t want you to know.
During the talk I’ll be explaining how Shazam works and [...]
Latest tweet
- Unique, there is only one traffic jam in the Netherlands currently! The only problem? It is almost 1000km long.
Links
Archives

