Performance versus elegant code, a never ending trade off [Desiderius part #19]

Generating with constraints So, the next step, actually generating things. As I wrote last week, my strategy first was to generate entirely random hands. But! I realized that if we do that, we make some assumptions about our partner, because they will have an average hand. I then wanted to generate a random hand for Read more about Performance versus elegant code, a never ending trade off [Desiderius part #19][…]

A fitness function for bidding systems [Desiderius part #17]

Last week I explained why a DSL and genetic programming are such an awesome combination. So, we can almost start to mutate our ACOL code. But, there is one thing we need: a fitness function, a function that tells us we are going the right way. When mutating a string, we used the Levenshtein distance Read more about A fitness function for bidding systems [Desiderius part #17][…]

Intro Genetic Programming [Desiderius part #15]

I missed a weekend, sorry guys! I was busy babysitting a five year old and contemplating the LambdaConf situation. To make it up I have a totally fresh and new topic to talk about: genetic programming. I do not want to design a bidding systems, I want to make the best one possible, and for Read more about Intro Genetic Programming [Desiderius part #15][…]